Robustness of phylogenetic inference based on minimum evolution
From MaRDI portal
Publication:611949
DOI10.1007/S11538-010-9510-YzbMath1202.92064OpenAlexW2095994482WikidataQ51699398 ScholiaQ51699398MaRDI QIDQ611949
Fabio Pardi, Olivier Gascuel, Sylvain Guillemot
Publication date: 15 December 2010
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00511779
Applications of statistics to biology and medical sciences; meta analysis (62P10) Problems related to evolution (92D15)
Related Items (4)
A `stochastic safety radius' for distance-based tree reconstruction ⋮ A tutorial on the balanced minimum evolution problem ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ UPGMA and the normalized equidistant minimum evolution problem
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum evolution using ordinary least-squares is less robust than neighbor-joining
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Performance analysis of hierarchical clustering algorithms
- Cyclic permutations and evolutionary trees
- Consistent formulas for estimating the total lengths of trees
- Combinatorics of least-squares trees
This page was built for publication: Robustness of phylogenetic inference based on minimum evolution