A linear time algorithm for finding all maximal scoring subsequences.
Given a sequence of real numbers ("scores"), we present a practical linear time algorithm to find those nonoverlapping, contiguous subsequences having greatest total scores. This improves on the best previously known algorithm, which requires quadratic time in the worst case. The problem arises in biological sequence analysis, where the high-scoring subsequences correspond to regions of unusual composition in a nucleic acid or protein sequence. For instance, Altschul, Karlin, and others have used this approach to identify transmembrane regions, DNA binding domains, and regions of high charge in proteins.
Ruzzo
W L
WL
Department of Computer Science and Engineering, University of Washington, Seattle 98195-2350, USA. ruzzo@cs.washington.edu
Tompa
M
M
D000465:Algorithms; D015233:Models, Statistical; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software; D013997:Time Factors