An information-theoretic lower bound for the longest common subsequence problem
- 31 January 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (1), 40-41
- https://doi.org/10.1016/0020-0190(78)90037-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- 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