A bit-string longest-common-subsequence algorithm
- 24 November 1986
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 23 (5), 305-310
- https://doi.org/10.1016/0020-0190(86)90091-8
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- General methods of sequence comparisonBulletin of Mathematical Biology, 1984
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- 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
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- On the Theory and Computation of Evolutionary DistancesSIAM Journal on Applied Mathematics, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974