Abstract
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
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
