Finding a length-constrained maximum-density path in a tree

DOI10.1007/s10878-005-6853-7zbMath1062.05136OpenAlexW2105089535MaRDI QIDQ1781798

Kun-Mao Chao, Wen-Hsiung Kuo, Rung-Ren Lin

Publication date: 8 June 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-6853-7

zbMATH Keywords

treealgorithmnetwork designcomputational biology

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Physiological, cellular and medical topics (92Cxx)

Related Items (5)

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 ⋮ Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths ⋮ An improved algorithm for finding a length-constrained maximum-density subtree in a tree ⋮ An optimal algorithm for the maximum-density path in a tree

Uses Software

• MAVG

Cites Work

• An efficient algorithm for the length-constrained heaviest path problem on a tree
• Linear-time algorithm for finding a maximum-density segment of a sequence
• On computing all suboptimal alignments
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• Unnamed Item

This page was built for publication: Finding a length-constrained maximum-density path in a tree