Computing a longest common subsequence for a set of strings
- 1 March 1984
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 24 (1) , 45-59
- https://doi.org/10.1007/bf01934514
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On finding minimal length superstringsJournal of Computer and System Sciences, 1980
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal 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
- An Extension of the String-to-String Correction ProblemJournal of the ACM, 1975
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Computer Analysis of Protein EvolutionScientific American, 1969
- Computer aids to protein sequence determinationJournal of Theoretical Biology, 1965