Fast linear-space computations of longest common subsequences
- 6 January 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 92 (1) , 3-17
- https://doi.org/10.1016/0304-3975(92)90132-y
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The longest common subsequence problem revisitedAlgorithmica, 1987
- A linear space algorithm for the LCS problemActa Informatica, 1987
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two stringsInformation Processing Letters, 1986
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- 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
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975