Abstract.
We consider the following problem: Given ordered labeled trees S and T can S be obtained from T by deleting nodes? Deletion of the root node u of a subtree with children \((T_1, \ldots,T_n)\) means replacing the subtree by the trees \(T_1, \ldots,T_n\). For the tree inclusion problem, there can generally be exponentially many ways to obtain the included tree. P. Kilpelinen and H. Mannila [5,7] gave an algorithm based on dynamic programming requiring \(O(\mid S\mid.\mid T \mid)\) time and space in the worst case and also on the average for solving this problem. We give an algorithm whose idea is similar to that of [5,7] but which improves the previous one and on the average breaks the \(\mid S\mid.\mid T \mid\) barrier.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 4 November 1996 / 2 March 2001
Rights and permissions
About this article
Cite this article
Alonso, L., Schott, R. On the tree inclusion problem. Acta Informatica 37, 653–670 (2001). https://doi.org/10.1007/PL00013317
Issue Date:
DOI: https://doi.org/10.1007/PL00013317