IQ-TREE icon

IQ-TREE

(v3.1.1)Code (opens in a new tab)Paper (opens in a new tab)Docs

Build maximum likelihood phylogenetic trees with automatic model selection and ultrafast bootstrap.

Output

Configure inputs to begin

Set options on the left, then click “Build Tree”.

What is IQ-TREE?

ProteinIQ runs IQ-TREE 3.1.1. The native interface supports tree inference, partitioned analyses, topology tests, concordance factors, ancestral reconstruction, likelihood mapping, tree comparisons and AliSim simulation. Input bytes, taxon handling and scientific calculations follow IQ-TREE. The Files tab includes all files produced by the selected analysis, including native reports, logs and compressed checkpoints.

Pricing

Each job starts at 20 credits. Larger inputs use the existing calculator: one credit per 2,000 input characters, rounded up, with FASTA headers excluded. The exact quote appears before submission. Batch submissions contain up to ten independent alignment jobs, each priced separately.

Native settings and auxiliary inputs

SettingDefaultBehavior
Sequence typeAuto-detectProtein, nucleotide, codon, binary, morphology, nucleotide translation, or a native genetic-code specification such as CODON2
Substitution modelNative automatic selectionNamed models, model-selection modes, or an unchanged custom model string such as GTR+F+G4
Ultrafast bootstrap0Disabled by default; nonzero values must be integers from 1,000 to 10,000
SH-aLRT0Disabled by default; nonzero values must be integers from 1,000 to 10,000
Random seedUnspecifiedSupply an integer for reproducibility
Advanced native optionsEmpty arrayA JSON array of documented IQ-TREE argument tokens

Optional inputs include additional alignments, a partition definition, starting or candidate trees, model definitions, site frequencies, dates, likelihood-mapping clusters, gene trees and other native assets. Each uploaded file has a 50 MiB limit. Collection inputs accept up to ten files. Compressed alignments can be uploaded as .gz; binary model assets can be uploaded in the other native files input. Use the native formats required by the selected option.

Reference an uploaded file with @role, or @role/filename when the role contains several files. Role names are alignment, additional-alignments, partition, trees, model-definition, site-frequencies, dates, quartet-clusters, gene-trees and assets. File references also work for pasted inputs when the role contains one item. Filenames must be individual filenames; conflicting filenames with different content must be renamed before upload.

