MULTIPLE MATCHING OF PARAMETERIZED PATTERNS

Authors
IDURY RM SCHAFFER AA
Citation
Rm. Idury et Aa. Schaffer, MULTIPLE MATCHING OF PARAMETERIZED PATTERNS, Theoretical computer science, 154(2), 1996, pp. 203-224
Citations number
21
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
154
Issue
2
Year of publication
1996
Pages
203 - 224
Database
ISI
SICI code
0304-3975(1996)154:2<203:MMOPP>2.0.ZU;2-8
Abstract
We extend Baker's theory of parameterized string matching (1993) to al gorithms 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. Ba ker's algorithms are based on suffix trees, whereas ours are based on pattern matching automata.