Faster tree pattern matching

Recently, R. Kosaraju (Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, p.178-83) gave an O(nm/sup 0.75/ polylog(m))-step algorithm for tree pattern matching. The authors improve this result by designing a simple O(n square root m polylog (m)) algorithm.<<ETX>>

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

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

[3]  M. Fischer,et al.  STRING-MATCHING AND OTHER PRODUCTS , 1974 .

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