Linear-time algorithm for finding a maximum-density segment of a sequence
From MaRDI portal
Publication:1007643
DOI10.1016/S0020-0190(03)00225-4zbMath1162.68809OpenAlexW2051656366MaRDI QIDQ1007643
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
Related Items (9)
Finding a maximum-density path in a tree under the weight and length constraints ⋮ Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ An improved algorithm for finding a length-constrained maximum-density subtree in a tree ⋮ Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications ⋮ Finding a length-constrained maximum-density path in a tree ⋮ Algorithms for Problems on Maximum Density Segment ⋮ On locating disjoint segments with maximum sum of densities ⋮ Fast algorithms for the density finding problem
Cites Work
This page was built for publication: Linear-time algorithm for finding a maximum-density segment of a sequence
