Multiple matching of parameterized patterns

We extend Baker's theory of parameterized string matching (1993) to algorithms that match multiple patterns in a text. We first consider the case where the patterns are fixed and preprocessed once, and then the case where the pattern set can change by insertions and deletions. Baker's algorithms are based on suffix trees, whereas ours are based on pattern matching automata.

Authors

• Ramana M. Idury
• Alejandro A. Schäffer

Keywords

No keywords are indexed for this paper.