Computing maximum-scoring segments in almost linear time

TL;DR: For a given sequence of length n, this paper presents an almost linear-time algorithm that uses a disjoint-set data structure and requires O(nα(n, n) time in the worst case, where α(n) is the inverse Ackermann function.

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 α(n, n) is the inverse Ackermann function.