For native directory inputs, use @role/*. For example, upload several files in Additional alignments and use ["-p", "@additional-alignments/*"] to let IQ-TREE construct partitions from those files. File contents and names are preserved.

Examples for Advanced native options:

JSON
["--ancestral", "--rate"]
JSON
["-p", "@partition"]
JSON
["-z", "@trees", "-zb", "1000", "-au"]

Tree-only analyses can omit the alignment. For example, upload a tree file and use ["-t", "@trees", "--tree-dist-all"]. For AliSim, choose a suitable custom model and use ["--alisim", "OUTPUT", "-t", "@trees", "--length", "100"]. OUTPUT selects the managed output prefix. To use a supplied root sequence, use ["--root-seq", "@alignment,sequence-name"].

Set each scientific parameter either in its field or through advanced options. Output locations, CPU resource limits, execution time and checkpoint scheduling are managed by ProteinIQ. Other scientific values are passed unchanged; IQ-TREE reports unsupported combinations. See the official command reference for native option meanings. Analyses that produce several trees or no single tree remain available through the Files tab.

IQ-TREE is a phylogenetic tree inference software that uses maximum likelihood methods to reconstruct evolutionary relationships from aligned sequences. It combines fast tree search algorithms with sophisticated model selection to produce publication-quality phylogenetic trees for both protein and nucleotide sequences.

The software addresses two major bottlenecks in phylogenetic analysis: selecting the best substitution model and assessing branch support. ModelFinder automatically identifies the optimal evolutionary model 10-100 times faster than traditional tools like jModelTest. The ultrafast bootstrap (UFBoot) provides branch support values 10-40 times faster than standard bootstrap methods while maintaining statistical rigor.

IQ-TREE works with aligned sequences. If your sequences are unaligned, use MAFFT or Clustal Omega first to create a multiple sequence alignment. For faster approximate trees, consider FastTree.

How does IQ-TREE work?

Maximum likelihood estimation

Maximum likelihood phylogenetics finds the tree topology and branch lengths that maximize the probability of observing your sequence data under a given evolutionary model. For each tree, IQ-TREE calculates the likelihood LLL that the observed alignment arose from that tree:

ln⁡L=∑i=1nln⁡P(xi∣T,θ)\ln L = \sum_{i=1}^{n} \ln P(x_i | T, \theta)lnL=i=1∑n​lnP(xi​∣T,θ)

where xix_ixi​ is the pattern at site iii, TTT is the tree topology, and θ\thetaθ represents model parameters like substitution rates and branch lengths. IQ-TREE uses a stochastic perturbation algorithm that efficiently explores tree space by making strategic rearrangements guided by likelihood improvements.

ModelFinder

ModelFinder tests a comprehensive set of substitution models and selects the best one using information criteria. For each model MMM, it calculates:

BIC=−2ln⁡L+kln⁡n\text{BIC} = -2 \ln L + k \ln nBIC=−2lnL+klnn

where kkk is the number of free parameters and nnn is the alignment length. BIC penalizes complex models more heavily than AIC, reducing the risk of overfitting. ModelFinder supports 546 protein models and 286 DNA models, including rate heterogeneity options like gamma-distributed rates and FreeRate categories.

The automatic selection saves you from manually testing dozens of models. ModelFinder identifies not just the substitution matrix (like JTT or GTR) but also the optimal rate heterogeneity model and invariant site proportion.

Ultrafast bootstrap

Traditional bootstrap resampling requires rebuilding thousands of trees from resampled alignments, which is computationally expensive. UFBoot approximates the bootstrap distribution using a more efficient approach: it performs maximum likelihood tree search on fewer replicates while estimating bootstrap proportions from intermediate tree topologies encountered during the search.

We recommend 1000 bootstrap replicates for publication-quality results. Values ≥95% indicate strong support, 70-95% moderate support, and <70% weak support. UFBoot provides approximately unbiased estimates comparable to standard bootstrap but finishes in a fraction of the time.

Branch support alternatives

The SH-aLRT (Shimodaira-Hasegawa approximate likelihood ratio test) offers an alternative to bootstrap. It tests whether the likelihood of the best tree is significantly better than the second-best tree for each branch. SH-aLRT runs even faster than UFBoot and uses a different statistical framework, so using both can provide complementary confidence measures.

Input requirements

Your input must be a pre-aligned multiple sequence alignment with at least 3 sequences. IQ-TREE will fail if you provide unaligned sequences because maximum likelihood requires site-by-site comparisons across all sequences. Ultrafast bootstrap requires at least 4 aligned sequences; set bootstrap replicates to 0 for 3-sequence ML-only trees.

Supported formats include FASTA, PHYLIP, NEXUS, CLUSTAL, and MSF. FASTA is the most common choice for its simplicity.

Substitution model

  • default (auto ModelFinder): Uses IQ-TREE's default behavior, which automatically selects a best-fit model for the alignment.
  • Standard ModelFinder: Explicitly runs the standard TEST model search, similar to jModelTest or ProtTest.
  • ModelFinder: Runs the MF search with FreeRate heterogeneity candidates.
  • ModelFinder Plus: Extended model selection that includes additional model combinations and follows tree inference.
  • JTT, WAG, LG: Protein-specific substitution matrices. JTT works well for general protein data, WAG for nuclear proteins, and LG for diverse protein families.
  • GTR: General time reversible model for nucleotides. The most parameter-rich DNA model with six substitution rates and four base frequencies.
  • HKY, K2P: Simpler nucleotide models. HKY distinguishes transitions from transversions with unequal base frequencies. K2P assumes equal base frequencies.

Bootstrap options

  • Ultrafast bootstrap replicates: Number of UFBoot replicates to perform. Use at least 1000 when enabled. IQ-TREE 3.1.1 rejects nonzero counts below 1000. Ultrafast bootstrap requires at least 4 aligned sequences; set to 0 to skip it.
  • SH-aLRT replicates: Number of SH-aLRT tests. Common values are 1000 or 0 (disabled). When both UFBoot and SH-aLRT are enabled, you'll get two support values per branch, which some prefer for conservative interpretation.

Understanding the results

Tree visualization

IQ-TREE outputs a phylogenetic tree in Newick format, which displays branch relationships and support values. Branch lengths represent evolutionary distance—longer branches indicate more substitutions per site.

Support values appear at internal nodes. With UFBoot enabled, these represent the percentage of bootstrap replicates supporting that clade. Values ≥95% are considered strong evidence, 70-95% moderate, and <70% weak. Branches with weak support indicate uncertainty in the tree topology at those positions.

When ultrafast bootstrap is enabled, ProteinIQ also returns the main consensus tree (.contree) and split support file (.splits.nex) alongside the maximum-likelihood tree and the .iqtree report.

Model information

The results include the selected substitution model and its parameters. For example, GTR+F+I+G4 indicates:

  • GTR: General time reversible substitution matrix
  • +F: Empirical base/amino acid frequencies
  • +I: Proportion of invariant sites
  • +G4: Gamma-distributed rate heterogeneity with 4 categories

Statistical measures

  • Log-likelihood (lnL): The natural logarithm of the tree likelihood. More negative values indicate worse fit. You cannot compare lnL across different alignments, only across trees for the same data.
  • AIC/BIC: Akaike and Bayesian information criteria. Lower values indicate better model fit after penalizing for model complexity. BIC penalizes complexity more heavily than AIC.
  • Tree length: Sum of all branch lengths, representing total evolutionary change. Longer trees suggest more divergence among sequences.

When to use IQ-TREE

IQ-TREE excels when you need rigorous model selection and publication-quality results. The automatic ModelFinder testing ensures your tree is based on the most appropriate evolutionary model for your data.

For large alignments where speed matters more than model sophistication, FastTree provides approximate maximum likelihood trees much faster. FastTree uses simpler models but can handle datasets with tens of thousands of sequences.

For phylogenomic analyses with hundreds of genes, IQ-TREE's partition models can assign different evolutionary models to different alignment regions. This is important when combining genes with different evolutionary rates.

Best practices

Start with ModelFinder (Auto) unless you have strong prior knowledge about which model fits your data. Manual model selection rarely outperforms ModelFinder's systematic approach.

Run at least 1000 ultrafast bootstrap replicates when assessing branch support. To explore an alignment without resampling, set replicates to 0. Counts from 1 to 999 are rejected by this native version.

Check for outlier sequences before running IQ-TREE. Sequences with excessive gaps or unusual composition can distort tree topology. If bootstrap support is uniformly low, your alignment may be too divergent or contain paralogs rather than orthologs.

The alignment quality matters more than the phylogenetic method. Poorly aligned regions introduce noise that no tree-building algorithm can overcome. Consider using MAFFT with the L-INS-i algorithm for difficult-to-align sequences.

Table of contents

Related tools

Clustal Omega

Clustal Omega

Align multiple protein or nucleotide sequences and export FASTA, Clustal, or Phylip outputs.

FastTree

FastTree

Build phylogenetic trees from aligned protein or nucleotide sequences using approximate maximum-likelihood methods.

MAFFT

MAFFT

Align protein or nucleotide sequences with selectable accuracy and speed trade-offs.

MUSCLE5

MUSCLE5

Align multiple protein or nucleotide sequences with high-accuracy PPP refinement.

StringZilla v5

StringZilla v5

Hardware-accelerated edit distances and global or local sequence scores

USAlign

USAlign

Universal structure alignment for proteins, RNA, and DNA molecules

MMseqs2

MMseqs2

Search and cluster protein or nucleotide sequences for homology discovery at large scale.

MUMmer4

MUMmer4

Align and compare whole genomes to detect SNPs, indels, and structural variants.

RNAalifold

RNAalifold

Predict consensus RNA secondary structures from sequence alignments.

Salmon

Salmon

Transcript-level RNA-seq quantification with Salmon selective alignment