The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
FastME 2.0: A Comprehensive, Accurate, and Fast Distance-Based Phylogeny Inference Program: Table 1.
Open accessAbstract
FastME provides distance algorithms to infer phylogenies. FastME is based on balanced minimum evolution, which is the very principle of Neighbor Joining (NJ). FastME improves over NJ by performing topological moves using fast, sophisticated algorithms. The first version of FastME only included Nearest Neighbor Interchange. The new 2.0 version also includes Subtree Pruning and Regrafting, while remaining as fast as NJ and providing a number of facilities: Distance estimation for DNA and proteins with various models and options, bootstrapping, and parallel computations. FastME is available using several interfaces: Command-line (to be integrated in pipelines), PHYLIP-like, and a Web server (http://www.atgc-montpellier.fr/fastme/).
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
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
(1987) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040454 · Cited by 59,715
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
Self-citationFastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix
Price, M. N., Dehal, P. S., & Arkin, A. P. (2009) · Molecular Biology and Evolution · doi:10.1093/molbev/msp077 · Cited by 5,602
A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040126 · Cited by 824
Theoretical foundation of the minimum-evolution method of phylogenetic inference.
(1993) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040056 · Cited by 659
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
Desper, R., & Gascuel, O. (2002) · Journal of Computational Biology · doi:10.1089/106652702761034136 · Cited by 488
Self-citationA note on the neighbor-joining algorithm of Saitou and Nei.
(1988) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040527 · Cited by 445
Gascuel, O. (2006) · Molecular Biology and Evolution · doi:10.1093/molbev/msl072 · Cited by 358
Self-citationDesper, R. (2003) · Molecular Biology and Evolution · doi:10.1093/molbev/msh049 · Cited by 269
Self-citationSeyfried, M. (2002) · INTERNATIONAL JOURNAL OF SYSTEMATIC AND EVOLUTIONARY MICROBIOLOGY · doi:10.1099/ijs.0.01472-0 · Cited by 259
Direct Calculation of a Tree Length Using a Distance Matrix
Pauplin, Y. (2000) · Journal of Molecular Evolution · doi:10.1007/s002390010065 · Cited by 115
Cited by
OrthoFinder: phylogenetic orthology inference for comparative genomics
Emms, D. M., & Kelly, S. (2019) · Genome Biology · doi:10.1186/s13059-019-1832-y · Cited by 7,676
TYGS is an automated high-throughput platform for state-of-the-art genome-based taxonomy
Meier-Kolthoff, J. P., & Göker, M. (2019) · Nature Communications · doi:10.1038/s41467-019-10210-3 · Cited by 3,276
GrapeTree: visualization of core genomic relationships among 100,000 bacterial pathogens
Zhou, Z., Alikhan, N.-F., Sergeant, M. J., Luhmann, N., Vaz, C., Francisco, A. P., Carriço, J. A., & Achtman, M. (2018) · Genome Research · doi:10.1101/gr.232397.117 · Cited by 1,060
NGPhylogeny.fr: new generation phylogenetic services for non-specialists
Lemoine, F., Correia, D., Lefort, V., Doppelt-Azeroual, O., Mareuil, F., Cohen-Boulakia, S., & Gascuel, O. (2019) · Nucleic Acids Research · doi:10.1093/nar/gkz303 · Cited by 915
Self-citationGenome-Based Taxonomic Classification of the Phylum Actinobacteria
Nouioui, I., Carro, L., García-López, M., Meier-Kolthoff, J. P., Woyke, T., Kyrpides, N. C., Pukall, R., Klenk, H.-P., Goodfellow, M., & Göker, M. (2018) · Frontiers in Microbiology · doi:10.3389/fmicb.2018.02007 · Cited by 769
Metadata
- Authors
- Lefort, V., Desper, R., & Gascuel, O.
- Venue
- Molecular Biology and Evolution
- Publisher
- Oxford University Press (OUP)
- Published
- 2015-06-30
- Volume
- 32
- Issue
- 10
- Pages
- 2798-2800
- ISSN
- 0737-4038 (ISSN-L)
- 1537-1719
- OpenAlex
- W2161973008
- Cited by
- 1,777
- References
- 11
- FWCI
- 11.19
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.