UPGMA and the normalized equidistant minimum evolution problem

DOI10.1016/j.tcs.2018.01.022zbMath1486.62188arXiv1704.00497OpenAlexW2605313896MaRDI QIDQ1704587

Andreas Spillner, Taoyang Wu, Vincent L. Moulton

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.00497

zbMATH Keywords

hierarchical clusteringUPGMAbalanced minimum evolutionminimum evolution

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40) Problems related to evolution (92D15)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the balanced minimum evolution problem
• Robustness of phylogenetic inference based on minimum evolution
• Computational complexity of inferring phylogenies from dissimilarity matrices
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Performance analysis of hierarchical clustering algorithms
• Cyclic permutations and evolutionary trees
• A robust model for finding optimal evolutionary tree
• Polyhedral combinatorics of UPGMA cones
• Consistent formulas for estimating the total lengths of trees
• $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
• The minimum evolution problem: Overview and classification
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: UPGMA and the normalized equidistant minimum evolution problem