The tree-to-tree editing problem
Author:
- Stanley M. SelkowSSStanley M. Selkow
- 1 December 1977
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 6 (6) , 184-186
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972