A Fast Algorithm for Optimal Alignment between Similar Ordered Trees

Fundamenta Informaticae

Volumn 56, Issue 1-2, 2003, Pages 105-120

  Jansson, Jesper ^a   Lingas, Andrzej ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

ORDERED TREES;

TREES (MATHEMATICS);

EID: 0141493759     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. st Annual Symposium on Foundations of Computer Science (FOCS 2000), 2000.
2. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
3. th Annual Symposium on Combinatorial Pattern Matching (CPM 2001), 2001.
4. th Annual Symposium on Combinatorial Pattern Matching (CPM'94), pages 75-86, 1994.
5. th Annual Symposium on Combinatorial Pattern Matching (CPM'94), pages 75-86, 1994.
6. th Annual Symposium on Foundations of Computer Science (FOCS '94), 1994.
7. Le, S.-Y., Nussinov, R., Maizel, J.: Tree graphs of RNA secondary structures and their comparisons, Computers and Biomedical Research, 22, 1989, 461-473.
8. Pevzner, P.: Computational Molecular Biology: An Algorithmic Approach, The MIT Press, Massachusetts, 2000.
9. Preparata, F., Shamos, M.: Computational Geometry, Springer-Verlag, New York, 1985.
10. Setubal, J., Meidanis, J.: Introduction to Computational Molecular Biology, PWS Publishing Company, Boston, 1997.
11. Shapiro, B.: An algorithm for comparing multiple RNA secondary structures, Computer Applications in the Biosciences, 4, 1988, 387-393.
12. Tai, K.-C.: The tree-to-tree correction problem, Journal of the ACM, 26(3), 1979, 422-433.
13. Tarjan, R., Vishkin, U.: An efficient parallel biconnectivity algorithm, SIAM Journal on Computing, 14(4), 1985, 862-874.
14. Waterman, M.: Introduction to Computational Biology: Maps, Sequences, and Genomes, Chapman & Hall, London, 1995.
15. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems, SIAM Journal on Computing, 18(6), 1989, 1245-1262.