The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
TNT: Tree Analysis Using New Technology
Abstract
TNT: Tree Analysis Using New Technology. Version 1.0, Beta test v. 0.2. Program and documentation available at http://www.zmuc.dk/ public/phylogeny/TNT/.—Pablo A. Goloboff, James S. Farris, and Kevin Nixon. 2003. Instituto Miguel Lillo, San Miguel de Tucumán, Argentina. $80. Analyses of data under the parsimony criterion have been thought of as difficult when dealing with large numbers of terminal taxa. Certain implementations such as Hennig86 (Farris, 1988), PAUP (Swofford, 1990, 2002), and Nona (and its descendants; Goloboff, 1994, 1996a, 1996b, 1998) have made our lives more or less easy, but current data sets require more than these programs can give us. Keeping up with the increasingly larger data set size, new algorithms have been developed in areas such as simulated annealing (Goloboff, 1999; Nixon, 1999), genetic algorithms (Goloboff, 1999; Lemmon and Milinkovitch, 2002; Moilanen, 1999, 2001), or divide-and-conquer strategies (Goloboff, 1999; Nakhleh et al., 2001). Developments on forgotten areas such as calculating consensuses efficiently (Goloboff and Farris, 2001), improvements to resampling measures of group support (Goloboff and Farris, 2001; Goloboff et al., 2003a), and directed tree searches (drivers and alike), together with faster swappers, are now all available in a new interactive software, TNT (Goloboff et al., 2003b). Its name comes from Tree Analysis Using New Technology. TNT version 1 is currently available (since October 2003) for download at http://www.zmuc.dk/public/ phylogeny/TNT/ (and can be also obtained through the webpage http://www.cladistics.com/). The program can be executed up to 10 times for demonstration purposes, but a license needs to be purchased afterwards. The cost of the software is $80. Examples and a PowerPoint tutorial are available free at the download site; I recommend that the beginning user studies the tutorial carefully. However, the program, GUI based, is interactive and easy to explore by playing with the menus. TNT runs in Microsoft Windows computers (different Windows versions), but can also be run on a Macintosh from a virtual PC environment. There are also Linux and Mac OSX versions of TNT. Commands can also be executed in a command line fashion. Furthermore, the program allows storage of batch commands that can be called upon in order to reproduce an analysis automatically, a fairly sophisticated scripting system that allows automatization of almost anything that one wants to do with the program, including a series of dialogs included in the executable zipdruns.exe. Although I have not familiarized myself with this scripting system, I know that it has enormous possibilities. The beauty of TNT is the integration of fast swappers (TBR in TNT is about 10 to 50 times faster than PAUP*, depending on data set size: the larger, the greater the difference) with the “New Technology” algorithms that allow another level of tree searching. These algorithms include Ratchet (Nixon, 1999), Tree Drifting (Goloboff, 1999), Sectorial Searches (Goloboff, 1999), and Tree Fusing (Goloboff, 1999). The program allows customization of each one of these techniques and makes it easy to integrate the different algorithms (for a clear explanation of the algorithms and how to combine them, see Goloboff, 2002). These fast swappers combined with the newest algorithms in tree searching justify the use of TNT, providing that one deals with large analyses (i.e., more than 80 taxa). These functions are all found under the “New Technology Search” menu option. I have also found the program excellent for teaching purposes because it allows the students to see the importance of using fast and efficient algorithms. As in previous software by the authors, memory requirements are flawless and the software has an impeccable RAM management that allows fast access to data. Another marvel of TNT is the different options for specifying driven searches (intelligent searches) under the “New Technology Search” menu option. The most obvious driver is to specify a fixed number of times that a minimum tree length has to be found during the search; for example, one can ask to do at least 10 full replicates and then stop after minimum tree length (defined as the minimum length the program is able to find) is hit 5 times. My favorite driver is the one that involves consensus techniques, where one searches until minimum tree length is found a certain number of times and then a consensus is estimated. A second round of searching starts and a new consensus is generated and compared to the previous one, and so on until the consensus stabilizes. The number of hits to minimum tree length as well as the times that the consensus needs to be identical to consider it stable are defined by the user. This method works extremely well for data sets with thousands or millions of equally parsimonious trees, as is typical of some morphological data sets. The use of such drivers allows achieving a stable consensus after fi
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
CONFIDENCE 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
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
Bayesian Inference of Phylogeny and Its Impact on Evolutionary Biology
Huelsenbeck, J. P., Ronquist, F., Nielsen, R., & Bollback, J. P. (2001) · Science · doi:10.1126/science.1065889 · Cited by 2,737
THE LIMITS OF AMINO ACID SEQUENCE DATA IN ANGIOSPERM PHYLOGENETIC RECONSTRUCTION
Bremer, K. (1988) · Evolution · doi:10.1111/j.1558-5646.1988.tb02497.x · Cited by 2,534
The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis
Nixon, K. (1999) · Cladistics · doi:10.1006/clad.1999.0121 · Cited by 1,773
PARSIMONY JACKKNIFING OUTPERFORMS NEIGHBOR‐JOINING
Farris, J. S., Albert, V. A., Källersjö, M., Lipscomb, D., & Kluge, A. G. (1996) · Cladistics · doi:10.1111/j.1096-0031.1996.tb00196.x · Cited by 1,504
Estimating character weights during tree search
Goloboff, P. A. (1993) · Cladistics · doi:10.1111/j.1096-0031.1993.tb00209.x · Cited by 1,296
Analyzing large data sets in reasonable times: solutions for composite optima
Goloboff, P. A. (1999) · Cladistics · doi:10.1111/j.1096-0031.1999.tb00278.x · Cited by 1,039
Improvements to resampling measures of group support
Goloboff, P. A., Farris, J. S., Källersjö, M., Oxelman, B., Ramıacute;rez, M. J., & Szumik, C. A. (2003) · Cladistics · doi:10.1111/j.1096-0031.2003.tb00376.x · Cited by 851
Optimization alignment: the end of multiple sequence alignment in phylogenetics?
Wheeler, W. (1996) · Cladistics · doi:10.1111/j.1096-0031.1996.tb00189.x · Cited by 638
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
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
Accelerated Species Inventory on Madagascar Using Coalescent-Based Models of Species Delineation
Monaghan, M. T., Wild, R., Elliot, M., Fujisawa, T., Balke, M., Inward, D. J. G., Lees, D. C., Ranaivosolo, R., Eggleton, P., Barraclough, T. G., et al. (2009) · Systematic Biology · doi:10.1093/sysbio/syp027 · Cited by 741
Nuclear vs. plastid data: complex Pleistocene history of a circumpolar key species
EIDESEN, P. B., ALSOS, I. G., POPP, M., STENSRUD, Ø., SUDA, J., & BROCHMANN, C. (2007) · Molecular Ecology · doi:10.1111/j.1365-294x.2007.03425.x · Cited by 519
Song, H., Amédégnato, C., Cigliano, M. M., Desutter‐Grandcolas, L., Heads, S. W., Huang, Y., Otte, D., & Whiting, M. F. (2015) · Cladistics · doi:10.1111/cla.12116 · Cited by 316
Metadata
- Authors
- Giribet, G.
- Venue
- Systematic Biology
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-02-01
- Volume
- 54
- Issue
- 1
- Pages
- 176-178
- ISSN
- 1063-5157 (ISSN-L)
- 1076-836X
- OpenAlex
- W2267174354
- Cited by
- 346
- References
- 21
- FWCI
- 10.03
- 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: TNT: Tree Analysis Using New Technology. https://app.cochat.ai/papers/10.1080/10635150590905830
- The paper
- Giribet, G. (2005). TNT: Tree Analysis Using New Technology. Systematic Biology. https://doi.org/10.1080/10635150590905830
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.