Remark on the HSUDU new algorithm for the longest common subsequence problem
- 1 June 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (4) , 235-236
- https://doi.org/10.1016/0020-0190(87)90167-0
Abstract
No abstract availableKeywords
This publication has 4 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
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977