An optimal decomposition algorithm for tree edit distance

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

Volumn 4596 LNCS, Issue , 2007, Pages 146-157

  Demaine, Erik D ^a   Mozes, Shay ^a   Rossman, Benjamin ^a   Weimann, Oren ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; OPTIMAL SYSTEMS;

DECOMPOSITION ALGORITHM; DYNAMIC PROGRAM;

TREES (MATHEMATICS);

EID: 38149078101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_15     Document Type: Conference Paper

References (17)

1. Apostolico, A., Galil, Z. (eds.): Pattern matching algorithms. Oxford University Press, Oxford, UK (1997)
2. Bille, P.: A survey on tree edit distance and related problems. Theoretical computer science 337, 217-239 (2005)
3. Chawathe, S.S.: Comparing hierarchical data in external memory. In: Proceedings of the 25th International Conference on Very Large Data Bases, pp. 90-101. Edinburgh, Scotland, U.K (1999)
4. Dulucq, S., Touzet, H.: Analysis of tree edit distance algorithms. In: Baeza-Yates, R.A., Chavez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 83-95. Springer, Heidelberg (2003)
5. Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)
6. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing 13(2), 338-355 (1984)
7. Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91-102. Springer, Heidelberg (1998)
8. Klein, P.N., Tirthapura, S., Sharvit, D., Kimia, B.B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 696-704 (2000)
9. Moore, P.B.: Structural motifs in RNA. Annual review of biochemistry 68, 287-300 (1999)
10. Selkow, S.M.: The tree-to-tree editing problem. Information Processing Letters 6(6), 184-186 (1977)
11. Shasha, D., Zhang, K.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing 18(6), 1245-1262 (1989)
12. Shasha, D., Zhang, K.: Fast algorithms for the unit cost editing distance between trees. Journal of Algorithms 11(4), 581-621 (1990)
13. Tai, K.: The tree-to-tree correction problem. Journal of the Association for Computing Machinery (JACM) 26(3), 422-433 (1979)
14. Valiente, G.: Algorithms on Trees and Graphs. Springer, Heidelberg (2002)
15. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM 21(1), 168-173 (1974)
16. Waterman, M.S.: Introduction to computational biology: maps, sequences and genomes, chapters 13,14 Chapman and Hall (1995)
17. Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recognition 28(3), 463-474 (1995)