The Tree-to-Tree Correction Problem
- 1 July 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (3), 422-433
- https://doi.org/10.1145/322139.322143
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The tree-to-tree editing problemInformation Processing Letters, 1977
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- An Extension of the String-to-String Correction ProblemJournal of the ACM, 1975
- On the complexity of the Extended String-to-String Correction ProblemPublished by Association for Computing Machinery (ACM) ,1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972