Paper Info
Title
Multiple matching of parameterized patterns
Abstract
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.
Year
DOI
Venue
1996
10.1016/0304-3975(94)00270-3
CPM
Keywords
DocType
Volume
pattern matching
Journal
154
Issue
ISSN
Citations 
2
0304-3975
27
PageRank 
References 
Authors
1.73
15
2
Name
Order
Citations
PageRank
Ramana M. Idurys120424.03
Alejandro A. Schäffer2827136.66