morePhyML: Improving the phylogenetic tree space exploration with PhyML 3

被引:56
作者
Criscuolo, Alexis [1 ]
机构
[1] Inst Pasteur, Unite Biol Mol Gene Chez Extremophiles, Dept Microbiol, F-75015 Paris, France
关键词
Phylogeny; Maximum Likelihood; PhyML; Tree search strategy; Local optimum; Ratchet; MAXIMUM; ALGORITHM;
D O I
10.1016/j.ympev.2011.08.029
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
PhyML is a widely used Maximum Likelihood (ML) phylogenetic tree inference software based on a standard hill-climbing method. Starting from an initial tree, the version 3 of PhyML explores the tree space by using "Nearest Neighbor Interchange" (NNI) or "Subtree Pruning and Regrafting" (SPR) tree swapping techniques in order to find the ML phylogenetic tree. NNI-based local searches are fast but can often get trapped in local optima, whereas it is expected that the larger (but slower to cover) SPR-based neighborhoods will lead to trees with higher likelihood. Here, I verify that PhyML infers more likely trees with SPRs than with NNIs in almost all cases. However, I also show that the SPR-based local search of PhyML often does not succeed at locating the ML tree. To improve the tree space exploration, I deliver a script, named morePhyML, which allows escaping from local optima by performing character reweighting. This ML tree search strategy, named ratchet, often leads to higher likelihood estimates. Based on the analysis of a large number of amino acid and nucleotide data, I show that morePhyML allows inferring more accurate phylogenetic trees than several other recently developed ML tree inference softwares in many cases. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:944 / 948
页数:5
相关论文
共 27 条
[1]  
Allen B. L., 2001, Annals of Combinatorics, V5, P1, DOI [10.1007/s00026-001-8006-8, DOI 10.1007/S00026-001-8006-8]
[2]  
[Anonymous], 1964, PHEN PHYLOGEN CLASSI
[3]  
[Anonymous], 2002, PAUP*. Phylogenetic Analysis Using Parsimony (*and other methods). Version 4
[4]  
[Anonymous], 2006, GENETIC ALGORITHM AP
[5]  
Bryant D, 2005, MATHEMATICS OF EVOLUTION AND PHYLOGENY, P33
[6]   THE NOISING METHOD - A NEW METHOD FOR COMBINATORIAL OPTIMIZATION [J].
CHARON, I ;
HUDRY, O .
OPERATIONS RESEARCH LETTERS, 1993, 14 (03) :133-137
[7]   SDM: A fast distance-based approach for (super) tree building in phylogenomics [J].
Criscuolo, Alexis ;
Berry, Vincent ;
Douzery, Emmanuel J. P. ;
Gascuel, Olivier .
SYSTEMATIC BIOLOGY, 2006, 55 (05) :740-755
[8]   EVOLUTIONARY TREES FROM DNA-SEQUENCES - A MAXIMUM-LIKELIHOOD APPROACH [J].
FELSENSTEIN, J .
JOURNAL OF MOLECULAR EVOLUTION, 1981, 17 (06) :368-376
[9]  
FELSENSTEIN J, 1985, EVOLUTION, V39, P783, DOI 10.1111/j.1558-5646.1985.tb00420.x
[10]   BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data [J].
Gascuel, O .
MOLECULAR BIOLOGY AND EVOLUTION, 1997, 14 (07) :685-695