Evolutionary trees from DNA sequences: A maximum likelihood approach.
The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
The application of maximum likelihood techniques to the estimation of evolutionary trees from nucleic acid sequence data is discussed. A computationally feasible method for finding such maximum likelihood estimates is developed, and a computer program is available. This method has advantages over the traditional parsimony algorithms, which can give misleading results if rates of evolution differ in different lineages. It also allows the testing of hypotheses about the constancy of evolutionary rates by likelihood ratio tests, and gives rough indication of the error of ;the estimate of the tree.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Under such an assumption, it is possible to infer phylogenies (e.g., [ 9, 10]), but not to estimate molecular rates or divergence times, because the individual contributions of rate and time to molecular evolution cannot be separated.”
From Relaxed Phylogenetics and Dating with Confidence (2006) · cites this paper as [10]
In the citing paper
“A large proportion (76%) of the yeast alignments were significantly non-clocklike (as measured by a likelihood ratio test [ 10] on the true tree topology)”
From Relaxed Phylogenetics and Dating with Confidence (2006) · cites this paper as [10]
In the citing paper
“Second, although this is true for any phylogenetic analysis, misalignments as well as varying evolutionary rates and compositional biases between distinct lineages can adversely impact the recovered phylogenetic tree and result in incorrect topologies (Felsenstein 1981;Gribaldo and Philippe 2002;Heaps et al. 2014).”
From The Emergence of Life (2019) · cites this paper as Felsenstein 1981
In the citing paper
“We have previously shown (Kosakovsky Pond et al. 2011) that this sum can be computed efficiently using Felsenstein's pruning algorithm (Felsenstein 1981) with the transition probability matrix operating on branch b (with branch length t b ) given by a weighted sum of the three transition probability matrices:”
From RELAX: Detecting Relaxed Selection in a Phylogenetic Framework (2015) · cites this paper as Felsenstein 1981
In the citing paper
“It is now generally accepted that statistical methods, such as maximum likelihood (ML) (Felsenstein 1981), produce more reliable results than distance and parsimony methods (Yang and Rannala 2012; Whelan and Morrison 2017).”
From Evaluating fast maximum likelihood-based phylogenetic programs using empirical phylogenomic data sets (2018) · cites this paper as Felsenstein 1981
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Fitch, W. M., & Margoliash, E. (1967) · Science · doi:10.1126/science.155.3760.279 · Cited by 3,610
Buckingham, R. A. (1966) · Cited by 2,899
Cases in which Parsimony or Compatibility Methods will be Positively Misleading
Felsenstein, J. (1978) · Systematic Biology · doi:10.1093/sysbio/27.4.401 · Cited by 2,896
Self-citationCases in which parsimony or compatibility methods will be positively misleading.
Felsenstein, J. (1978) · Systematic Zoology · doi:10.2307/2412923 · Cited by 2,230
Self-citationBjörck, Å., Dahlquist, G. G., & Anderson, N. (1974) · Cited by 1,719
A General Model for the Genetic Analysis of Pedigree Data
Elston, R. C., & Stewart, J. (1971) · Human Heredity · doi:10.1159/000152448 · Cited by 1,566
A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY
Camin, J. H., & Sokal, R. R. (1965) · Evolution · doi:10.1111/j.1558-5646.1965.tb01722.x · Cited by 808
Felsenstein, J. (1973) · Systematic Biology · doi:10.1093/sysbio/22.3.240 · Cited by 627
Self-citationThe Number of Evolutionary Trees
Felsenstein, J. (1978) · Systematic Zoology · doi:10.2307/2412810 · Cited by 540
Self-citation
Research works printed but not linked: 1
- Edwards A W F (1963) Heredity 18:553
Cited by
Tamura, K., Peterson, D., Peterson, N., Stecher, G., Nei, M., & Kumar, S. (2011) · Molecular Biology and Evolution · doi:10.1093/molbev/msr121 · Cited by 39,969
“MEGA5 now provides the ML method to infer evolutionary trees and conduct the bootstrap test for nucleotide and amino acid alignments (Felsenstein 1981, 1985).”
MethodIQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Nguyen, L.-T., Schmidt, H. A., von Haeseler, A., & Minh, B. Q. (2015) · Molecular Biology and Evolution · doi:10.1093/molbev/msu300 · Cited by 26,046
“Phylogenetic inference by maximum likelihood (ML) is widely used in molecular systematics (Felsenstein 1981, 2004).”
MethodIQ-TREE 2: New Models and Efficient Methods for Phylogenetic Inference in the Genomic Era
Minh, B. Q., Schmidt, H. A., Chernomor, O., Schrempf, D., Woodhams, M. D., von Haeseler, A., & Lanfear, R. (2020) · Molecular Biology and Evolution · doi:10.1093/molbev/msaa015 · Cited by 16,873
“Because the aforementioned substitution models assume time reversibility, IQ-TREE 1 only enabled inference of unrooted trees (Felsenstein 1981).”
BackgroundA Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
Guindon, S., & Gascuel, O. (2003) · Systematic Biology · doi:10.1080/10635150390235520 · Cited by 16,806
PAML 4: Phylogenetic Analysis by Maximum Likelihood
Yang, Z. (2007) · Molecular Biology and Evolution · doi:10.1093/molbev/msm088 · Cited by 13,879
FastTree 2 – Approximately Maximum-Likelihood Trees for Large Alignments
Price, M. N., Dehal, P. S., & Arkin, A. P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0009490 · Cited by 14,894
“(FastTree stores the tree with a trifurcation at the root, but the placement of the root is not biologically meaningful and does not affect the likelihood [5].”
BackgroundInfluentialUFBoot2: Improving the Ultrafast Bootstrap Approximation
Hoang, D. T., Chernomor, O., von Haeseler, A., Minh, B. Q., & Vinh, L. S. (2018) · Molecular Biology and Evolution · doi:10.1093/molbev/msx281 · Cited by 10,881
“The pruning algorithm (Felsenstein 1981) efficiently computes the likelihood of phylogenetic trees, but still does not scale well for large data sets.”
MethodjModelTest: Phylogenetic Model Averaging
Posada, D. (2008) · Molecular Biology and Evolution · doi:10.1093/molbev/msn083 · Cited by 10,499
“The same number of branch lengths ( k ) needs to be estimated for every model. a JC (Jukes and Cantor 1969), F81 (Felsenstein 1981), K80 (Kimura 1980), HKY (Hasegawa et al. 1985), TrN (Tamura and Nei 1993), TPM (‘‘3-parameter model,’’ 5 K81) (Kimura 1981), TIM (‘‘transitional model’’) (Posada 2003), TVM (‘‘transversio…”
BackgroundPhylogenies and the Comparative Method
Felsenstein, J. (1985) · The American Naturalist · doi:10.1086/284325 · Cited by 9,793
Self-citationDating of the human–ape splitting by a molecular clock of mitochondrial DNA.
Hasegawa, M., Kishino, H., & Yano, T.-A. (1985) · Journal of Molecular Evolution · doi:10.1007/bf02101694 · Cited by 8,687
A Rapid Bootstrap Algorithm for the RAxML Web Servers
Stamatakis, A., Hoover, P., & Rougemont, J. (2008) · Systematic Biology · doi:10.1080/10635150802429642 · Cited by 7,028
“In addition to the algorithmic problem, ML-based inference of phylogenies (Felsenstein, 1981) is memory and floating point intensive.”
Relaxed Phylogenetics and Dating with Confidence
Drummond, A. J., Ho, S. Y. W., Phillips, M. J., & Rambaut, A. (2006) · PLoS Biology · doi:10.1371/journal.pbio.0040088 · Cited by 6,463
“The term PrfDjg,U,Xg is the standard Felsenstein likelihood, where g is a tree with branch length measured in units of time.”
BackgroundMethodInfluentialBEAST 2: a software platform for Bayesian evolutionary analysis
Bouckaert, R., Heled, J., Kühnert, D., Vaughan, T., Wu, C.-H., Xie, D., Suchard, M. A., Rambaut, A., & Drummond, A. J. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003537 · Cited by 6,527
Kim, O.-S., Cho, Y.-J., Lee, K., Yoon, S.-H., Kim, M., Na, H., Park, S.-C., Jeon, Y. S., Lee, J.-H., Yi, H., et al. (2012) · International Journal of Systematic and Evolutionary Microbiology · doi:10.1099/ijs.0.038075-0 · Cited by 5,240
“, 2007) and using the maximum-likelihood method (Felsenstein, 1981) in the RAxML program (Stamatakis, 2006).”
MethodUltrafast Approximation for Phylogenetic Bootstrap
Minh, B. Q., Nguyen, M. A. T., & von Haeseler, A. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst024 · Cited by 4,844
“For every replicate, one applies a method of interest such as maximum likelihood (ML; Felsenstein 1981) to reconstruct a bootstrap tree.”
MethodMultiple Comparisons of Log-Likelihoods with Applications to Phylogenetic Inference
Shimodaira, H., & Hasegawa, M. (1999) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a026201 · Cited by 4,237
Posada, D., & Buckley, T. R. (2004) · Systematic Biology · doi:10.1080/10635150490522304 · Cited by 3,927
An Improved General Amino Acid Replacement Matrix
Le, S. Q., & Gascuel, O. (2008) · Molecular Biology and Evolution · doi:10.1093/molbev/msn067 · Cited by 3,127
“L ð T ; Q ; D i Þ is computed by applying equation (3) to each tree branch ( t is the branch length) and using the pruning algorithm (Felsenstein 1981).”
MethodKishino, H., & Hasegawa, M. (1989) · Journal of Molecular Evolution · doi:10.1007/bf02100115 · Cited by 3,373
PHYLIP ( PHYLogeny Inference Package)
Cummings, M. P. (2004) · Dictionary of Bioinformatics and Computational Biology · doi:10.1002/9780471650126.dob0534.pub2 · Cited by 3,127
Zwickl, D. J. (2006) · Texas ScholarWorks (Texas Digital Library) · Cited by 3,530
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Yang, Z. (1994) · Journal of Molecular Evolution · doi:10.1007/bf00160154 · Cited by 2,960
“lihood analysis by Yang (1993), a direct extension of the method of Felsenstein (1981) , which assumes a single rate for all the sites.”
BackgroundMethodInfluentialA likelihood approach to estimating phylogeny from discrete morphological character data
Lewis, P. O. (2001) · Systematic Biology · doi:10.1080/106351501753462876 · Cited by 2,929
An approximately unbiased test of phylogenetic tree selection
Shimodaira, H. (2002) · Systematic Biology · doi:10.1080/10635150290069913 · Cited by 2,791
A Completely Reimplemented MPI Bioinformatics Toolkit with a New HHpred Server at its Core
Zimmermann, L., Stephens, A., Nam, S.-Z., Rau, D., Kübler, J., Lozajic, M., Gabler, F., Söding, J., Lupas, A. N., & Alva, V. (2018) · Journal of Molecular Biology · doi:10.1016/j.jmb.2017.12.007 · Cited by 2,522
HyPhy: hypothesis testing using phylogenies
Pond, S. L. K., Frost, S. D. W., & Muse, S. V. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti079 · Cited by 2,866
“The fundamental component of likelihood analyses of molecular evolutionary data is to fit a given phylogenetic tree with a specified model of evolution to an alignment and obtain maximum likelihood estimates (MLE) of all independent model parameters, which commonly include branch length parameters and character substi…”
InfluentialTREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing
Schmidt, H. A., Strimmer, K., Vingron, M., & von Haeseler, A. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.3.502 · Cited by 2,532
Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies
Strimmer, K., & von Haeseler, A. (1996) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025664 · Cited by 2,531
GEIGER: investigating evolutionary radiations
Harmon, L. J., Weir, J. T., Brock, C. D., Glor, R. E., & Challenger, W. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btm538 · Cited by 2,470
Bayesian inference of species trees from multilocus data
Heled, J., & Drummond, A. J. (2010) · Molecular Biology and Evolution · doi:10.1093/molbev/msp274 · Cited by 2,453
“The term P (di |gi ) is the “Felsenstein” likelihood of the i th sequence alignment given a gene tree (Felsenstein 1981), P (gi |S ) is the multispecies coalescent, and P (S ) is a prior distribution on the space of species trees.”
BackgroundRee, R. H., & Smith, S. A. (2008) · Systematic Biology · doi:10.1080/10635150701883881 · Cited by 2,317
“The likelihood function for a phylogenetic tree with observed character data at its leaves requires calculating P(t) for each branch and integrates over the conditional likelihoods of all ancestral states at every internal node, weighted by their prior probabilities (see Felsenstein, 1981, for a recursive algorithm).”
MethodNot So Different After All: A Comparison of Methods for Detecting Amino Acid Sites Under Selection
Kosakovsky Pond, S. L., & Frost, S. D. W. (2005) · Molecular Biology and Evolution · doi:10.1093/molbev/msi105 · Cited by 2,324
Codon-substitution models for heterogeneous selection pressure at amino acid sites
Yang, Z., Nielsen, R., Goldman, N., & Pedersen, A.-M. K. (2000) · Genetics · doi:10.1093/genetics/155.1.431 · Cited by 2,286
Clarridge, J. E. (2004) · Clinical Microbiology Reviews · doi:10.1128/cmr.17.4.840-862.2004 · Cited by 2,148
Chun, J., Lee, J.-H., Jung, Y., Kim, M., Kim, S., Kim, B. K., & Lim, Y.-W. (2007) · International Journal of Systematic and Evolutionary Microbiology · doi:10.1099/ijs.0.64915-0 · Cited by 2,105
“The resultant sequence alignment can then be used for the neighbour-joining (Saitou & Nei, 1987), maximum-parsimony (Fitch, 1971), and maximum-likelihood (Felsenstein, 1981) methods using the PHYLIP package (Felsenstein, 2005); all were implemented within the server.”
MethodCONSEL: for assessing the confidence of phylogenetic tree selection
Shimodaira, H., & Hasegawa, M. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.12.1246 · Cited by 2,041
Phylogenetics of Seed Plants: An Analysis of Nucleotide Sequences from the Plastid Gene rbcL
Chase, M. W., Soltis, D. E., Olmstead, R. G., Morgan, D., Les, D. H., Mishler, B. D., Duvall, M. R., Price, R. A., Hills, H. G., Qiu, Y.-L., et al. (1993) · Annals of the Missouri Botanical Garden · doi:10.2307/2399846 · Cited by 2,032
The RDP (Ribosomal Database Project)
Maidak, B. L., Olsen, G. J., Larsen, N., Overbeek, R., McCaughey, M. J., & Woese, C. R. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.1.109 · Cited by 2,017
PHYLIP (Phylogeny Inference Package)
Cummings, M. P. (2004) · Dictionary of Bioinformatics and Computational Biology · doi:10.1002/0471650129.dob0534 · Cited by 1,967
A codon-based model of nucleotide substitution for protein-coding DNA sequences.
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040153 · Cited by 1,960
Statistical tests of selective neutrality in the age of genomics
Nielsen, R. (2001) · Heredity · doi:10.1046/j.1365-2540.2001.00895.x · Cited by 1,908
(1994) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.1994.0006 · Cited by 1,859
Efficient Control of Population Structure in Model Organism Association Mapping
Kang, H. M., Zaitlen, N. A., Wade, C. M., Kirby, A., Heckerman, D., Daly, M. J., & Eskin, E. (2008) · Genetics · doi:10.1534/genetics.107.080101 · Cited by 1,835
“Although multiple fluc-tuating selection may lead to a Brownian motion model (F elsenstein 1981), here we assume a neutral model where phenotypic changes are explained by accumulated random pleiotropic effects by the genetic background to mathematically model Brownian phenotypic changes.”
BackgroundGraphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2008) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000001 · Cited by 1,820
“subsumes the classical recursive algorithms, including the pruning and peeling algorithms from computational genetics [76], the forwardbackward algorithms for hidden Markov models [192], and the Kalman filtering-smoothing algorithms for state-space models [123].”
MethodDetecting Individual Sites Subject to Episodic Diversifying Selection
Murrell, B., Wertheim, J. O., Moola, S., Weighill, T., Scheffler, K., & Kosakovsky Pond, S. L. (2012) · PLoS Genetics · doi:10.1371/journal.pgen.1002764 · Cited by 1,811
“The likelihood of observing the site is calculated using the pruning algorithm [22] given the data, the tree ( t ), the instantaneous rate matrix ( Q ), and the branch lengths ( T ).”
MethodBayesian Phylogeography Finds Its Roots
Lemey, P., Rambaut, A., Drummond, A. J., & Suchard, M. A. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000520 · Cited by 1,784
“CTMCs are the same processes one commonly exploits to model sequence character evolution [15,50].”
BackgroundMethodIdentifying a High Fraction of the Human Genome to be under Selective Constraint Using GERP++
Davydov, E. V., Goode, D. L., Sirota, M., Cooper, G. M., Sidow, A., & Batzoglou, S. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001025 · Cited by 1,757
“For any given r , and therefore fixed tree T r , this function can be computed efficiently using a dynamic programming algorithm due to Felsenstein [16].”
MethodProbability distribution of molecular evolutionary trees: A new method of phylogenetic inference
Rannala, B., & Yang, Z. (1996) · Journal of Molecular Evolution · doi:10.1007/bf02338839 · Cited by 1,748
Criscuolo, A., & Gribaldo, S. (2010) · BMC Evolutionary Biology · doi:10.1186/1471-2148-10-210 · Cited by 1,633
“Given the quartet tree in Figure 7, the evolution of a DNA sequence of length 10,000 with 25%-proportion of each nucleotide was simulated by Seq-Gen from the root to the four leaves u, v, x and y. To infer the evolution of this DNA sequence, the evolutionary model F81 [ 74 ] was chosen.”
MethodA Bayesian Mixture Model for Across-Site Heterogeneities in the Amino-Acid Replacement Process
Lartillot, N., & Philippe, H. (2004) · Molecular Biology and Evolution · doi:10.1093/molbev/msh112 · Cited by 1,516
Lanciotti, R. S., Roehrig, J. T., Deubel, V., Smith, J., Parker, M., Steele, K., Crise, B., Volpe, K. E., Crabtree, M. B., Scherret, J. H., et al. (1999) · Science · doi:10.1126/science.286.5448.2333 · Cited by 1,593
TURNER, S., PRYER, K. M., MIAO, V. P. W., & PALMER, J. D. (1999) · Journal of Eukaryotic Microbiology · doi:10.1111/j.1550-7408.1999.tb04612.x · Cited by 1,575
Rambaut, A., & Grass, N. C. (1997) · Bioinformatics · doi:10.1093/bioinformatics/13.3.235 · Cited by 1,574
Templeton, A. R. (1983) · Evolution · doi:10.1111/j.1558-5646.1983.tb05533.x · Cited by 1,559
The ribosomal database project
Larsen, N., Olsen, G. J., Maidak, B. L., McCaughey, M. J., Overbeek, R., Macke, T. J., Marsh, T. L., & Woese, C. R. (1993) · Nucleic Acids Research · doi:10.1093/nar/21.13.3021 · Cited by 1,520
Pfenninger, M., & Posada, D. (2002) · Evolution · doi:10.1111/j.0014-3820.2002.tb00191.x · Cited by 1,520
Shukla, S., Mishra, B., Avashthi, H., & Chandra, M. (2022) · Bioinformatics · doi:10.1016/b978-0-323-89775-4.00003-1 · Cited by 1,244
Evaluation of methods for detecting recombination from DNA sequences: Computer simulations
Posada, D., & Crandall, K. A. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.241370698 · Cited by 1,502
Eleven grand challenges in single-cell data science
Lähnemann, D., Köster, J., Szczurek, E., McCarthy, D. J., Hicks, S. C., Robinson, M. D., Vallejos, C. A., Campbell, K. R., Beerenwinkel, N., Mahfouz, A., et al. (2020) · Genome Biology · doi:10.1186/s13059-020-1926-6 · Cited by 1,327
Yang, Z. (1998) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025957 · Cited by 1,457
RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees
Stamatakis, A., Ludwig, T., & Meier, H. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti191 · Cited by 1,438
“Secondly, dnapars uses stepwise addition ( Felsenstein 1981 ) for tree building and is relatively fast.”
BackgroundMethodInfluentialBayesian species delimitation using multilocus sequence data
Yang, Z., & Rannala, B. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0913022107 · Cited by 1,405
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
Estimating the rate of evolution of the rate of molecular evolution
Thorne, J. L., Kishino, H., & Painter, I. S. (1998) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025892 · Cited by 1,317
FUBAR: A Fast, Unconstrained Bayesian AppRoximation for Inferring Selection
Murrell, B., Moola, S., Mabona, A., Weighill, T., Sheward, D., Kosakovsky Pond, S. L., & Scheffler, K. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst030 · Cited by 1,358
“where pð , j Þ specifies the probability of each ( , ) combination, is a set of parameters governing this distribution, and pðxk j Þ is computed by the standard phylogenetic pruning algorithm (Felsenstein 1981).”
MethodInfluentialAnisimova, M., Gil, M., Dufayard, J.-F., Dessimoz, C., & Gascuel, O. (2011) · Systematic Biology · doi:10.1093/sysbio/syr041 · Cited by 1,291
“In particular, since the introduction of ML in phylogenetics (Felsenstein 1981), the heuristics for ML tree search have steadily improved in terms of efficiency and speed (Lemmon and Milinkovitch 2002; Guindon and Gascuel 2003; Hordijk and Gascuel 2005; Stamatakis and Ott 2008; Stamatakis et al.”
MethodPhylogenomics and the reconstruction of the tree of life
Delsuc, F., Brinkmann, H., & Philippe, H. (2005) · Nature Reviews Genetics · doi:10.1038/nrg1603 · Cited by 1,236
“Maximum likelihood (ML) 157 selects the tree that maximizes the probability of observing the data under a given model.”
BackgroundKaKs_Calculator: Calculating Ka and Ks Through Model Selection and Model Averaging
Zhang, Z., Li, J., Zhao, X.-Q., Wang, J., Wong, G. K.-S., & Yu, J. (2006) · Genomics, Proteomics & Bioinformatics · doi:10.1016/s1672-0229(07)60007-2 · Cited by 1,231
A nonparametric approach to estimating divergence times in the absence of rate constancy.
Sanderson, M. J. (1997) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025731 · Cited by 1,156
Organised Genome Dynamics in the Escherichia coli Species Results in Highly Diverse Adaptive Paths
Touchon, M., Hoede, C., Tenaillon, O., Barbe, V., Baeriswyl, S., Bidet, P., Bingen, E., Bonacorsi, S., Bouchier, C., Bouvet, O., et al. (2009) · PLoS Genetics · doi:10.1371/journal.pgen.1000344 · Cited by 1,181
“66 package [109] from the set of trees inferred in (ii).”
BackgroundThe ribosomal database project (RDP-II): introducing myRDP space and quality controlled public data
Cole, J. R., Chai, B., Farris, R. J., Wang, Q., Kulam-Syed-Mohideen, A. S., McGarrell, D. M., Bandela, A. M., Cardenas, E., Garrity, G. M., & Tiedje, J. M. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkl889 · Cited by 1,165
Computational Molecular Evolution
Yang, Z. (2006) · doi:10.1093/acprof:oso/9780198567028.001.0001 · Cited by 1,148
Inferring Phylogeny Despite Incomplete Lineage Sorting
Maddison, W. P., & Knowles, L. L. (2006) · Systematic Biology · doi:10.1080/10635150500354928 · Cited by 1,142
“character change, whether stochastic (e.g., Felsenstein, 1981 ) or not (e.g, Hennig, 1966), was vital to the development of phylogenetic methods, incorporation of explicit models of lineage sorting will be needed for continued development of phylogenetic inference near the species level.”
MethodEstimating a Binary Character's Effect on Speciation and Extinction
Maddison, W. P., Midford, P. E., & Otto, S. P. (2007) · Systematic Biology · doi:10.1080/10635150701607033 · Cited by 1,128
“This is the well-established "pruning" (Felsenstein, 1981) or "downpass" (Maddison and Maddison, 1992) approach and is used to handle more compactly all the possibilities of ancestral states at various parts of the tree (Felsenstein, 1981).”
MethodRannala, B., & Yang, Z. (2003) · Genetics · doi:10.1093/genetics/164.4.1645 · Cited by 1,131
Resolving difficult phylogenetic questions: Why more sequences are not enough
Philippe, H., Brinkmann, H., Lavrov, D. V., Littlewood, D. T. J., Manuel, M., Wörheide, G., & Baurain, D. (2011) · PLoS Biology · doi:10.1371/journal.pbio.1000602 · Cited by 1,129
“Briefly, major steps forward were the modeling of heterogeneity of rate across species [63], heterogeneity of rate across substitutions [64,65], heterogeneity of nucleotide/ amino acid composition across species [66,67], heterogeneity of rate across sites [68], and heterogeneity of the substitution process across site…”
BackgroundRETRACTED ARTICLE: TREEFINDER: a powerful graphical analysis environment for molecular phylogenetics
Jobb, G., von Haeseler, A., & Strimmer, K. (2004) · BMC Evolutionary Biology · doi:10.1186/1471-2148-4-18 · Cited by 1,112
RetractedInferring evolutionary processes from phylogenies
PAGEL, M. (1997) · Zoologica Scripta · doi:10.1111/j.1463-6409.1997.tb00423.x · Cited by 1,106
Likelihood-Based Tests of Topologies in Phylogenetics
Goldman, N., Anderson, J. P., & Rodrigo, A. G. (2000) · Systematic Biology · doi:10.1080/106351500750049752 · Cited by 1,096
Microbial Ecology and Evolution: A Ribosomal RNA Approach
Olsen, G. J., Lane, D. J., Giovannoni, S. J., Pace, N. R., & Stahl, D. A. (1986) · Annual Review of Microbiology · doi:10.1146/annurev.mi.40.100186.002005 · Cited by 1,078
Estimating the pattern of nucleotide substitution
Yang, Z. (1994) · Journal of Molecular Evolution · doi:10.1007/bf00178256 · Cited by 1,076
“Our second purpose is to examine the adequacy of simpler models, and, if they are not acceptable, to provide a new substitution model for use in the maximum likelihood phylogenetic estimation (Felsenstein 1981).”
BackgroundInfluentialKeane, T. M., Creevey, C. J., Pentony, M. M., Naughton, T. J., & Mclnerney, J. O. (2006) · BMC Evolutionary Biology · doi:10.1186/1471-2148-6-29 · Cited by 1,071
Drummond, A. J., Nicholls, G. K., Rodrigo, A. G., & Solomon, W. (2002) · Genetics · doi:10.1093/genetics/161.3.1307 · Cited by 1,059
Matsen, F. A., Kodner, R. B., & Armbrust, E. V. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-538 · Cited by 1,050
“Phylogenetic placement is a simplified version of phylogenetic tree reconstruction by sequential insertion [36,37].”
Background(1993) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040082 · Cited by 1,036
Timing the ancestor of the HIV-1 pandemic strains.
Korber, B., Muldoon, M., Theiler, J., Gao, F., Gupta, R., Lapedes, A., Hahn, B. H., Wolinsky, S., & Bhattacharya, T. (2000) · Science · doi:10.1126/science.288.5472.1789 · Cited by 1,021
Phylogeny Estimation and Hypothesis Testing Using Maximum Likelihood
Huelsenbeck, J. P., & Crandall, K. A. (1997) · Annual Review of Ecology and Systematics · doi:10.1146/annurev.ecolsys.28.1.437 · Cited by 1,018
Bayesian phylogenetic inference using DNA sequences: a Markov Chain Monte Carlo Method
Yang, Z., & Rannala, B. (1997) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025811 · Cited by 1,274
How Many Bootstrap Replicates Are Necessary?
Pattengale, N. D., Alipour, M., Bininda-Emonds, O. R. P., Moret, B. M. E., & Stamatakis, A. (2010) · Journal of Computational Biology · doi:10.1089/cmb.2009.0179 · Cited by 958
“The algorithm for efficient computation of the bipartitions at each inner branch is conceptually very similar to Felsenstein’s pruning algorithm for computing the ML score on a tree (Felsenstein, 1981).”
InfluentialBryant, D., Bouckaert, R., Felsenstein, J., Rosenberg, N. A., & RoyChoudhury, A. (2012) · Molecular Biology and Evolution · doi:10.1093/molbev/mss086 · Cited by 965
Self-citationLartillot, N., Rodrigue, N., Stubbs, D., & Richer, J. (2013) · Systematic Biology · doi:10.1093/sysbio/syt022 · Cited by 871
“In particular, it is a mixture of F81 (Felsenstein 1981) processes, such that, upon a substitution, the probability of the final state does not depend on the initial state.”
BackgroundHuang, W., Takebayashi, N., Qi, Y., & Hickerson, M. J. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-1 · Cited by 951
“The multiple loci from each taxon-pair are assumed to be unlinked and for the mutation model, the Jukes-Can-tor [37], equal-input (F81) [38], or HKY model [39] of DNA substitution can be optionally used for all loci [37], with the equal-input model being default.”
MethodDiversitree: comparative phylogenetic analyses of diversification in R
FitzJohn, R. G. (2012) · Methods in Ecology and Evolution · doi:10.1111/j.2041-210x.2012.00234.x · Cited by 941
“In particular, any model that can be expressed by moving down a tree (post-order traversal, or ‘pruning’; Felsenstein 1981) can be implemented using only a modest number of lines of R code.”
MethodAutomated Phylogenetic Detection of Recombination Using a Genetic Algorithm
Kosakovsky Pond, S. L., Posada, D., Gravenor, M. B., Woelk, C. H., & Frost, S. D. W. (2006) · Molecular Biology and Evolution · doi:10.1093/molbev/msl051 · Cited by 945
“Branch lengths and other model parameters are fitted using the maximum likelihood framework (Felsenstein, 1981).”
BackgroundMethodSIMMAP: Stochastic character mapping of discrete traits on phylogenies
Bollback, J. P. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-88 · Cited by 940
“With these probabilities we can efficiently calculate the conditional likelihoods using the post-order traversal pruning algorithm of Felsenstein [21].”
MethodSelecting the Best-Fit Model of Nucleotide Substitution
Posada, D., & Crandall, K. A. (2001) · Systematic Biology · doi:10.1080/10635150118469 · Cited by 937
Fungal Identification Using Molecular Tools: A Primer for the Natural Products Research Community
Raja, H. A., Miller, A. N., Pearce, C. J., & Oberlies, N. H. (2017) · Journal of Natural Products · doi:10.1021/acs.jnatprod.6b01085 · Cited by 931
Stochastic Mapping of Morphological Characters
Huelsenbeck, J. P., Nielsen, R., & Bollback, J. P. (2003) · Systematic Biology · doi:10.1080/10635150309342 · Cited by 922
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040152 · Cited by 920
Metadata
- Authors
- Felsenstein, J.
- Affiliations
- University of Washington (US)
- Corresponding author
- Felsenstein, Joseph
- Venue
- Journal of Molecular Evolution
- Published
- 1981-11
- Volume
- 17
- Issue
- 6
- Pages
- 368-376
- ISSN
- 0022-2844 (ISSN-L)
- 1432-1432
- OpenAlex
- W2102424972
- Cited by
- 14,571
- References
- 31
- Citations by year
- 2026: 380 · 2025: 502 · 2024: 550 · 2023: 634 · 2022: 651 · 2021: 730 · 2020: 739 · 2019: 759 · 2018: 649 · 2017: 655 · 2016: 710 · 2015: 706 · 2014: 662 · 2013: 592 · 2012: 477
- FWCI
- 0.71
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Molecular Evolution (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genetic diversity and population structure
- Keywords
- phylogenetic inference, maximum likelihood estimation, nucleic acid sequences, likelihood ratio test
- MeSH terms
- Base Sequence, Computers, DNA, Biological Evolution, Mathematics, Models, Biological, Phylogeny
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.