Abstract
We concentrate in this paper on multiple pattern matching, in which a set of patterns S={P 1, ...,P k }, rather than a single one, is to be located in a given text T. This problem has been treated in several works, including Aho and Corasick, Commentz-Walter, Uratani and Takeda and Crochemore et al. None of these algorithms assumes any relationships between the individual patterns. Nevertheless, there are many situations where the given strings are not necessarily independent.
| Original language | American English |
|---|---|
| Title of host publication | International Symposium on String Processing and Information Retrieval |
| Editors | Alberto Apostolico, Massimo Melucci |
| Publisher | Springer Berlin Heidelberg |
| State | Published - 2004 |