A time-efficient, linear-space local similarity algorithm
- 3 September 1991
- journal article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 12 (3) , 337-357
- https://doi.org/10.1016/0196-8858(91)90017-d
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- An improved algorithm for matching biological sequencesPublished by Elsevier ,2004
- A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisonsJournal of Molecular Biology, 1987
- Self-adjusting binary search treesJournal of the ACM, 1985
- Pattern recognition in genetic sequences by mismatch densityBulletin of Mathematical Biology, 1984
- Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetriesNucleic Acids Research, 1982
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975