The longest common subsequence problem revisited
- 1 November 1987
- journal article
- research article
- Published by Springer Science and Business Media LLC in Algorithmica
- Vol. 2 (1-4), 315-336
- https://doi.org/10.1007/bf01840365
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two stringsInformation Processing Letters, 1986
- New algorithms for the LCS problemJournal of Computer and System Sciences, 1984
- A Fast Merging AlgorithmJournal of the ACM, 1979
- A representation for linear lists with movable fingersPublished by Association for Computing Machinery (ACM) ,1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- 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
- The String-to-String Correction ProblemJournal of the ACM, 1974