论文信息 - Efficient tree pattern matching

Efficient tree pattern matching

A classic open problem on tree pattern matching is whether the naive O(mn)-step algorithm for finding all the occurrences of a pattern tree of size m in a text tree of size n can be improved. An O(nM/sup 0.75/ polylog(m))-step algorithm for this tree pattern matching problem is designed. The problems of linear string matching with don't care symbols and linear string max-min convolution are treated.<<ETX>>

S. Rao Kosaraju | S. Kosaraju

[1] Ron Y. Pinter,et al. Efficient String Matching with Don’t-Care Patterns , 1985 .

[2] Arnold L. Rosenberg,et al. Rapid identification of repeated patterns in strings, trees and arrays , 1972, STOC.

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

[4] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[5] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

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

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

[8] Karl R. Abrahamson. Generalized String Matching , 1987, SIAM J. Comput..

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

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

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

[12] S. Rao Kosaraju. Parallel Evaluation of Division-Free Arithmetic Expressions , 1986, STOC 1986.