Numerical Optimization Techniques in Maximum Likelihood Tree Inference - Archive ouverte HAL Access content directly
Book Sections Year : 2019

Numerical Optimization Techniques in Maximum Likelihood Tree Inference

(1) , (2)
1
2

Abstract

In this chapter, we present recent computational and algorithmic advances for improving the inference of phylogenetic trees from the analysis of homologous genetic sequences under the maximum likelihood criterion. In particular, we detail how the use of matrix algebra at the core of Felsenstein’s pruning algorithm, combined with the architecture of modern day computer processors, leads to efficient techniques for optimizing edge lengths. We also discuss some properties of the likelihood function when considering the optimization of the parameters of mixture models that are used to describe the variation of rates-across sites .
Not file

Dates and versions

pasteur-02405302 , version 1 (11-12-2019)

Identifiers

Cite

Stéphane Guindon, Olivier Gascuel. Numerical Optimization Techniques in Maximum Likelihood Tree Inference. Tandy Warnow. Bioinformatics and Phylogenetics: Seminal Contributions of Bernard Moret, 29, Springer, pp.21-38, 2019, Computational Biology (COBO), 978-3-030-10837-3. ⟨10.1007/978-3-030-10837-3_2⟩. ⟨pasteur-02405302⟩
56 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More