A lower bound for the edit-distance problem under an arbitrary cost function
Author:
- 13 May 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 27 (6) , 319-321
Abstract
No abstract availableKeywords
This publication has 9 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
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- An information-theoretic lower bound for the longest common subsequence problemInformation Processing Letters, 1978
- 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
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- The String-to-String Correction ProblemJournal of the ACM, 1974
- On the Optimality of Some Set AlgorithmsJournal of the ACM, 1972