Skip to main content
Conference ProceedingsOPEN ACCESS

The tree inclusion problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 493 LNCS 202-214
DOI: 10.1007/3-540-53982-4_12
16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the following problem: Given ordered albeled trees S and T, can S be obtained from T by deleting nodes? Deletion of the root node u of a subtree with children 〈T1, …, Tn〉 means replacing the subtree by the trees T1, …, Tn. The problem is motivated by the study of query languages for structured text data bases. The simple solutions to this problem require exponential time. We give an algorithm based on dynamic programming requiring O(|S||T|) time and space.

Cite

CITATION STYLE

APA

Kilpeläinen, P., & Mannila, H. (1991). The tree inclusion problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 493 LNCS, pp. 202–214). Springer Verlag. https://doi.org/10.1007/3-540-53982-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free