Multiple Matching of Parameterized Patterns

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.

[1]  Zvi Galil,et al.  A Note on Set Union with Arbitrary Deunions , 1991, Inf. Process. Lett..

[2]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[3]  S. Muthukrishnan,et al.  Alphabet Dependence in Parameterized Matching , 1994, Inf. Process. Lett..

[4]  Brenda S. Baker,et al.  A theory of parameterized pattern matching: algorithms and applications , 1993, STOC.

[5]  Derick Wood,et al.  The parenthesis tree , 1982, Inf. Sci..

[6]  Alejandro A. Schäffer,et al.  Improved dynamic dictionary matching , 1995, SODA '93.

[7]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[8]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[9]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[10]  Amihood Amir,et al.  Adaptive dictionary matching , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[13]  Raffaele Giancarlo,et al.  Dynamic Dictionary Matching , 1994, J. Comput. Syst. Sci..

[14]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[15]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[16]  Bertrand Meyer.  Incremental String Matching , 1985, Inf. Process. Lett..

[17]  J. Seiferas,et al.  Efficient and Elegant Subword-Tree Construction , 1985 .

[18]  Alejandro A. Schäffer,et al.  Dynamic Dictionary Matching with Failure Functions (Extended Abstract) , 1992, CPM.

[19]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 1 , 1984, EATCS.

[20]  Alejandro A. Schäffer,et al.  Dynamic Dictionary Matching with Failure Functions , 1994, Theor. Comput. Sci..