An Isolated-Subtree Inclusion for Unordered Trees

An unordered tree inclusion is the problem of determining whether or not an unordered tree P is included in an unordered tree T. In this paper, we introduce an isolated-sub tree inclusion by restricting that disjoint sub trees of P are always included in disjoint sub trees of T. Then, we design the algorithm to solve the isolated-sub tree inclusion in O(|T|·|P|1.5) time and in O(|T|·|P|) space.

[1]  Sudarshan S. Chawathe,et al.  Comparing Hierarchical Data in External Memory , 1999, VLDB.

[2]  Kaizhong Zhang,et al.  Finding similar consensus between trees: an algorithm and a distance hierarchy , 2001, Pattern Recognit..

[3]  Kaizhong Zhang,et al.  Algorithms for the constrained editing distance between ordered labeled trees and related problems , 1995, Pattern Recognit..

[4]  Heikki Mannila,et al.  Ordered and Unordered Tree Inclusion , 1995, SIAM J. Comput..

[5]  Ron Shamir,et al.  Faster Subtree Isomorphism , 1999, J. Algorithms.

[6]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.

[7]  Shin-Yee Lu.  A Tree-to-Tree Distance and Its Application to Cluster Analysis , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Kaizhong Zhang,et al.  A constrained edit distance between unordered labeled trees , 1996, Algorithmica.

[9]  Stanley M. Selkow,et al.  The Tree-to-Tree Editing Problem , 1977, Inf. Process. Lett..

[10]  Gabriel Valiente.  Constrained tree inclusion , 2005, J. Discrete Algorithms.

[11]  Kaizhong Zhang,et al.  On the Editing Distance Between Undirected Acyclic Graphs , 1996, Int. J. Found. Comput. Sci..

[12]  Wuu Yang,et al.  Identifying syntactic differences between two programs , 1991, Softw. Pract. Exp..

[13]  Gabriel Valiente,et al.  An efficient bottom-up distance between trees , 2001, Proceedings Eighth Symposium on String Processing and Information Retrieval.

[14]  Robin Thomas,et al.  On the complexity of finding iso- and other morphisms for partial k-trees , 1992, Discret. Math..