The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data
Abstract
Phylogeny reconstruction is a difficult computational problem, because the number of possible solutions increases with the number of included taxa. For example, for only 14 taxa, there are more than seven trillion possible unrooted phylogenetic trees. For this reason, phylogenetic inference methods commonly use clustering algorithms (e.g., the neighbor-joining method) or heuristic search strategies to minimize the amount of time spent evaluating nonoptimal trees. Even heuristic searches can be painfully slow, especially when computationally intensive optimality criteria such as maximum likelihood are used. I describe here a different approach to heuristic searching (using a genetic algorithm) that can tremendously reduce the time required for maximum-likelihood phylogenetic inference, especially for data sets involving large numbers of taxa. Genetic algorithms are simulations of natural selection in which individuals are encoded solutions to the problem of interest. Here, labeled phylogenetic trees are the individuals, and differential reproduction is effected by allowing the number of offspring produced by each individual to be proportional to that individual's rank likelihood score. Natural selection increases the average likelihood in the evolving population of phylogenetic trees, and the genetic algorithm is allowed to proceed until the likelihood of the best individual ceases to improve over time. An example is presented involving rbcL sequence data for 55 taxa of green plants. The genetic algorithm described here required only 6% of the computational effort required by a conventional heuristic search using tree bisection/reconnection (TBR) branch swapping to obtain the same maximum-likelihood topology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Dating 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 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
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040152 · Cited by 920
Cited by
IQ-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
A 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
A likelihood approach to estimating phylogeny from discrete morphological character data
Lewis, P. O. (2001) · Systematic Biology · doi:10.1080/106351501753462876 · Cited by 2,929
Self-citationPHYML Online--a web server for fast maximum likelihood-based phylogenetic inference
Guindon, S., Lethiec, F., Duroux, P., & Gascuel, O. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki352 · Cited by 1,498
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
Metadata
- Authors
- Lewis, P. O.
- Venue
- Molecular Biology and Evolution
- Publisher
- Oxford University Press (OUP)
- Published
- 1998-03-01
- Volume
- 15
- Issue
- 3
- Pages
- 277-283
- ISSN
- 0737-4038 (ISSN-L)
- 1537-1719
- OpenAlex
- W2048132103
- Cited by
- 249
- References
- 4
- FWCI
- 2.36
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data. https://app.cochat.ai/papers/10.1093/oxfordjournals.molbev.a025924
- The paper
- Lewis, P. O. (1998). A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data. Molecular Biology and Evolution. https://doi.org/10.1093/oxfordjournals.molbev.a025924
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.