Sciweavers

Share
JCSS
2002

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

9 years 6 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecutive subsequence of length at most U with the maximum sum and (ii) given a sequence of real numbers of length n and a lower bound L; find a consecutive subsequence of length at least L with the maximum average. We present an O
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where JCSS
Authors Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
Comments (0)
books