A time-efficient, linear-space local similarity algorithm
Document Type
Article
Publication Date
9-1991
Department
Department of Computer Science
Abstract
Dynamic programming algorithms to determine similar regions of two sequences are useful for analyzing biosequence data. This paper presents a time-efficient algorithm that produces k best "non-intersecting" local alignments for any chosen k. The algorithm's main strength is that it needs only O(M + N + K) space, where M and N are the lengths of the given sequences and K is the total length of the computed alignments.
Publication Title
Advances in Applied Mathematics
Recommended Citation
Huang, X.,
&
Miller, W.
(1991).
A time-efficient, linear-space local similarity algorithm.
Advances in Applied Mathematics,
12(3), 337-357.
http://doi.org/10.1016/0196-8858(91)90017-D
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/5622
