Computing the edit-distance between unrooted ordered trees

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

Volumn 1461 LNCS, Issue , 1998, Pages 91-102

  Klein, Philip N ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

EDIT DISTANCE; MINIMUM COST; ORDERED TREE;

TREES (MATHEMATICS);

EID: 84896693236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_8     Document Type: Conference Paper

References (12)

1. J. L. Gross and T. W. Tucker, Topological Graph Theory, Wiley, 1987.
2. M. Maes, "On a cyclic string-to-string correction problem," Information Processing Letters 35 (1990), pp. 73-78.
3. B. A. Shapiro, "An algorithm for comparing multiple RNA secondary structures," Computer Applications in the Biosciences (1988), pp. 387-393.
4. D. D. Sleator and R. E. Tarjan, "A data structure for dynamic trees," Journal of Computer and System Sciences 26 (1983), pp. 362-391.
5. K.-C. Tai, "The tree-to-tree correction problem", Journal of the Association for Computing Machinery 26 (1979), pp. 422-433.
6. Srikanta Tirthapura, personal communication, 1998.
7. R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," Journal of the Association for Computing Machinery 21, (1974), pp. 168-173.
8. J. T.-L. Wang, K. Zhang, K. Jeong, and D. Shasha, "A system for approximate tree matching," IEEE Transactions on Knowledge and Data Engineering 6 (1994), pp. 559-571. 5
9. K. Zhang, "A constrained edit distance between unordered labeled trees," Algorithmica 15 (1996), pp. 205-222.
10. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems, SIAM Journal on Computing 18 (1989), pp. 1245-1262.
11. K. Zhang and D. Shasha, "Approximate tree pattern matching," Chapter 14 of Pattern Matching Algorithms, Oxford University Press (1997)
12. K. Zhang, R. Statman and D. Shasha, "On the editing distance between unordered labeled trees," Information Processing Letters 42 (1992), pp. 133-139