Skip to Main content Skip to Navigation
Conference papers

Robustness of tree inference based on minimum evolution

Fabio Pardi 1
1 MAB - Méthodes et Algorithmes pour la Bioinformatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Minimum evolution is the guiding principle of an important class of distance-based phylogeny reconstruction methods, including neighbor-joining (NJ), which is the most cited tree inference algorithm to date. The minimum evolution principle involves searching for the tree with minimum length, where the length is estimated using various least-squares criteria. Since evolutionary distances cannot be known precisely but only estimated, it is important to investigate the robustness of phylogenetic reconstruction to imprecise estimates for these distances. The safety radius is a measure of this robustness: it consists of the maximum relative deviation that the input distances can have from the correct distances, without compromising the reconstruction of the correct tree structure. Answering some open questions, I will show the safety radius of two popular minimum evolution criteria: balanced minimum evolution (BME) and minimum evolution based on ordinary least squares (OLS+ME). Whereas BME has a radius of 1/2, which is the best achievable, OLS+ME has a radius tending to 0 as the number of taxa increases. This difference may explain the gap in reconstruction accuracy observed in practice between OLS+ME and BME (which forms the basis of popular programs such as NJ and FastME).
Document type :
Conference papers
Complete list of metadata
Contributor : Fabio Pardi <>
Submitted on : Wednesday, December 2, 2015 - 12:24:36 PM
Last modification on : Friday, January 8, 2021 - 3:06:02 PM


  • HAL Id : lirmm-01236910, version 1



Fabio Pardi. Robustness of tree inference based on minimum evolution. Doom: New Zealand Phylogenetics Meeting, Feb 2010, Mount Ruapehu, New Zealand. ⟨lirmm-01236910⟩



Record views