Experimenting an approximation algorithm for the LCS
- 1 June 2001
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 110 (1) , 13-24
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the Approximation of Shortest Common Supersequences and Longest Common SubsequencesSIAM Journal on Computing, 1995
- The longest common subsequence problem for small alphabet size between many strings1992
- New algorithms for the LCS problemJournal of Computer and System Sciences, 1984
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975