A fast algorithm for the longest-common-subsequence problem
- 29 February 1980
- journal article
- Published by Elsevier in Information Sciences
- Vol. 20 (1) , 69-82
- https://doi.org/10.1016/0020-0255(80)90025-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- 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 algorithm for the distance between two finite sequencesJournal of Combinatorial Theory, Series A, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Spelling correction in systems programsCommunications of the ACM, 1970