A novel fast and effective stochastic algorithm to estimate maximum likelihood trees. IQ-TREE compares favorably to RAxML and PhyML in terms of likelihood while requiring similar amount of computing time (Nguyen et al., 2015).
An ultrafast bootstrap approximation (UFBoot) to assess branch supports. UFBoot is 10 to 40 times faster than RAxML rapid bootstrap and obtains less biased support values (Minh et al., 2013).
An ultrafast and automatic model selection (ModelFinder) which is 10 to 100 times faster than jModelTest and ProtTest. ModelFinder also performs best-fit partitioning scheme selection like PartitionFinder.
Phylogenomic partition models allowing for mixed data types, mixed rate heterogeneity types, linked or unlinked branch lengths.
The latest IQ-TREE release version 1.4.2 (April 15, 2016)
Some parts of the code were taken from the following packages/libraries: Phylogenetic likelihood library, TREE-PUZZLE, BIONJ, Nexus Class Libary, Eigen library, SPRNG library, Zlib library, vectorclass library, GNU scientific library.