Fast exact string matching algorithms
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. (c) 2007 Elsevier B.V. All rights reserved.
string matching hashing design of algorithms