Selecting the best-fit model of nucleotide substitution

被引:783
|
作者
Posada, D [1 ]
Crandall, KA [1 ]
机构
[1] Brigham Young Univ, Dept Zool, Provo, UT 84602 USA
关键词
AIC; BIC; dynamic LRT; hierarchical LRT; likelihood ratio tests; model selection; substitution models;
D O I
10.1080/106351501750435121
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Despite the relevant role of models of nucleotide substitution in phylogenetics, choosing among different models remains a problem. Several statistical methods for selecting the model that best fits the data at hand have been proposed, but their absolute and relative performance has not yet been characterized. In this study, we compare under various conditions the performance of different hierarchical and dynamic likelihood ratio tests, and of Akaike and Bayesian information methods, for selecting best-fit models of nucleotide substitution. We specifically examine the role of the topology used to estimate the likelihood of the different models and the importance of the order in which hypotheses are tested. We do this by simulating DNA sequences under a known model of nucleotide substitution and recording how often this true model is recovered by the different methods. Our results suggest that model selection is reasonably accurate and indicate that some likelihood ratio test methods perform overall better than the Akaike or Bayesian information criteria. The tree used to estimate the likelihood scores does not influence model selection unless it is a randomly chosen tree. The order in which hypotheses are tested, and the complexity of the initial model in the sequence of tests, influence model selection in some cases. Model fitting in phylogenetics has been suggested for many years, yet many authors still arbitrarily choose their models, often using the default models implemented in standard computer programs for phylogenetic estimation. We show here that a best-fit model can be readily identified. Consequently, given the relevance of models, model fitting should be routine in any phylogenetic analysis that uses models of evolution.
引用
收藏
页码:580 / 601
页数:22
相关论文
共 50 条
  • [41] DETERMINATION OF BEST-FIT RATE CONSTANTS IN CHEMICAL KINETICS
    BALL, WE
    GROENWEG.LC
    [J]. INDUSTRIAL & ENGINEERING CHEMISTRY FUNDAMENTALS, 1966, 5 (02): : 181 - &
  • [42] Towards finding the best-fit distribution for OSN data
    Bhattacharya, Subhayan
    Sinha, Sankhamita
    Roy, Sarbani
    Gupta, Amarnath
    [J]. JOURNAL OF SUPERCOMPUTING, 2020, 76 (12): : 9882 - 9900
  • [43] The fallacy in the use of the "best-fit" solution in hydrologic modeling
    Abbaspour, K. C.
    [J]. SCIENCE OF THE TOTAL ENVIRONMENT, 2022, 802
  • [44] RELATIONSHIP BETWEEN BEST-FIT COEFFICIENTS AND LEAD VECTORS
    BOURGAIN, RH
    KORNREICH, F
    BLOCK, P
    [J]. ARCHIVES INTERNATIONALES DE PHYSIOLOGIE DE BIOCHIMIE ET DE BIOPHYSIQUE, 1973, 81 (04): : 755 - 761
  • [45] Mobility of the universally best-fit engineers in the interstellar era
    Urkude, A. M.
    [J]. 5th Global Congress on Engineering Education, Congress Proceedings, 2006, : 281 - 284
  • [46] iGlasses: A Novel Recommendation System for Best-fit Glasses
    Gu, Xiaoling
    Shou, Lidan
    Peng, Pai
    Chen, Ke
    Wu, Sai
    Chen, Gang
    [J]. SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2016, : 1109 - 1112
  • [47] ProtTest: selection of best-fit models of protein evolution
    Abascal, F
    Zardoya, R
    Posada, D
    [J]. BIOINFORMATICS, 2005, 21 (09) : 2104 - 2105
  • [48] Examining the best-fit paradigm for FEM at element level
    Himanshu Mishra
    Somenath Mukherjee
    [J]. Sadhana, 2004, 29 : 573 - 588
  • [49] Detrended fluctuation analysis based on best-fit polynomial
    Zhao, Shanshan
    Jiang, Yundi
    He, Wenping
    Mei, Ying
    Xie, Xiaoqiang
    Wan, Shiquan
    [J]. FRONTIERS IN ENVIRONMENTAL SCIENCE, 2022, 10
  • [50] Embodied language, best-fit analysis, and formal compositionality
    Feldman, Jerome
    [J]. PHYSICS OF LIFE REVIEWS, 2010, 7 (04) : 385 - 410