Two Dimensional Pattern Matching

@article{Bird1977TwoDP,
  title={Two Dimensional Pattern Matching},
  author={Richard S. Bird},
  journal={Inf. Process. Lett.},
  year={1977},
  volume={6},
  pages={168-170}
}
The Knuth-Morris-Pratt algorithm [3] solves the following string matching problem: given a string of symbols p1 p2 l se pn, called the pattern, and a second string tl t2 l -e tm, called the text, to determine for each j whether or not ti,++ ! l -ti = plp2 l -p,. The KMP algorithm possesses the f4owing noteworthy properties: (1) its running time is O(n + m), where the coefficient of proportionality is small and independent of the size of the alphabet; (2) its space requirements are O(n), so no… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 80 CITATIONS

FILTER CITATIONS BY YEAR

1983
2018

CITATION STATISTICS

  • 12 Highly Influenced Citations

  • Averaged 3 Citations per year over the last 3 years

Similar Papers

Loading similar papers…