The longest common subsequence problem for small alphabet size between many strings
Authors:
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 469-478
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The longest common subsequence problem revisitedAlgorithmica, 1987
- Computational Geometry1985
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974