Constrained Tree Inclusion
- 468 Downloads
The tree matching problem is considered of given labeled trees P and T, determining if the pattern tree P can be obtained from the text tree T by deleting degree-one and degree-two nodes and, in the case of unordered trees, by also permuting siblings. The constrained tree inclusion problem is more sensitive to the structure of the pattern tree than the general tree inclusion problem. Further, it can be solved in polynomial time for both unordered and ordered trees. Algorithms based on the subtree homeomorphism algorithm of (Chung, 1987) are presented that solve the constrained tree inclusion problem in O(m 1.5 n) time on unordered trees with m and n nodes, and in O(mn) time on ordered trees, using O(mn) additional space. These algorithms can be improved using results of (Shamir and Tsur, 1999) to run in O((m 1.5/ logm)n) and O((m/logm)n) time, respectively.
KeywordsTree inclusion tree pattern matching subtree homeomorphism noncrossing bipartite matching
Unable to display preview. Download preview PDF.
- 1.S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 2000.Google Scholar
- 10.P. Kilpeläinen and H. Mannila. Retrieval from hierarchical texts by partial patterns. In Proc. 16th Annual Int. ACM SIGIR Conf. Research and Development in Information Retrieval, pages 214–222. ACM Press, 1993.Google Scholar
- 19.T. Richter. A new algorithm for the ordered tree inclusion problem. In Proc. 8th Annual Symp. Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 150–166. Springer-Verlag, 1997.Google Scholar
- 22.G. Valiente. An efficient bottom-up distance between trees. In Proc. 8th Int. Symp. String Processing and Information Retrieval, pages 212–219, Piscataway NJ, 2001. IEEE Computer Science Press.Google Scholar
- 27.K. Zhang. Efficient parallel algorithms for tree editing problems. In Proc. 7th Annual Symp. Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science, pages 361–372, Berlin Heidelberg, 1996. Springer-Verlag.Google Scholar