Abstract
We extend Baker's theory of parameterized pattern matching [Proc. 25th Annual STOC, 1993, pp. 71–80] 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.
Supported by NSF grant DMS-90-05833.
Partially supported by NSF grant CCR-9010534.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho and M. J. Corasick. Efficient string matching: An aid to bibliographic search. Comm. ACM, 18:333–340, 1975.
A. Amir and M. Farach. Adaptive dictionary matching. Proc. of the 32nd IEEE Annual Symp. on Foundation of Computer Science, pages 760–766, 1991.
A. Amir, M. Farach, R. Giancarlo, Z. Galil, and K. Park. Dynamic dictionary matching. Manuscript, 1991.
A. Amir, M. Farach, R. M. Idury, J. A. La Poutré, and A. A. Schäffer. Improved dynamic dictionary matching. Proc. of the Fourth Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 392–401, 1993. Full paper to appear in Information and Computation.
A. Amir, M. Farach, and S. Muthukrishnan. Alphabet dependence in parameterized matching. To appear in Information Processing Letters, 1994.
B. Baker. A theory of parameterized pattern matching: algorithms and applications. Proc. of the 25th Ann. ACM Symp. on Theory of Computing, pages 71–80, 1993.
M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, chapter 12, pages 97–107. NATO ASI Series F: Computer and System Sciences, 1985.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
P. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. of the 19th Ann. ACM Symp. on Theory of Computing, pages 365–372, 1987. To appear in J. Comp. Syst. Sci.
R. H. Güting and D. Wood. The parenthesis tree. Information Sciences, 27:151–162, 1982.
R. M. Idury and A. A. Schäffer. Dynamic dictionary matching with failure functions. In Proc. of the Third Symp. on Combinatorial Pattern Matching, Lecture Notes Comp. Sci. 644: pages 276–287, 1992. Full paper to appear in Theoretical Computer Science.
D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323–350, 1977.
E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23:262–272, 1976.
K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, 1984.
B. Meyer. Incremental string matching. Information Processing Letters, 21:219–227, 1985.
P. Weiner. Linear pattern matching algorithm. Proc. of the 14th IEEE Annual Symp. on Switching and Automata Theory, pages 1–11, 1973.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Idury, R.M., Schäffer, A.A. (1994). Multiple matching of parameterized patterns. In: Crochemore, M., Gusfield, D. (eds) Combinatorial Pattern Matching. CPM 1994. Lecture Notes in Computer Science, vol 807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58094-8_20
Download citation
DOI: https://doi.org/10.1007/3-540-58094-8_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58094-2
Online ISBN: 978-3-540-48450-9
eBook Packages: Springer Book Archive