Abstract
Given a sequence, the problem studied in this paper is to find a set of k disjoint continuous subsequences such that the total sum of all elements in the set is maximized. This problem arises naturally in the analysis of DNA sequences. The previous best known algorithm requires ⊖(n log n) time in the worst case. For a given sequence of length n, we present an almost linear-time algorithm for this problem. Our algorithm uses a disjoint-set data structure and requires O(nα(n, n)) time in the worst case, where a(n, n) is the inverse Ackermann function. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bengtsson, F., & Chen, J. (2006). Computing maximum-scoring segments in almost linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 255–264). Springer Verlag. https://doi.org/10.1007/11809678_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
