Fast exact string matching algorithms

https://doi.org/10.1016/j.ipl.2007.01.002Get rights and content

Abstract

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.

References (13)

  • C. Allauzen et al.

    Factor oracle: A new structure for pattern matching

  • D. Cantone et al.

    Fast-search: A new efficient variant of the Boyer–Moore string matching algorithm

  • C. Charras et al.

    Handbook of Exact String Matching Algorithms

    (2004)
  • M. Crochemore, T. Lecroq, A fast implementation of the Boyer–Moore string matching algorithm, submitted for...
  • K. Fredriksson et al.

    Practical and optimal string matching

  • J. Holub et al.

    Fast variants of bit parallel approach to suffix automata. Talk given in: The Second Haifa Annual International Stringology Research Workshop of the Israeli Science Foundation

There are more references available in the full text version of this article.

Cited by (0)

View full text