Fast algorithms for the unit cost editing distance between trees

Journal of Algorithms

Volumn 11, Issue 4, 1990, Pages 581-621

  Shasha, Dennis ^a   Zhang, Kaizhong ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001495763     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(90)90011-3     Document Type: Article

References (24)

1. Parallel construction of a suffix tree with applications
2. RNase III stimulates the translations of the cIII gene of bacteriophage lambda
3. Lysis gene on bacteriophage MS2 is activated by translation termination at the overlapping coat gene
4. Efficient and elegant subword tree construction
5. Generalized structures of 5s ribonsomal RNA's
6. S4-alpha mRNA translation regulation complex
7. Optimal parallel algorithms for string matching
8. Improved string matching with k mismatches
9. Time-space-optimal string matching
10. Fast algorithms for finding nearest common ancestors
11. A tree-to-tree distance and its application to cluster analysis
12. Introducing efficient parallelism into approximate string matching
13. Three dimensional structure of a transfer RNA in two crystal forms
14. The tree-to-tree correction problem
15. An efficient parallel biconnectivity algorithm
16. On approximate string matching
17. Simple fast algorithms for the editing distance between trees and related problems
18. The Editing Distance between Trees: Algorithms and Applications