A linear tree edit distance algorithm for similar ordered trees

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 334-345

  Touzet, Hélène ^a  

^a UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS; TREES (MATHEMATICS);

LINEAR ALGORITHMS; OPTIMAL MAPPING; PRUNING; ZHANG-SHASHA ALGORITHM;

ALGORITHMS;

EID: 26444552144     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_29     Document Type: Conference Paper

References (12)

1. S. Chawathe. Comparing hierarchical data in external memory. In Twenty-fifth International Conference on Very Large Data Bases, pages 90-101, 1999.
2. S. Dulucq and L. Tichit. RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm. Theoretical Computer Science, 306(1-3):471-484, 2003.
3. S. Dulucq and H. Touzet. Analysis of tree edit distance algorithms. In Combinatorial Pattern Matching, volume 2676, pages 83-95. Lecture Notes in Computer Science, 2003.
4. M. Höchsmann, T. Töller, R. Giegerich, and S. Kurtz. Local similarity in RNA secondary structures. In IEEE Bioinformatics Conference, pages 159-168, 2003.
5. J. Jansson, N. Trung Hieu, and W.-K. Sung. Local gapped subforest alignment and its application in finding RNA structural motifs. In ISAAC, volume 3341, pages 569-580. Lecture Notes in Computer Science, 2004.
6. J. Jansson and A. Lingas. A fast algorithm for optimal alignment between similar ordered trees. Fundamenta Informaticae, 56(1,2): 105 - 120, 2003.
7. T. Jiang, L. Wang, and K. Zhang. Alignment of trees - an alternative to tree edit. Theoretical Computer Science, 143(1):137-148, 1995.
8. P. Klein. Computing the edit-distance between unrooted ordered trees. In 6th European Symposium on Algorithms, pages 91-102, 1998.
9. J. Setubal and J. Meidanis. Introduction to computational biology, chapter Sequence Comparison and Database Search. International Thomson Publishing Company, 1997.
10. K.C. Tai. The tree-to-tree correction problem. Journal of the Association for Comput. Machi., 26:422-433, 1979.
11. G. Valiente. Algorithms on Trees and Graphs. Springer, 2002.
12. K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18(6):1245-1262, 1989.