Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices

DOI10.1023/A:1009885610075zbMath0957.90085OpenAlexW1544225532MaRDI QIDQ1306399

Kun-Mao Chao, Chuan Yi Tang, Bang Ye Wu

Publication date: 21 November 1999

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

Full work available at URL: https://doi.org/10.1023/a:1009885610075

zbMATH Keywords

branch-and-boundcomputational biologyapproximation algorithmsultrametric trees

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)

Related Items (4)

Tree edge decomposition with an application to minimum ultrametric tree approximation ⋮ Minimum spanning paths and Hausdorff distance in finite ultrametric spaces ⋮ The minimum evolution problem: Overview and classification ⋮ Scatter search with path relinking for phylogenetic inference

This page was built for publication: Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices