Efficient Maximum Likelihood Tree Building Methods - Archive ouverte HAL Access content directly
Book Sections Year : 2020

Efficient Maximum Likelihood Tree Building Methods

(1, 2) , (2)
1
2

Abstract

The number of possible unrooted binary trees (phylogenies) increases super-exponentially with the number of taxa. To find the Maximum Likelihood (ML) tree one has to enumerate and evaluate all these trees. As we will see, this is computationally not feasible. Therefore, one predominantly deploys ad hoc tree search methods that strive to find a "good" ML tree in the hope that it will be close, either with respect to the likelihood score or the topological structure, to the globally optimal ML tree. In this chapter we provide an overview over the most popular and efficient ML tree search techniques. How to cite: Alexandros Stamatakis and Alexey M.
Fichier principal
Vignette du fichier
chapter_1.2_stamatakis.pdf (416.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02535285 , version 1 (10-04-2020)
hal-02535285 , version 2 (26-11-2020)

Identifiers

  • HAL Id : hal-02535285 , version 1

Cite

Alexandros Stamatakis, Alexey M. Kozlov. Efficient Maximum Likelihood Tree Building Methods. Scornavacca, Celine; Delsuc, Frédéric; Galtier, Nicolas. Phylogenetics in the Genomic Era, No commercial publisher | Authors open access book, pp.1.2:1--1.2:18, 2020. ⟨hal-02535285v1⟩
984 View
1197 Download

Share

Gmail Facebook Twitter LinkedIn More