Two-Way String Matching

@article{Crochemore1991TwoWaySM,
  title={Two-Way String Matching},
  author={Maxime Crochemore and Dominique Perrin},
  journal={J. ACM},
  year={1991},
  volume={38},
  pages={651-675}
}
A new string-matching algorithm is presented, which can be viewed as an intermediate between the classical algorithms of Knuth, Morris, and Pratt on the one hand and Boyer and Moore, on the other hand. The algorithm is linear in time and uses constant space as the algorithm of Galil and Seiferas. It presents the advantage of being remarkably simple which consequently makes its analysis possible. The algorithm relies on a previously known result in combinatorics on words, called the Critical… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
86 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 86 extracted citations

Similar Papers

Loading similar papers…