Analysis of tree edit distance algorithms

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

Volumn 2676, Issue , 2003, Pages 83-95

  Dulucq, Serge ^a   Touzet, Hélène ^b  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BEHAVIORAL RESEARCH; FORESTRY; PATTERN MATCHING; TREES (MATHEMATICS);

DYNAMIC PROGRAMMING METHODS; TREE EDIT DISTANCE;

DYNAMIC PROGRAMMING;

EID: 26444617960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_7     Document Type: Article

References (4)

1. S. Chawathe, "Comparing hierarchical data in external memory" Proceedings of the Twenty-fifth International Conference on Very Large Data Bases (1999), Edinburgh, Scotland, p. 90-101.
2. P. Klein, "Computing the edit-distance between unrooted ordered trees" Proceeding of 6th European Symposium on Algorithms (1998), p. 91-102.
3. B. Shapiro and K. Zhang, "Comparing multiple RNA secondary structures using tree comparisons", Comput. Appl. Biosciences, Vol.4, 3 (1988), p. 387-393.
4. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems" SIAM Journal of Computing, Vol 18-6, (1989), p. 1245-1262.