Abstract
We give counterexamples to show that the algorithm presented recently by Makinen fails to solve the subtree isomorphism problem for rooted ordered trees. We also give linear time algorithms for the two versions of the subtree isomorphism problem for rooted ordered trees.
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
