0 avis
New Algorithms and Methods to Estimate Maximum-Likelihood Phylogenies: Assessing the Performance of PhyML 3.0
Archive ouverte
Edité par CCSD ; Oxford University Press (OUP) -
Supplementary Material: http://www.lirmm.fr/mab/phyml_benchmarks/. International audience. PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing Nearest Neighbor Interchanges (NNIs) to improve a reasonable starting tree topology. Since the original publication (Guindon and Gascuel, 2003), PhyML has been widely used (>2,300 citations in ISI Web of Science), because of its simplicity and a fair compromise between accuracy and speed. In the meantime research around PhyML has continued, and this article describes the new algorithms and methods implemented in the program. First, we introduce a new algorithm to search the tree space with user-defined intensity, using Subtree Pruning and Regrafting (SPR) topological moves. The parsimony criterion is used here to filter out the least promising topology modifications with respect to the likelihood function. The analysis of a large collection of real nucleotide and amino-acid data sets of various sizes demonstrates the good performance of this method. Second, we describe a new test to assess the support of the data for internal branches of a phylogeny. This approach extends the recently proposed approximate likelihood-ratio test (aLRT) and relies on a non-parametric, Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments sheds light on the links between this new approach and the more classical non-parametric bootstrap method. Overall, our tests show that the last version (3.0) of PhyML is fast, accurate, stable and ready to use. A web server and binary files are available from http://www.atgc-montpellier.fr/phyml/
Consulter en ligne
Suggestions
Du même auteur
