pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Summary: IQPNNI is a program to infer maximum-likelihood phylogenetic trees from DNA or protein data with a large number of sequences. We present an improved and MPI-parallel implementation showing very good scaling and speedup behavior. Availability: IQPNNI (http://www.bi.uni-duesseldorf.de/software/iqpnni) is written in C++, executable on UNIX/Linux, Windows and MacOS systems. (Free) MPI libraries can be found at http://www.lam-mpi.org/mpi/implementations/. Contact: [email protected]
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
Whelan, S., & Goldman, N. (2001) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a003851 · Cited by 2,849 · cited 2×
“, 1985) of evolution was used and the WAG model (Whelan and Goldman, 2001) for protein sequences.”
MethodQuartet 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 · cited 1×
“Parallelization scheme of pIQPNNI. algorithm, a simplified but computationally more efficient version of quartet puzzling (Strimmer and von Haeseler, 1996).”
DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment.
Morgenstern, B. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.3.211 · Cited by 678
Cited by
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Nguyen, L.-T., Schmidt, H. A., von Haeseler, A., & Minh, B. Q. (2015) · Molecular Biology and Evolution · doi:10.1093/molbev/msu300 · Cited by 26,046
Self-citationRAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models
Stamatakis, A. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl446 · Cited by 15,582
A 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-citationTaxon sampling and the accuracy of phylogenetic analyses
(2008) · Journal of Systematics and Evolution · doi:10.3724/sp.j.1002.2008.08016 · Cited by 553
Metadata
- Authors
- Minh, B. Q., Vinh, L. S., von Haeseler, A., & Schmidt, H. A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-07-26
- Volume
- 21
- Issue
- 19
- Pages
- 3794-3796
- ISSN
- 0266-7061 (ISSN-L)
- 1367-4803
- 1460-2059
- OpenAlex
- W2127836105
- Cited by
- 83
- References
- 3
- FWCI
- 3.46
- 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: pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies. https://app.cochat.ai/papers/10.1093/bioinformatics/bti594
- The paper
- Minh, B. Q., Vinh, L. S., von Haeseler, A., & Schmidt, H. A. (2005). pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies. Bioinformatics. https://doi.org/10.1093/bioinformatics/bti594
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.