Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Computing Maximum-Scoring Segments in Almost Linear Time
verfasst von : Fredrik Bengtsson, jingsen Chen
Erschienen in: Computing and Combinatorics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.