New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0

PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to improve a reasonable starting tree topology. Since the original publication (Guindon S., Gascuel O. 2003. A simple, fast and accurate algori...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Systematic biology Ročník 59; číslo 3; s. 307
Hlavní autoři: Guindon, Stéphane, Dufayard, Jean-François, Lefort, Vincent, Anisimova, Maria, Hordijk, Wim, Gascuel, Olivier
Médium: Journal Article
Jazyk:angličtina
Vydáno: England 01.05.2010
Témata:
ISSN:1076-836X, 1076-836X
On-line přístup:Zjistit podrobnosti o přístupu
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to improve a reasonable starting tree topology. Since the original publication (Guindon S., Gascuel O. 2003. A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52:696-704), PhyML has been widely used (>2500 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 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 and relies on a nonparametric, Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments sheds light on the links between this new approach and the more classical nonparametric 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/.
AbstractList PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to improve a reasonable starting tree topology. Since the original publication (Guindon S., Gascuel O. 2003. A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52:696-704), PhyML has been widely used (>2500 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 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 and relies on a nonparametric, Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments sheds light on the links between this new approach and the more classical nonparametric 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/.PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to improve a reasonable starting tree topology. Since the original publication (Guindon S., Gascuel O. 2003. A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52:696-704), PhyML has been widely used (>2500 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 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 and relies on a nonparametric, Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments sheds light on the links between this new approach and the more classical nonparametric 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/.
PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to improve a reasonable starting tree topology. Since the original publication (Guindon S., Gascuel O. 2003. A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52:696-704), PhyML has been widely used (>2500 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 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 and relies on a nonparametric, Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments sheds light on the links between this new approach and the more classical nonparametric 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/.
Author Lefort, Vincent
Hordijk, Wim
Gascuel, Olivier
Anisimova, Maria
Guindon, Stéphane
Dufayard, Jean-François
Author_xml – sequence: 1
  givenname: Stéphane
  surname: Guindon
  fullname: Guindon, Stéphane
  organization: Méthodes et Algorithmes pour la Bioinformatique, LIRMM, Centre National de la Recherche Scientifique, Université de Montpellier, Montpellier Cedex 5, France
– sequence: 2
  givenname: Jean-François
  surname: Dufayard
  fullname: Dufayard, Jean-François
– sequence: 3
  givenname: Vincent
  surname: Lefort
  fullname: Lefort, Vincent
– sequence: 4
  givenname: Maria
  surname: Anisimova
  fullname: Anisimova, Maria
– sequence: 5
  givenname: Wim
  surname: Hordijk
  fullname: Hordijk, Wim
– sequence: 6
  givenname: Olivier
  surname: Gascuel
  fullname: Gascuel, Olivier
BackLink https://www.ncbi.nlm.nih.gov/pubmed/20525638$$D View this record in MEDLINE/PubMed
BookMark eNpNkEtLxEAQhAdZcR969Cpz85R1eiav9SbL-oD1cVDwFiZJZzOayWTTCZp_b8AVPFXRfBRdNWeT2tXI2DmIJYiVuqKBUuNG2QsQR2wGIgq9WIXvk39-yuZEH0IAhAGcsKkUgQxCFc-YfcIvrquda01XWuK6zrnFrnQ58c5xpM5Y3SG3-tvY3nqV-cTKlM7lvCmHyu2wNkjXXBMhkal3vCuRN9gWrrW6zpC7gr-Uw-OWq6U4ZceFrgjPDrpgb7eb1_W9t32-e1jfbL1SBbLzMuVH43-xTLM0Bh8AdZBJhTnGYrwK8GWuceWnKio0KB2FRZBnSox0nIHUcsEuf3Ob1u37sURiDWVYVbpG11MSKQUhgBAjeXEg-9RinjTt2Lcdkr-F5A9Ns2xE
ContentType Journal Article
DBID CGR
CUY
CVF
ECM
EIF
NPM
7X8
DOI 10.1093/sysbio/syq010
DatabaseName Medline
MEDLINE
MEDLINE (Ovid)
MEDLINE
MEDLINE
PubMed
MEDLINE - Academic
DatabaseTitle MEDLINE
Medline Complete
MEDLINE with Full Text
PubMed
MEDLINE (Ovid)
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic
MEDLINE
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: 7X8
  name: MEDLINE - Academic
  url: https://search.proquest.com/medline
  sourceTypes: Aggregation Database
DeliveryMethod no_fulltext_linktorsrc
Discipline Zoology
Biology
Ecology
EISSN 1076-836X
ExternalDocumentID 20525638
Genre Evaluation Studies
Research Support, Non-U.S. Gov't
Journal Article
GroupedDBID ---
-~X
.-4
.2P
.I3
0R~
123
18M
1TH
29Q
2FS
36B
4.4
48X
53G
5VS
5WD
70D
7X7
88E
88I
8AF
8AO
8CJ
8FE
8FH
8FI
8FJ
8G5
AAHBH
AAHKG
AAIMJ
AAISJ
AAJKP
AAJQQ
AAKGQ
AAMDB
AAMVS
AAOGV
AAPQZ
AAPXW
AARHZ
AAUAY
AAUQX
AAVAP
AAVLN
AAWDT
ABBHK
ABDBF
ABDFA
ABEJV
ABEUO
ABGNP
ABIME
ABIXL
ABJNI
ABMNT
ABNGD
ABNKS
ABPIB
ABPLY
ABPPZ
ABPQP
ABPTD
ABQLI
ABSMQ
ABSQW
ABTLG
ABUWG
ABVGC
ABWST
ABXSQ
ABXVV
ABXZS
ABZBJ
ABZEO
ACCCW
ACFRR
ACGEJ
ACGFO
ACGFS
ACGOD
ACHIC
ACIPB
ACNCT
ACPQN
ACPRK
ACSTJ
ACUFI
ACUHS
ACUKT
ACUTJ
ACVCV
ACZBC
ADBBV
ADEYI
ADFTL
ADGKP
ADGZP
ADHKW
ADHZD
ADIPN
ADNBA
ADOCK
ADQBN
ADRTK
ADULT
ADVEK
ADXHL
ADXPE
ADYVW
ADZTZ
ADZXQ
AEGPL
AEGXH
AEJOX
AEKPW
AEKSI
AELWJ
AEMDU
AENEX
AENZO
AEPUE
AETBJ
AEUPB
AEUYN
AEWNT
AFAZZ
AFFZL
AFGWE
AFIYH
AFKRA
AFKVX
AFOFC
AFSHK
AFYAG
AGINJ
AGKEF
AGKRT
AGMDO
AGORE
AGQPQ
AGQXC
AGSYK
AGUYK
AHGBF
AHMBA
AHXOZ
AHXPO
AIAGR
AIJHB
AILXY
AJBYB
AJDVS
AJEEA
AJNCP
AJWEG
AKHUL
AKWXX
ALIPV
ALMA_UNASSIGNED_HOLDINGS
ALUQC
ALXQX
ANFBD
APIBT
APJGH
APWMN
AQDSO
AQVQM
ARIXL
ASAOO
ASPBG
ATDFG
ATGXG
ATTQO
AVWKF
AXUDD
AYOIW
AZFZN
AZQEC
BAYMD
BBNVY
BCRHZ
BENPR
BES
BEYMZ
BHONS
BHPHI
BKSAR
BPHCQ
BQDIO
BSWAC
BVXVI
C45
CAG
CBGCD
CCPQU
CDBKE
CGR
COF
CS3
CUY
CUYZI
CVF
CXTWN
CZ4
D1J
DAKXR
DEVKO
DFGAJ
DILTD
DU5
DWQXO
D~K
EAD
EAP
EAS
EBC
EBD
EBS
ECM
EE~
EHN
EIF
EJD
ELUNK
EMB
EMK
EMOBN
EPL
EPT
EST
ESX
F5P
F9B
FEDTE
FHSFR
FLUFQ
FOEOM
FQBLK
FYUFA
GAUVT
GJXCC
GNUQQ
GTFYD
GUQSH
H13
H5~
HAR
HCIFZ
HF~
HGD
HMCUK
HQ2
HTVGU
HVGLF
HW0
HZ~
I-F
IOX
IPSME
J21
JAAYA
JBMMH
JBS
JEB
JEFFH
JENOY
JHFFW
JKQEH
JLS
JLXEF
JPM
JST
JXSIZ
KAQDR
KBUDW
KOP
KSI
KSN
LK8
M-Z
M1P
M2O
M2P
M2Q
M7P
MBTAY
MVM
N9A
NEJ
NGC
NLBLG
NOMLY
NPM
NU-
NVLIB
O0~
O9-
OAWHX
OBOKY
ODMLO
OJQWA
OJZSN
OVD
OWPYF
O~Y
P2P
PADUT
PAFKI
PB-
PCBAR
PEELM
PHGZM
PHGZT
PJZUB
PPXIY
PQGLB
PQQKQ
PROAC
PSQYO
Q1.
Q5Y
QBD
Q~Q
RD5
ROX
ROZ
RUSNO
RW1
RWL
RXO
RXW
S0X
SA0
SV3
TAE
TCN
TEORI
TLC
TN5
TUS
UBC
UKHRP
WH7
WHG
X7H
XOL
XSW
YAYTL
YKOAZ
YXANX
YXE
ZCG
ZY4
~02
~91
7X8
ID FETCH-LOGICAL-h352t-c34725682bcb81411ea5c23ede806820142dae94b37fa13a76f5dc30cb88c12a2
IEDL.DBID 7X8
ISICitedReferencesCount 14977
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000276528300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1076-836X
IngestDate Sat Sep 27 22:54:54 EDT 2025
Mon Jul 21 05:40:31 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-h352t-c34725682bcb81411ea5c23ede806820142dae94b37fa13a76f5dc30cb88c12a2
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Undefined-1
ObjectType-Feature-3
content type line 23
OpenAccessLink https://academic.oup.com/sysbio/article-pdf/59/3/307/24207259/syq010.pdf
PMID 20525638
PQID 733161100
PQPubID 23479
ParticipantIDs proquest_miscellaneous_733161100
pubmed_primary_20525638
PublicationCentury 2000
PublicationDate 2010-05-01
PublicationDateYYYYMMDD 2010-05-01
PublicationDate_xml – month: 05
  year: 2010
  text: 2010-05-01
  day: 01
PublicationDecade 2010
PublicationPlace England
PublicationPlace_xml – name: England
PublicationTitle Systematic biology
PublicationTitleAlternate Syst Biol
PublicationYear 2010
SSID ssj0011651
Score 2.5924766
Snippet PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to...
SourceID proquest
pubmed
SourceType Aggregation Database
Index Database
StartPage 307
SubjectTerms Algorithms
Classification - methods
Likelihood Functions
Phylogeny
Software
Title New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0
URI https://www.ncbi.nlm.nih.gov/pubmed/20525638
https://www.proquest.com/docview/733161100
Volume 59
WOSCitedRecordID wos000276528300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELaAgsTC-1Fe8sBqiB9NHBaEUBEDrTqAVLFUtuPSiCZpSYrov-ecpHRCDCzJRUqsyHe5-y5n34fQpTbMSs1DwpQSRFitidTKEK39YUtKBTm0Kckmgm5X9vthr16bk9fLKhc-sXTUUWbcP_Jrxy3ou_5mt5MpcaRRrrhaM2isogYHJOPMPOgviwjUL9kXIcHxieR-v26xCTm82wiu4wxOU496v4PLMsg8bP_z9XbQVo0u8V1lDrtoxaZ7aKPim5yD1DYL6TUrpX2UgJvDavwGoxWjJMcqjXBFK53jIsOuCQeAWosT9RUns4SM43c7jl0zZAwagjFsCsn2DVZl9RgCIQZIiSfL_Qg4G-LeaN55wvzKO0AvD-3n-0dSczCQEUCzghguAkBFkmmjJRWUWtUyjNvISs936EGwSNlQaB4MFeUqABVHhntwtzSUKXaI1tIstccI-x6HUGiFFFQBTJQKwJuFdCzkcCkCr4nwYmoHYOOucKFSm83ywc_kNtFRpZ7BpOrFMWCOhw98yMnfD5-izUXp36NnqDGE79ueo3XzWcT5x0VpO3Ds9jrfjuvPow
linkProvider ProQuest
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=New+algorithms+and+methods+to+estimate+maximum-likelihood+phylogenies%3A+assessing+the+performance+of+PhyML+3.0&rft.jtitle=Systematic+biology&rft.au=Guindon%2C+St%C3%A9phane&rft.au=Dufayard%2C+Jean-Fran%C3%A7ois&rft.au=Lefort%2C+Vincent&rft.au=Anisimova%2C+Maria&rft.date=2010-05-01&rft.issn=1076-836X&rft.eissn=1076-836X&rft.volume=59&rft.issue=3&rft.spage=307&rft_id=info:doi/10.1093%2Fsysbio%2Fsyq010&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1076-836X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1076-836X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1076-836X&client=summon