New algorithms for the LCS problem
- 31 October 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 29 (2) , 133-152
- https://doi.org/10.1016/0022-0000(84)90025-4
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- The string merging problemBIT Numerical Mathematics, 1981
- On finding minimal length superstringsJournal of Computer and System Sciences, 1980
- A Fast Merging AlgorithmJournal of the ACM, 1979
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- A test for nucleotide sequence homologyJournal of Molecular Biology, 1973
- Common phrases and minimum-space text storageCommunications of the ACM, 1973
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- Spelling correction in systems programsCommunications of the ACM, 1970
- Computer aids to protein sequence determinationJournal of Theoretical Biology, 1965