Welcome to IQPNNI - Important Quartet Puzzling and NNI Operation

Important notice: IQPNNI is not maintained anymore and is superseded by IQ-TREE. Please redirect to http://www.iqtree.org

Introduction:

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.

Latest version IQPNNI 3.3.2 (20th August 2010):

We are pleased to announce that IQPNNI 3.3.2 has come out with some important bug-fixes and new features:

Model parameter estimations fail in rare cases for parameter-rich model
Invar+Gamma rate heterogeneity bug fix
Compatibility issue with GCC 4.3.2
BIONJ tree is now reconstructed twice from the initial distances and the corrected maximum-likelihood distances

Therefore, we strongly recommend you to download and install this new version.

Please read the User Manual (or in PDF format) carefully before using IQPNNI the first time or when you upgrade the new version!

Download:

Source package and sequential binary releases for Linux, MacOS and Windows are available in gzipped TAR format and ZIP format. No binary release for parallel version is available, you have to build it on your own machine.

Type	Links
Source code	iqpnni-3.3.2.tar.gz iqpnni-3.3.2.zip
All-in-one binary release	iqpnni-3.3.2-bin.tar.gz iqpnni-3.3.2-bin.zip

In the all-in-one binary release you find all 32bit executables for Linux, MacOSX, and Windows, thus are compatible with 64bit OS. The binaries were complied with GCC 4.3.2 (Linux, MacOSX) and MinWG (Windows) and statically linked.

Older versions:

Go to Version History to find out more about the development of IQPNNI and for downloading older version releases.

Reference:

The method are described in details in the following articles:

Le Sy Vinh and Arndt von Haeseler (2004) IQPNNI: Moving fast through tree space and stopping in time. Mol. Biol. Evol., 21(8):1565-1571.
(free reprint, DOI: 10.1093/molbev/msh176, PMID: 15163768)
Bui Quang Minh, Le Sy Vinh, Arndt von Haeseler and Heiko A. Schmidt (2005) pIQPNNI: Parallel reconstruction of large maximum likelihood phylogenies. Bioinformatics, 21(19):3794-6. (free reprint, DOI: 10.1093/bioinformatics/bti594, PMID: 16046495)
Bui Quang Minh, Le Sy Vinh, Heiko A. Schmidt, and Arndt von Haeseler (2006) Large Maximum Likelihood Trees. Proceedings of the NIC Symposium 2006, 357-365, Forschungszentrum Jülich, Germany. (ISBN 3-00-017351-X) NIC series (PDF)
H.A. Schmidt and A. von Haeseler (2009) Phylogenetic Inference Using Maximum Likelihood Methods. In P. Lemey, M. Salemi, A.M. Vandamme (eds.)The Phylogenetic Handbook: a Practical Approach to Phylogenetic Analysis and Hypothesis Testing., 2nd Edition, 181-209, Cambridge University Press, Cambridge. (ISBN: paperback: 9780521730716, hardcover: 9780521877107, book webpage)