A new editing based distance between unordered labeled trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 684 LNCS, Issue , 1993, Pages 254-265

  Zhang, Kaizhong ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUZZY LOGIC; FUZZY SETS; PATTERN MATCHING;

NP COMPLETE; UNORDERED LABELED TREE; UNORDERED TREES;

FORESTRY;

EID: 85029526501     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029810     Document Type: Conference Paper

References (13)

1. G. M. Landau and U. Vishkin, ‘Fast parallel and serial approximate string matching’, J. Algorithms, vol. 10, pp.157-169, 1989
2. Pekka Kilpelainen and Heikki Mannila, ‘Ordered and unordered tree inclusion’, To appear SIAM J. on Computing
3. P. H. Sellers, ‘The theory and computation of evolutionary distances’ J. Algorithms vol. 1, pp.359-373, 1980
4. Bruce Shapiro and Kaizhong Zhang, ‘Comparing multiple RNA secondary structures using tree comparisons’ Comput. Appl. Biosci. vol. 6, no. 4, pp.309-318, 1990
5. K. C. Tai, ‘The tree-to-tree correction problem’, J. ACM, vol. 26, pp.422-433, 1979
6. Robert E. Tarjan, ‘Data structures and network algorithms’, CBMS-NSF Regional Conference Series in Applied Mathematics, 1983
7. E. Tanaka and K. Tanaka, ‘The tree-to-tree editing problem’, International Journal of Pattern Recognition and Artificial Intelligence1, vol. 2, no. 2, pp.221-240 1988
8. E. Ukkonen, ‘Finding approximate patterns in strings’, J. Algorithm, vol. 6, pp.132-137, 1985
9. Jason T.L. Wang, Kaizhong Zhang, Karpjoo Jeong and Dennis Shasha ‘ATBE: A system for approximate tree matching’, To appear IEEE Trans, on Knowledge and Data Engineering
10. Kaizhong Zhang, ‘An editing based distance between ordered labeled trees’, In preparation.
11. Kaizhong Zhang and Dennis Shasha, ‘Simple fast algorithms for the editing distance between trees and related problems’, SIAM J. Computing Vol. 18, no. 6, pp.1245-1262, 1989
12. Kaizhong Zhang, Rick Statman and Dennis Shasha, ‘On the editing distance between unordered labeled trees’ Information Processing Letters no. 42, pp.133-139, 1992
13. Kaizhong Zhang, Dennis Shasha, and Jason Wang, ‘Approximate tree matching in the presence of variable length don’t cares’, To appear J. Algorithms