On the Subtree Isomorphism Problem for Ordered Trees

This note deals with the subtree isomorphism problem: Given two rooted trees T 1 and T 2 , decide whether T 1 is isomorphic to any subtree of T 2 . We show that a O(m+n) time algorithm can be obtained when restricting ourselves to ordered trees only. Our algorithm is based on tree encoding and on string pattern matching

[1]  Steven W. Reyner,et al.  An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

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

[3]  Shmuel Zaks,et al.  Lexicographic Generation of Ordered Trees , 1980, Theor. Comput. Sci..

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