The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
IQPNNI: Moving Fast Through Tree Space and Stopping in Time
Open accessAbstract
An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast algorithms to generate a list of potential candidate trees. The key ingredient is the definition of so-called important quartets (IQs), which allow the computation of an intermediate tree in O(n(2)) time for n sequences. The resulting tree is then further optimized by applying the nearest neighbor interchange (NNI) operation. Subsequently a random fraction of the sequences is deleted from the best tree found so far. The deleted sequences are then re-inserted in the smaller tree using the important quartet puzzling (IQP) algorithm. These steps are repeated several times and the best tree, with respect to the likelihood criterion, is considered as the inferred phylogenetic tree. Moreover, we suggest a rule which indicates when to stop the search. Simulations show that IQPNNI gives a slightly better accuracy than other programs tested. Moreover, we applied the approach to 218 small subunit rRNA sequences and 500 rbcL sequences. We found trees with higher likelihood compared to the results by others. A program to reconstruct DNA or amino acid based phylogenetic trees is available online (http://www.bi.uni-duesseldorf.de/software/iqpnni).
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
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
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
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
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
UFBoot2: Improving the Ultrafast Bootstrap Approximation
Hoang, D. T., Chernomor, O., von Haeseler, A., Minh, B. Q., & Vinh, L. S. (2018) · Molecular Biology and Evolution · doi:10.1093/molbev/msx281 · Cited by 10,881
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
PHYML Online--a web server for fast maximum likelihood-based phylogenetic inference
Guindon, S., Lethiec, F., Duroux, P., & Gascuel, O. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki352 · Cited by 1,498
Metadata
- Authors
- Vinh, L. S.
- Venue
- Molecular Biology and Evolution
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-02-12
- Volume
- 21
- Issue
- 8
- Pages
- 1565-1571
- ISSN
- 0737-4038 (ISSN-L)
- 1537-1719
- OpenAlex
- W2074237174
- Cited by
- 165
- References
- 2
- FWCI
- 8.64
- 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: IQPNNI: Moving Fast Through Tree Space and Stopping in Time. https://app.cochat.ai/papers/10.1093/molbev/msh176
- The paper
- Vinh, L. S. (2004). IQPNNI: Moving Fast Through Tree Space and Stopping in Time. Molecular Biology and Evolution. https://doi.org/10.1093/molbev/msh176
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.