The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
MEGA12: Molecular Evolutionary Genetic Analysis Version 12 for Adaptive and Green Computing
Open accessAbstract
We introduce the 12th version of the Molecular Evolutionary Genetics Analysis (MEGA12) software. This latest version brings many significant improvements by reducing the computational time needed for selecting optimal substitution models and conducting bootstrap tests on phylogenies using maximum likelihood (ML) methods. These improvements are achieved by implementing heuristics that minimize likely unnecessary computations. Analyses of empirical and simulated datasets show substantial time savings by using these heuristics without compromising the accuracy of results. MEGA12 also links-in an evolutionary sparse learning approach to identify fragile clades and associated sequences in evolutionary trees inferred through phylogenomic analyses. In addition, this version includes fine-grained parallelization for ML analyses, support for high-resolution monitors, and an enhanced Tree Explorer. MEGA12 can be downloaded from https://www.megasoftware.net.
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
MEGA6: Molecular Evolutionary Genetics Analysis Version 6.0
Tamura, K., Stecher, G., Peterson, D., Filipski, A., & Kumar, S. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst197 · Cited by 47,205
Self-citationCONFIDENCE LIMITS ON PHYLOGENIES: AN APPROACH USING THE BOOTSTRAP
Felsenstein, J. (1985) · Evolution · doi:10.1111/j.1558-5646.1985.tb00420.x · Cited by 44,647
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
Self-citationMEGA4: Molecular Evolutionary Genetics Analysis (MEGA) Software Version 4.0
Tamura, K., Dudley, J., Nei, M., & Kumar, S. (2007) · Molecular Biology and Evolution · doi:10.1093/molbev/msm092 · Cited by 28,730
Self-citationMEGA11: Molecular Evolutionary Genetics Analysis Version 11
Tamura, K., Stecher, G., & Kumar, S. (2021) · Molecular Biology and Evolution · doi:10.1093/molbev/msab120 · Cited by 22,403
Self-citationMEGA3: Integrated software for Molecular Evolutionary Genetics Analysis and sequence alignment
Kumar, S. (2004) · Briefings in Bioinformatics · doi:10.1093/bib/5.2.150 · Cited by 11,756
Self-citationMUSCLE: a multiple sequence alignment method with reduced time and space complexity
Edgar, R. C. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-113 · Cited by 8,970
Molecular Evolution and Phylogenetics
Nei, M., & Kumar, S. (2000) · doi:10.1093/oso/9780195135848.001.0001 · Cited by 8,012
Self-citationSMARCAD1 ATPase activity is required to silence endogenous retroviruses in embryonic stem cells
Sachs, P., Ding, D., Bergmaier, P., Lamp, B., Schlagheck, C., Finkernagel, F., Nist, A., Stiewe, T., & Mermoud, J. E. (2019) · Nature Communications · doi:10.1038/s41467-019-09078-0 · Cited by 2,384
Not 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
MEGA: Molecular Evolutionary Genetics Analysis software for microcomputers
Kumar, S., Tamura, K., & Nei, M. (1994) · Bioinformatics · doi:10.1093/bioinformatics/10.2.189 · Cited by 1,161
Self-citationHow 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
Estimating divergence times in large molecular phylogenies
Tamura, K., Battistuzzi, F. U., Billing-Ross, P., Murillo, O., Filipski, A., & Kumar, S. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1213199109 · Cited by 676
Self-citationPhylogenetic tree building in the genomic age
Kapli, P., Yang, Z., & Telford, M. J. (2020) · Nature Reviews Genetics · doi:10.1038/s41576-020-0233-0 · Cited by 533
Contentious relationships in phylogenomic studies can be driven by a handful of genes
Shen, X.-X., Hittinger, C. T., & Rokas, A. (2017) · Nature Ecology & Evolution · doi:10.1038/s41559-017-0126 · Cited by 520
Gadagkar, S. R., Rosenberg, M. S., & Kumar, S. (2005) · Journal of Experimental Zoology Part B: Molecular and Developmental Evolution · doi:10.1002/jez.b.21026 · Cited by 480
Self-citationSong, S., Liu, L., Edwards, S. V., & Wu, S. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1211733109 · Cited by 463
(1992) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040725 · Cited by 431
Model selection may not be a mandatory step for phylogeny reconstruction
Abadi, S., Azouri, D., Pupko, T., & Mayrose, I. (2019) · Nature Communications · doi:10.1038/s41467-019-08822-w · Cited by 406
Gatesy, J., & Springer, M. S. (2014) · Molecular Phylogenetics and Evolution · doi:10.1016/j.ympev.2014.08.013 · Cited by 311
Statistics and Truth in Phylogenomics
Kumar, S., Filipski, A. J., Battistuzzi, F. U., Kosakovsky Pond, S. L., & Tamura, K. (2012) · Molecular Biology and Evolution · doi:10.1093/molbev/msr202 · Cited by 287
Self-citationPhylogenomics provides robust support for a two-domains tree of life
Williams, T. A., Cox, C. J., Foster, P. G., Szöllősi, G. J., & Embley, T. M. (2019) · Nature Ecology & Evolution · doi:10.1038/s41559-019-1040-x · Cited by 274
Adachi, J., Waddell, P. J., Martin, W., & Hasegawa, M. (2000) · Journal of Molecular Evolution · doi:10.1007/s002399910038 · Cited by 251
Boachon, B., Buell, C. R., Crisovan, E., Dudareva, N., García, N., Godden, G. T., Henry, L. K., Kamileen, M. O., Kates, H. R., Kilgore, M. B., et al. (2018) · Molecular Plant · doi:10.1016/j.molp.2018.06.002 · Cited by 142
Dissecting Incongruence between Concatenation- and Quartet-Based Approaches in Phylogenomic Data
Shen, X., Steenwyk, J. L., & Rokas, A. (2021) · Systematic Biology · doi:10.1093/sysbio/syab011 · Cited by 70
Evolutionary diagnosis method for variants in personal exomes
Kumar, S., Sanderford, M. D., Gray, V. E., Ye, J., & Liu, L. (2012) · Nature Methods · doi:10.1038/nmeth.2147 · Cited by 64
Self-citationConcatenation Analyses in the Presence of Incomplete Lineage Sorting
Warnow, T. J. (2015) · PLoS Currents · doi:10.1371/currents.tol.8d41ac0f13d1abedf4c4a59f5d17b1f7 · Cited by 63
Embracing green computing in molecular phylogenetics
Kumar, S. (2022) · Molecular Biology and Evolution · doi:10.1093/molbev/msac043 · Cited by 37
Self-citationFast and accurate bootstrap confidence limits on genome-scale phylogenies using little bootstraps
Sharma, S., & Kumar, S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00129-5 · Cited by 31
Self-citationA Molecular Evolutionary Reference for the Human Variome
Liu, L., Tamura, K., Sanderford, M. D., Gray, V. E., & Kumar, S. (2015) · Molecular Biology and Evolution · doi:10.1093/molbev/msv198 · Cited by 28
Self-citationEvolutionary sparse learning for phylogenomics
Kumar, S., & Sharma, S. (2021) · Molecular Biology and Evolution · doi:10.1093/molbev/msab227 · Cited by 22
Self-citationDiscovering Fragile Clades and Causal Sequences in Phylogenomics by Evolutionary Sparse Learning
Sharma, S., & Kumar, S. (2024) · Molecular Biology and Evolution · doi:10.1093/molbev/msae131 · Cited by 9
Self-citationMyESL: A Software for Evolutionary Sparse Learning in Molecular Phylogenetics and Genomics
Sanderford, M. D., Sharma, S., Stecher, G., Suleski, M., Liu, J., Ye, J., & Kumar, S. (2025) · Molecular Biology and Evolution · doi:10.1093/molbev/msaf224 · Cited by 3
Self-citation
Cited by
Vandeputte, M., Diependaele, E., & Van Bogaert, I. N. A. (2025) · FEMS Yeast Research · doi:10.1093/femsyr/foaf048 · Cited by 4
Abedin, I., Putra, A., Kang, H.-E., Singh, A., Singh, S., Jung, W.-K., Kim, H.-W., & Kundu, S. (2025) · doi:10.21203/rs.3.rs-7140563/v1 · Cited by 1
Evolutionary insights into provirus-encoded CRISPR-Cas systems in halophilic archaea
(2025) · doi:10.1093/femsml/uqaf033 · Cited by 1
Metadata
- Authors
- Kumar, S., Stecher, G., Suleski, M., Sanderford, M., Sharma, S., & Tamura, K.
- Venue
- Molecular Biology and Evolution
- Publisher
- Oxford University Press (OUP)
- Published
- 2024-12
- Volume
- 41
- Issue
- 12
- ISSN
- 0737-4038 (ISSN-L)
- 1537-1719
- OpenAlex
- W4405670661
- Cited by
- 2,422
- References
- 33
- FWCI
- 281.40
- Type
- journal article
- Language
- en
- Open access
- gold
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.