An efficient bottom-up distance between trees

A new bottom-up distance measure for labeled trees, which is based on the largest common forest of the trees and has the threefold advantage of independence ofparticular edit costs, low complexity, and coverage of ordered and unordered trees, is introduced and related in this paper with other distance measures published in the literature. Algorithms for computing the bottom-up distance in time linear in the number ofnodes are given in full detail.

[1]  Kaizhong Zhang,et al.  Comparing multiple RNA secondary structures using tree comparisons , 1990, Comput. Appl. Biosci..

[2]  Lusheng Wang,et al.  Alignment of trees: an alternative to tree edit , 1995 .

[3]  Kaizhong Zhang,et al.  Fast Algorithms for the Unit Cost Editing Distance Between Trees , 1990, J. Algorithms.

[4]  Hanan Samet,et al.  Distance Transform for Images Represented by Quadtrees , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

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

[7]  Shin-Yee Lu,et al.  Waveform Correlation by Tree Matching , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[9]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[10]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[11]  Wojciech Rytter,et al.  Text Algorithms , 1994 .

[12]  Gabriel Valiente,et al.  A graph distance metric combining maximum common subgraph and minimum common supergraph , 2001, Pattern Recognit. Lett..

[13]  M. J. Plasmeijer,et al.  Term graph rewriting: theory and practice , 1993 .

[14]  Graham A. Stephen.  String Searching Algorithms , 1994, Lecture Notes Series on Computing.

[15]  Philippe Flajolet,et al.  Analytic Variations on the Common Subexpression Problem , 1990, ICALP.

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

[17]  Heikki Mannila,et al.  Retrieval from hierarchical texts by partial patterns , 1993, SIGIR.

[18]  Tao Jiang,et al.  Alignment of Trees - An Alternative to Tree Edit , 1994, Theor. Comput. Sci..

[19]  Alon Itai,et al.  On an Algorithm of Zemlyachenko for Subtree Isomorphism , 1999, Inf. Process. Lett..

[20]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[21]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[22]  Kaizhong Zhang,et al.  Tree pattern matching , 1997, Pattern Matching Algorithms.

[23]  Kaizhong Zhang,et al.  On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

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

[25]  King-Sun Fu,et al.  A Tree System Approach for Fingerprint Pattern Recognition , 1976, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Gabriel Alejandro,et al.  Simple and efficient tree comparison , 2001 .

[27]  Eiichi Tanaka,et al.  The Tree-to-Tree Editing Problem , 1988, Int. J. Pattern Recognit. Artif. Intell..

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

[29]  Jun-ichi Aoe.  Computer Algorithms: String Pattern Matching Strategies , 1994 .

[30]  Robert E. Stobaugh.  Chemical substructure searching , 1985, J. Chem. Inf. Comput. Sci..