Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

Details Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

2002-07-08

arxiv.org/abs/cs/0207026v2

Journal of Computer and System Sciences, 70(2):128-144, 2005

Computer Science

Data Structures and Algorithms

23 pages, 13 figures. A significant portion of these results appeared under the title, "Fast Algorithms for Finding Maximum-De

Scientific paper

10.1016/j.jcss.2004.08.001

We study an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (a_i,w_i) for i = 1,..,n and w_i>0, a segment A(i,j) is a consecutive subsequence of A starting with index i and ending with index j. The width of A(i,j) is w(i,j) = sum_{i <= k <= j} w_k, and the density is (sum_{i<= k <= j} a_k)/ w(i,j). The maximum-density segment problem takes A and two values L and U as input and asks for a segment of A with the largest possible density among those of width at least L and at most U. When U is unbounded, we provide a relatively simple, O(n)-time algorithm, improving upon the O(n \log L)-time algorithm by Lin, Jiang and Chao. When both L and U are specified, there are no previous nontrivial results. We solve the problem in O(n) time if w_i=1 for all i, and more generally in O(n+n\log(U-L+1)) time when w_i>=1 for all i.

Affiliated with

Also associated with

No associations

Rating

Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172489