Fast exact string matching algorithms

@article{Lecroq2007FastES,
  title={Fast exact string matching algorithms},
  author={Thierry Lecroq},
  journal={Inf. Process. Lett.},
  year={2007},
  volume={102},
  pages={229-235}
}
String matching is the problem of finding all the occurrences of a pattern in a text. We propose a very fast new family of string matching algorithms based on hashing q-grams. The new algorithms are the fastest on many cases, in particular, on small size alphabets. © 2007 Elsevier B.V. All rights reserved. 
Highly Cited
This paper has 98 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

98 Citations

01020'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 98 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Fast variants of bit parallel approach to suffix automata

  • J. Holub, B. Durian
  • Talk given in: The Second Haifa Annual…
  • 2005
2 Excerpts

Crochemore

  • C. Allauzen
  • M. Raffinot, Factor oracle: A new structure for…
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…