The Minimum-Evolution Distance-Based Approach to Phylogeny Inference - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Book Sections Year : 2005

The Minimum-Evolution Distance-Based Approach to Phylogeny Inference

Abstract

Distance algorithms remain among the most popular for reconstructing phylogenies, especially for researchers faced with data sets with large num- bers of taxa. Distance algorithms are much faster in practice than character or likelihood algorithms, and least-squares algorithms produce trees that have several desirable statistical properties. The fast Neighbor Joining heuristic has proven to be quite popular with researchers, but suffers some- what from a lack of a statistical foundation. We show here that the balanced minimum evolution approach provides a robust statistical justification and is amenable to fast heuristics that provide topologies superior among the class of distance algorithms. The aim of this chapter is to present a compre- hensive survey of the minimum evolution principle, detailing its variants, algorithms, and statistical and combinatorial properties. The focus is on the balanced version of this principle, as it appears quite well suited for phylogenetic inference, from a theoretical perspective as well as through computer simulations.
Fichier principal
Vignette du fichier
DesperGascuel_MEP05.pdf (270.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00106579 , version 1 (13-05-2015)

Identifiers

  • HAL Id : lirmm-00106579 , version 1

Cite

Richard Desper, Olivier Gascuel. The Minimum-Evolution Distance-Based Approach to Phylogeny Inference. O. Gascuel. Mathematics of Evolution and Phylogeny, Oxford University Press, pp.1-32, 2005, 0-19-856610-7. ⟨lirmm-00106579⟩
236 View
637 Download

Share

Gmail Facebook X LinkedIn More