The string merging problem
- 1 March 1981
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 21 (1) , 20-30
- https://doi.org/10.1007/bf01934067
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- 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
- An algorithm for the distance between two finite sequencesJournal of Combinatorial Theory, Series A, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- Studies in abstract families of languagesMemoirs of the American Mathematical Society, 1969