The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation
Open accessAbstract
Large phylogeny estimation is a combinatorial optimization problem that no future computer will ever be able to solve exactly in practical computing time. The difficulty of the problem is amplified by the need to use complex evolutionary models and large taxon samplings. Hence, many heuristic approaches have been developed, with varying degrees of success. Here, we report on a heuristic approach, the metapopulation genetic algorithm, involving several populations of trees that are forced to cooperate in the search for the optimal tree. Within each population, trees are subjected to evaluation, selection, and mutation events, which are directed by using inter-population consensus information. The method proves to be both very accurate and vastly faster than existing heuristics, such that data sets comprised of hundreds of taxa can be analyzed in practical computing times under complex models of maximum-likelihood evolution. Branch support values produced by the metapopulation genetic algorithm might closely approximate the posterior probabilities of the corresponding branches.
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
Kimura, M. (1980) · Journal of Molecular Evolution · doi:10.1007/bf01731581 · Cited by 29,778
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571
Evolution of Protein Molecules
JUKES, T. H., & CANTOR, C. R. (1969) · Mammalian Protein Metabolism · doi:10.1016/b978-1-4832-3211-9.50009-7 · Cited by 11,032
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
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
Cited by
Guindon, S., Dufayard, J.-F., Lefort, V., Anisimova, M., Hordijk, W., & Gascuel, O. (2010) · Systematic Biology · doi:10.1093/sysbio/syq010 · Cited by 18,376
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
PHYML 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
Anisimova, M., Gil, M., Dufayard, J.-F., Dessimoz, C., & Gascuel, O. (2011) · Systematic Biology · doi:10.1093/sysbio/syr041 · Cited by 1,291
Metadata
- Authors
- Lemmon, A. R., & Milinkovitch, M. C.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2002-07-25
- Volume
- 99
- Issue
- 16
- Pages
- 10516-10521
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2070919193
- Cited by
- 200
- References
- 5
- FWCI
- 5.83
- Type
- journal article
- Language
- en
- Open access
- green
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: The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation. https://app.cochat.ai/papers/10.1073/pnas.162224399
- The paper
- Lemmon, A. R., & Milinkovitch, M. C. (2002). The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.162224399
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.