An efficient exact algorithm for the minimum ultrametric tree problem

DOI10.1007/978-3-540-30551-4_26MaRDI QIDQ5712119zbMATH OpenOpenAlexFDO

Authors Hsin-Fu Chen, Maw-Shang Chang

Publication date 22 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104582

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• On the informational asymmetry between upper and lower bounds for ultrametric evolutionary trees
• Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
• A robust model for finding optimal evolutionary tree

Cited in

(6)

• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• An exact solution framework for the minimum cost dominating tree problem
• Minimum spanning paths and Hausdorff distance in finite ultrametric spaces
• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• On the informational asymmetry between upper and lower bounds for ultrametric evolutionary trees
• The minimum evolution problem: Overview and classification

This page was built for publication: An efficient exact algorithm for the minimum ultrametric tree problem

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