Faster tree pattern matching

Recently R. Kosaraju gave an O(nmo.75polylog(m)) step algorithm for tree pattern matching. We improve this result by designing a simple O(n6 polylog(m)) algorithm.

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

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

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

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