Performance analysis of some simple heuristics for computing longest common subsequences
Authors:
- 1 November 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 12 (4-5) , 293-311
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A two-step string-matching procedurePattern Recognition, 1991
- The longest common subsequence problem revisitedAlgorithmica, 1987
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- 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
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975