The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
is presented as a new method for analysis of large data sets. The method can be easily implemented with existing phylogenetic software by generating batch command files. Such an approach has been implemented in the programs DADA (Nixon, 1998) and Winclada (Nixon, 1999). The Parsimony Ratchet has also been implemented in the most recent versions of NONA (Goloboff, 1998). These implementations of the ratchet use the following steps: (1) Generate a starting tree (e.g., a "Wagner" tree followed by some level of branch swapping or not). (2) Randomly select a subset of characters, each of which is given additional weight (e.g., add 1 to the weight of each selected character). (3) Perform branch swapping (e.g., "branch-breaking" or TBR) on the current tree using the reweighted matrix, keeping only one (or few) tree. (4) Set all weights for the characters to the "original" weights (typically, equal weights). (5) Perform branch swapping (e.g., branch-breaking or TBR) on the current tree (from step 3) holding one (or few) tree. (6) Return to step 2. Steps 2-6 are considered to be one iteration, and typically, 50-200 or more iterations are performed. The number of characters to be sampled for reweighting in step 2 is determined by the user; I have found that between 5 and 25% of the characters provide good results in most cases. The performance of the ratchet for large data sets is outstanding, and the results of analyses of the 500 taxon seed plant rbcL data set (Chase et al., 1993) are presented here. A separate analysis of a three-gene data set for 567 taxa will be presented elsewhere (Soltis et al., in preparation) demonstrating the same extraordinary power. With the 500-taxon data set, shortest trees are typically found within 22 h (four runs of 200 iterations) on a 200-MHz Pentium Pro. These analyses indicate efficiency increases of 20×-80× over "traditional methods" such as varying taxon order randomly and holding few trees, followed by more complete analyses of the best trees found, and thousands of times faster than nonstrategic searches with PAUP. Because the ratchet samples many tree islands with fewer trees from each island, it provides much more accurate estimates of the "true" consensus than collecting many trees from few islands. With the ratchet, Goloboff's NONA, and existing computer hardware, data sets that were previously intractable or required months or years of analysis with PAUP* can now be adequately analyzed in a few hours or days.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
PAUP (phylogenetic analysis using parsimony)
(2008) · Encyclopedia of Genetics, Genomics, Proteomics and Informatics · doi:10.1007/978-1-4020-6754-9_12413 · Cited by 4,412
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 Discovery and Importance of Multiple Islands of Most-Parsimonious Trees
Maddison, D. R. (1991) · Systematic Biology · doi:10.1093/sysbio/40.3.315 · Cited by 782
The Discovery and Importance of Multiple Islands of Most-Parsimonious Trees
Maddison, D. R. (1991) · Systematic Zoology · doi:10.2307/2992325 · Cited by 514
Analyzing Large Data Sets: rbcL 500 Revisited
Rice, K. A., Donoghue, M. J., & Olmstead, R. G. (1997) · Systematic Biology · doi:10.1093/sysbio/46.3.554 · Cited by 121
A Report on “One Day Symposium on Numerical Cladistics”
Horovitz, I. (1999) · Cladistics · doi:10.1006/clad.1999.0101 · Cited by 17
Research works printed but not linked: 6
- Farris S. J., 1988, Software and manual
- Goloboff P., 1998, Published by the author
- 10.1111/j.1096-0031.1999.tb00259.x · DOI
- Nixon K. C., 1998, Published by the author
- Nixon K C., 1999, Winclada (beta) ver. 0.9
- Swofford D. L., 1990, Illinois Natl. Hist. Surv
Cited by
TNT, a free program for phylogenetic analysis
Goloboff, P. A., Farris, J. S., & Nixon, K. C. (2008) · Cladistics · doi:10.1111/j.1096-0031.2008.00217.x · Cited by 5,352
Self-citationphangorn: phylogenetic analysis in R
Schliep, K. P. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btq706 · Cited by 3,747
Sequence-Based Species Delimitation for the DNA Taxonomy of Undescribed Insects
Pons, J., Barraclough, T. G., Gomez-Zurita, J., Cardoso, A., Duran, D. P., Hazell, S., Kamoun, S., Sumlin, W. D., & Vogler, A. P. (2006) · Systematic Biology · doi:10.1080/10635150600852011 · Cited by 2,775
TNT version 1.5, including a full implementation of phylogenetic morphometrics
Goloboff, P. A., & Catalano, S. A. (2016) · Cladistics · doi:10.1111/cla.12160 · Cited by 2,245
FROST, D. R., GRANT, T., FAIVOVICH, J., BAIN, R. H., HAAS, A., HADDAD, C. F. B., DE SÁ, R. O., CHANNING, A., WILKINSON, M., DONNELLAN, S. C., et al. (2006) · Bulletin of the American Museum of Natural History · doi:10.1206/0003-0090(2006)297[0001:tatol]2.0.co;2 · Cited by 1,922
Metadata
- Authors
- Nixon, K.
- Venue
- Cladistics
- Publisher
- Wiley
- Published
- 1999-12
- Volume
- 15
- Issue
- 4
- Pages
- 407-414
- ISSN
- 0748-3007 (ISSN-L)
- OpenAlex
- W2126763909
- Cited by
- 1,773
- References
- 6
- FWCI
- 7.18
- 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
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.