Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- 20 August 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (2) , 63-69
- https://doi.org/10.1016/0020-0190(86)90044-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Fast Merging AlgorithmJournal of the ACM, 1979
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 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