Tree edit distance with gaps

Information Processing Letters

Volumn 85, Issue 3, 2003, Pages 123-129

  Touzet, Hélène ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

Algorithms; Computational biology; Computational complexity; Tree edit distance

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

COMPUTATIONAL BIOLOGY;

TREES (MATHEMATICS);

EID: 0037435789     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00369-1     Document Type: Article

References (8)

1. Chawathe S. Comparing hierarchical data in external memory. Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland. 1999;90-101.
2. Galil Z., Giancarlo R. Speeding up dynamic programming with applications to molecular biology. Theoret. Comput. Sci. 64:1989;107-118.
3. Garey M., Johnson D. Computers and Intractability. 1979;Freeman, San Francisco, CA.
4. Klein P. Computing the edit-distance between unrooted ordered trees. Proceedings of 6th European Symposium on Algorithms. 1998;91-102.
5. Maes M. On a cyclic string-to-string correction problem. Inform. Process. Lett. 35:1990;73-78.
6. Shapiro B., Zhang K. Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci. 4:(3):1988;387-393.
7. Zhang K., Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18:(6):1989;1245-1262.
8. Zhang K., Statman R., Shasha D. On the editing distance between unordered labeled trees. Inform. Process. Lett. 42:1992;133-139.