Linear-time algorithm for finding a maximum-density segment of a sequence

DOI10.1016/S0020-0190(03)00225-4zbMATH Open1162.68809OpenAlexW2051656366MaRDI QIDQ1007643FDOQ1007643

Authors Sung Kwon Kim

Publication date 23 March 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(03)00225-4

zbMATH Keywords

algorithmsbioinformatics

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Cited in

(9)

• On locating disjoint segments with maximum sum of densities
• An improved algorithm for finding a length-constrained maximum-density subtree in a tree
• Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
• Finding a maximum-density path in a tree under the weight and length constraints
• Finding a length-constrained maximum-density path in a tree
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
• Algorithms for problems on maximum density segment
• Fast algorithms for the density finding problem

This page was built for publication: Linear-time algorithm for finding a maximum-density segment of a sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007643)