IQPNNI 3.3.2 – Reconstruct a Phylogenetic Tree based on DNA or Amino Acid Sequence data

IQPNNI 3.3.2


IQPNNI (Important Quartet Puzzling and NNI Operation) 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.



 the Center of Integrative Bioinformatics Vienna (CIBIV) headed by Arndt von Haeseler.




  • Windows / MacOsX / Linux





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.

Leave a Reply

Your email address will not be published. Required fields are marked *


This site uses Akismet to reduce spam. Learn how your comment data is processed.