Tree Pattern Matching for Linear Static Terms

In this paper, we present a simple algorithm for pattern matching within a family of trees called linear terms, that have many applications in the design of programming languages, theorem proving and symbolic computation for example. Our algorithm relies on the representation of a tree by words. It has a quadratic worst-case time complexity, which is worse than the best known algorithm, but experimental results on uniformly distributed random binary terms suggest a linear expected time and interesting practical behavior.

[1]  Richard Cole,et al.  Tree pattern matching and subset matching in deterministic O(n log3 n)-time , 1999, SODA '99.

[2]  Kaizhong Zhang,et al.  Comparing multiple RNA secondary structures using tree comparisons , 1990, Comput. Appl. Biosci..

[3]  Alfred V. Aho,et al.  Efficient Tree Pattern Matching: An Aid to Code Generation. , 1985 .

[4]  S. Rao Kosaraju,et al.  Efficient tree pattern matching , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Richard Cole,et al.  Tree pattern matching and subset matching in randomized O(nlog3m) time , 1997, STOC '97.

[6]  Zvi Galil,et al.  Faster tree pattern matching , 1994, JACM.

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

[8]  Tetsuo Shibuya.  Constructing the Suffix Tree of a Tree with a Large Alphabet , 1999, ISAAC.

[9]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[10]  Alfred V. Aho,et al.  Efficient tree pattern matching (extended abstract): an aid to code generation , 1985, POPL '85.

[11]  Cédric Chauve,et al.  Tree pattern matching with a more general notion of occurrence of the pattern , 2002, Inf. Process. Lett..

[12]  Fabrizio Luccio,et al.  Simple Solutions for Approximate Tree Matching Problems , 1991, TAPSOFT, Vol.1.

[13]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[14]  Wojciech Rytter,et al.  Text Algorithms , 1994 .

[15]  Jean-Marc Steyaert,et al.  Patterns and Pattern-Matching in Trees: An Analysis , 1984, Inf. Control..

[16]  Mikkel Thorup.  Efficient Preprocessing of Simple Binay Pattern Forests , 1996, J. Algorithms.

[17]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[18]  Fabrizio Luccio,et al.  Approximate Matching for Two Families of Trees , 1995, Inf. Comput..

[19]  Robert E. Tarjan,et al.  More Efficient Bottom-Up Multi-Pattern Matching in Trees , 1992, Theor. Comput. Sci..

[20]  Fabrizio Luccio,et al.  An Efficient Algorithm for Some Tree Matching Problems , 1991, Inf. Process. Lett..