| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428217 | Information Processing Letters | 2007 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
