The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing
Open accessAbstract
Summary: TREE-PUZZLE is a program package for quartet-based maximum-likelihood phylogenetic analysis (formerly PUZZLE, Strimmer and von Haeseler, Mol. Biol. Evol. , 13, 964–969, 1996) that provides methods for reconstruction, comparison, and testing of trees and models on DNA as well as protein sequences. To reduce waiting time for larger datasets the tree reconstruction part of the software has been parallelized using message passing that runs on clusters of workstations as well as parallel computers. Availability: http://www.tree-puzzle.de. The program is written in ANSI C. TREE-PUZZLE can be run on UNIX, Windows and Mac systems, including Mac OS X. To run the parallel version of PUZZLE, a Message Passing Interface (MPI) library has to be installed on the system. Free MPI implementations are available on the Web (cf. http://www.lam-mpi.org/mpi/implementations/). Contact: hschmidt@molgen.mpg.de; haeseler@eva.mpg.de * To whom correspondence should be addressed.
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
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571
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
Yang, Z. (1994) · Journal of Molecular Evolution · doi:10.1007/bf00160154 · Cited by 2,960
Whelan, S., & Goldman, N. (2001) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a003851 · Cited by 2,849
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
Self-citation
Cited by
IQ-TREE 2: New Models and Efficient Methods for Phylogenetic Inference in the Genomic Era
Minh, B. Q., Schmidt, H. A., Chernomor, O., Schrempf, D., Woodhams, M. D., von Haeseler, A., & Lanfear, R. (2020) · Molecular Biology and Evolution · doi:10.1093/molbev/msaa015 · Cited by 16,873
Self-citationA Rapid Bootstrap Algorithm for the RAxML Web Servers
Stamatakis, A., Hoover, P., & Rougemont, J. (2008) · Systematic Biology · doi:10.1080/10635150802429642 · Cited by 7,028
Ultrafast Approximation for Phylogenetic Bootstrap
Minh, B. Q., Nguyen, M. A. T., & von Haeseler, A. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst024 · Cited by 4,844
Self-citationCannon, S. B., Mitra, A., Baumgarten, A., Young, N. D., & May, G. (2004) · BMC Plant Biology · doi:10.1186/1471-2229-4-10 · Cited by 2,372
Tunicates and not cephalochordates are the closest living relatives of vertebrates
Delsuc, F., Brinkmann, H., Chourrout, D., & Philippe, H. (2006) · Nature · doi:10.1038/nature04336 · Cited by 1,651
Metadata
- Authors
- Schmidt, H. A., Strimmer, K., Vingron, M., & von Haeseler, A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-03-01
- Volume
- 18
- Issue
- 3
- Pages
- 502-504
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2170996473
- Cited by
- 2,532
- References
- 5
- FWCI
- 47.41
- Type
- journal article
- Language
- en
- Open access
- bronze
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: TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing. https://app.cochat.ai/papers/10.1093/bioinformatics/18.3.502
- The paper
- Schmidt, H. A., Strimmer, K., Vingron, M., & von Haeseler, A. (2002). TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics. https://doi.org/10.1093/bioinformatics/18.3.502
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.
