Abstract
The standard string matching problem involves finding all occurrences of a single pattern in a single text. While this approach works well in many application areas, there are some domains in which it is more appropriate to deal with dictionaries of patterns. A dictionary is a set of patterns; the goal of dictionary matching is to find all dictionary patterns in a given text, simultaneously.
In string matching, randomized algorithms have primarily made use of randomized hashing functions which convert strings into “signatures” or “finger prints”. We explore the use of finger prints in conjunction with other randomized and deterministic techniques and data structures. We present several new algorithms for dictionary matching, along with parallel algorithms which are simpler of more efficient than previously known algorithms.
Original language | American English |
---|---|
Title of host publication | Annual Symposium on Combinatorial Pattern Matching |
Editors | Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
Publisher | Springer Berlin Heidelberg |
State | Published - 1992 |