144 related articles for article (PubMed ID: 15120384)
81. The gene-duplication problem: near-linear time algorithms for NNI-based local searches.
Bansal MS; Eulenstein O; Wehe A
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):221-31. PubMed ID: 19407347
[TBL] [Abstract][Full Text] [Related]
82. Adaptive RAxML-NG: Accelerating Phylogenetic Inference under Maximum Likelihood using Dataset Difficulty.
Togkousidis A; Kozlov OM; Haag J; Höhler D; Stamatakis A
Mol Biol Evol; 2023 Oct; 40(10):. PubMed ID: 37804116
[TBL] [Abstract][Full Text] [Related]
83. Complexity of the simplest phylogenetic estimation problem.
Yang Z
Proc Biol Sci; 2000 Jan; 267(1439):109-16. PubMed ID: 10687814
[TBL] [Abstract][Full Text] [Related]
84. Tests for two trees using likelihood methods.
Susko E
Mol Biol Evol; 2014 Apr; 31(4):1029-39. PubMed ID: 24401182
[TBL] [Abstract][Full Text] [Related]
85. ImOSM: intermittent evolution and robustness of phylogenetic methods.
Thi Nguyen MA; Gesell T; von Haeseler A
Mol Biol Evol; 2012 Feb; 29(2):663-73. PubMed ID: 21940641
[TBL] [Abstract][Full Text] [Related]
86. Quartet-based phylogenetic inference: improvements and limits.
Ranwez V; Gascuel O
Mol Biol Evol; 2001 Jun; 18(6):1103-16. PubMed ID: 11371598
[TBL] [Abstract][Full Text] [Related]
87. Tests of applicability of several substitution models for DNA sequence data.
Rzhetsky A; Nei M
Mol Biol Evol; 1995 Jan; 12(1):131-51. PubMed ID: 7877488
[TBL] [Abstract][Full Text] [Related]
88. Geodesics to characterize the phylogenetic landscape.
Khodaei M; Owen M; Beerli P
PLoS One; 2023; 18(6):e0287350. PubMed ID: 37352194
[TBL] [Abstract][Full Text] [Related]
89. On the maximum likelihood method for estimating molecular trees: uniqueness of the likelihood point.
Fukami K; Tateno Y
J Mol Evol; 1989 May; 28(5):460-4. PubMed ID: 2501507
[TBL] [Abstract][Full Text] [Related]
90. A linear-time algorithm for Gaussian and non-Gaussian trait evolution models.
Ho Ls; Ané C
Syst Biol; 2014 May; 63(3):397-408. PubMed ID: 24500037
[TBL] [Abstract][Full Text] [Related]
91. Building phylogenetic trees from molecular data with MEGA.
Hall BG
Mol Biol Evol; 2013 May; 30(5):1229-35. PubMed ID: 23486614
[TBL] [Abstract][Full Text] [Related]
92. Felsenstein Phylogenetic Likelihood.
Posada D; Crandall KA
J Mol Evol; 2021 Apr; 89(3):134-145. PubMed ID: 33438113
[TBL] [Abstract][Full Text] [Related]
93. Parsimony accelerated maximum likelihood searches.
Sundberg K; O'Connor T; Carroll H; Clement M; Snell Q
Int J Comput Biol Drug Des; 2008; 1(1):74-87. PubMed ID: 20055002
[TBL] [Abstract][Full Text] [Related]
94. Does the choice of nucleotide substitution models matter topologically?
Hoff M; Orf S; Riehm B; Darriba D; Stamatakis A
BMC Bioinformatics; 2016 Mar; 17():143. PubMed ID: 27009141
[TBL] [Abstract][Full Text] [Related]
95. Comparison of methods for estimating the nucleotide substitution matrix.
Oscamou M; McDonald D; Yap VB; Huttley GA; Lladser ME; Knight R
BMC Bioinformatics; 2008 Dec; 9():511. PubMed ID: 19046431
[TBL] [Abstract][Full Text] [Related]
96. Statistical data analysis in the computer age.
Efron B; Tibshirani R
Science; 1991 Jul; 253(5018):390-5. PubMed ID: 17746394
[TBL] [Abstract][Full Text] [Related]
97. A new approach for estimating the efficiencies of the nucleotide substitution models.
Som A
Theory Biosci; 2007 Apr; 125(2):133-45. PubMed ID: 17412292
[TBL] [Abstract][Full Text] [Related]
98. Estimation of evolutionary distances between nucleotide sequences.
Zharkikh A
J Mol Evol; 1994 Sep; 39(3):315-29. PubMed ID: 7932793
[TBL] [Abstract][Full Text] [Related]
99. Dynamic programming procedure for searching optimal models to estimate substitution rates based on the maximum-likelihood method.
Zhang C; Wang J; Xie W; Zhou G; Long M; Zhang Q
Proc Natl Acad Sci U S A; 2011 May; 108(19):7860-5. PubMed ID: 21521791
[TBL] [Abstract][Full Text] [Related]
100. Relative Model Fit Does Not Predict Topological Accuracy in Single-Gene Protein Phylogenetics.
Spielman SJ
Mol Biol Evol; 2020 Jul; 37(7):2110-2123. PubMed ID: 32191313
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]