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

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications

Journal of Computer and System Sciences

Finding a maximum-density path in a tree under the weight and length constraints

Information Processing Letters

Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence

Theoretical Computer Science

An improved algorithm for finding a length-constrained maximum-density subtree in a tree

Information Processing Letters

Optimal Randomized Algorithm for the Density Selection Problem

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Algorithms for computing the length-constrained max-score segments with applications to DNA copy number data analysis

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

The weight-constrained maximum-density subtree problem and related problems in trees

The Journal of Supercomputing

Finding a weight-constrained maximum-density subtree in a tree

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Disjoint segments with maximum density

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

On locating disjoint segments with maximum sum of densities

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Note: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics

Discrete Optimization