Fork me on GitHub

Phylogenetic inference with q2-phylogeny

Note

This tutorial assumes, you’ve read through the QIIME 2 Overview documentation and have at least worked through some of the other Tutorials.

Inferring phylogenies

Several downstream diversity metrics, available within QIIME 2, require that a phylogenetic tree be constructed using the Operational Taxonomic Units (OTUs) or Amplicon Sequence Variants (ASVs) being investigated.

But how do we proceed to construct a phylogeny from our sequence data?

Well, there are two phylogeny-based approaches we can use. Deciding upon which to use is largely dependent on your study questions:

1. A reference-based fragment insertion approach. Which, is likely the ideal choice. Especially, if your reference phylogeny (and associated representative sequences) encompass neighboring relatives of which your sequences can be reliably inserted. Any sequences that do not match well enough to the reference are not inserted. For example, this approach may not work well if your data contain sequences that are not well represented within your reference phylogeny (e.g. missing clades, etc.). For more information, check out these great fragment insertion examples.

2. A de novo approach. Marker genes that can be globally aligned across divergent taxa, are usually amenable to sequence alignment and phylogenetic investigation through this approach. Be mindful of the length of your sequences when constructing a de novo phylogeny, short reads many not have enough phylogenetic information to capture a meaningful phylogeny. This community tutorial will focus on the de novo approaches.

Here, you will learn how to make use of de novo phylogenetic approaches to:

  1. generate a sequence alignment within QIIME 2

  2. mask the alignment if needed

  3. construct a phylogenetic tree

  4. root the phylogenetic tree

If you would like to substitute any of the steps outlined here by making use of tools external to QIIME 2, please see the import, export, and filtering documentation where appropriate.

Sequence Alignment

Prior to constructing a phylogeny we must generate a multiple sequence alignment (MSA). When constructing a MSA we are making a statement about the putative homology of the aligned residues (columns of the MSA) by virtue of their sequence similarity.

The number of algorithms to construct a MSA are legion. We will make use of MAFFT (Multiple Alignment using Fast Fourier Transform)) via the q2-alignment plugin. For more information checkout the MAFFT paper.

Let’s start by creating a directory to work in:

mkdir qiime2-phylogeny-tutorial
cd qiime2-phylogeny-tutorial

Next, download the data:

Please select a download option that is most appropriate for your environment:
wget \
  -O "rep-seqs.qza" \
  "https://data.qiime2.org/2021.4/tutorials/phylogeny/rep-seqs.qza"
curl -sL \
  "https://data.qiime2.org/2021.4/tutorials/phylogeny/rep-seqs.qza" > \
  "rep-seqs.qza"

Run MAFFT

qiime alignment mafft \
  --i-sequences rep-seqs.qza \
  --o-alignment aligned-rep-seqs.qza

Output artifacts:

Reducing alignment ambiguity: masking and reference alignments

Why mask an alignment?

Masking helps to eliminate alignment columns that are phylogenetically uninformative or misleading before phylogenetic analysis. Much of the time alignment errors can introduce noise and confound phylogenetic inference. It is common practice to mask (remove) these ambiguously aligned regions prior to performing phylogenetic inference. In particular, David Lane’s (1991) chapter 16S/23S rRNA sequencing proposed masking SSU data prior to phylogenetic analysis. However, knowing how to deal with ambiguously aligned regions and when to apply masks largely depends on the marker genes being analyzed and the question being asked of the data.

Note

Keep in mind that this is still an active area of discussion, as highlighted by the following non-exhaustive list of articles: Wu et al. 2012, Ashkenazy et al. 2018, Schloss 2010, Tan et al. 2015, Rajan 2015.

How to mask alignment.

For our purposes, we’ll assume that we have ambiguously aligned columns in the MAFFT alignment we produced above. The default settings for the --p-min-conservation of the alignment mask approximates the Lane mask filtering of QIIME 1. Keep an eye out for updates to the alignment plugin.

qiime alignment mask \
  --i-alignment aligned-rep-seqs.qza \
  --o-masked-alignment masked-aligned-rep-seqs.qza

Output artifacts:

Reference based alignments

There are a variety of tools such as PyNAST) (using NAST), Infernal, and SINA, etc., that attempt to reduce the amount of ambiguously aligned regions by using curated reference alignments (e.g. SILVA. Reference alignments are particularly powerful for rRNA gene sequence data, as knowledge of secondary structure is incorporated into the curation process, thus increasing alignment quality. For a more in-depth and eloquent overview of reference-based alignment approaches, check out the great SINA community tutorial).

Note

Alignments constructed using reference based alignment approaches can be masked too, just like the above MAFFT example. Also, the reference alignment approach we are discussing here is distinct from the reference phylogeny approach (i.e. q2-fragment-insertion) we mentioned earlier. That is, we are not inserting our data into an existing tree, but simply trying to create a more robust alignment for making a better de novo phylogeny.

Construct a phylogeny

As with MSA algorithms, phylogenetic inference tools are also legion. Fortunately, there are many great resources to learn about phylogentics. Below are just a few introductory resources to get you started:

  1. Phylogeny for the faint of heart - a tutorial

  2. Molecular phylogenetics - principles and practice

  3. Phylogenetics - An Introduction

There are several methods / pipelines available through the q2-phylogeny plugin of :qiime2:. These are based on the following tools:

  1. FastTree

  2. RAxML

  3. IQ-TREE

Methods

fasttree

FastTree is able to construct phylogenies from large sequence alignments quite rapidly. It does this by using the using a CAT-like rate category approximation, which is also available through RAxML (discussed below). Check out the FastTree online manual for more information.

qiime phylogeny fasttree \
  --i-alignment masked-aligned-rep-seqs.qza \
  --o-tree fasttree-tree.qza

Output artifacts:

Tip

For an easy and direct way to view your tree.qza files, upload them to iTOL. Here, you can interactively view and manipulate your phylogeny. Even better, while viewing the tree topology in “Normal mode”, you can drag and drop your associated alignment.qza (the one you used to build the phylogeny) or a relevent taxonomy.qza file onto the iTOL tree visualization. This will allow you to directly view the sequence alignment or taxonomy alongside the phylogeny. 🕶️

raxml

Like fasttree, raxml will perform a single phylogentic inference and return a tree. Note, the default model for raxml is --p-substitution-model GTRGAMMA. If you’d like to construct a tree using the CAT model like fasttree, simply replace GTRGAMMA with GTRCAT as shown below:

qiime phylogeny raxml \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-substitution-model GTRCAT \
  --o-tree raxml-cat-tree.qza \
  --verbose

stdout:

Warning, you specified a working directory via "-w"
Keep in mind that RAxML only accepts absolute path names, not relative ones!

RAxML can't, parse the alignment file as phylip file 
it will now try to parse it as FASTA file



Using BFGS method to optimize GTR rate parameters, to disable this specify "--no-bfgs" 



This is RAxML version 8.2.12 released by Alexandros Stamatakis on May 2018.

With greatly appreciated code contributions by:
Andre Aberer      (HITS)
Simon Berger      (HITS)
Alexey Kozlov     (HITS)
Kassian Kobert    (HITS)
David Dao         (KIT and HITS)
Sarah Lutteropp   (KIT and HITS)
Nick Pattengale   (Sandia)
Wayne Pfeiffer    (SDSC)
Akifumi S. Tanabe (NRIFS)
Charlie Taylor    (UF)


Alignment has 157 distinct alignment patterns

Proportion of gaps and completely undetermined characters in this alignment: 39.77%

RAxML rapid hill-climbing mode

Using 1 distinct models/data partitions with joint branch length optimization


Executing 1 inferences on the original alignment using 1 distinct randomized MP trees

All free model parameters will be estimated by RAxML
ML estimate of 25 per site rate categories

Likelihood of final tree will be evaluated and optimized under GAMMA

GAMMA Model parameters will be estimated up to an accuracy of 0.1000000000 Log Likelihood units

Partition: 0
Alignment Patterns: 157
Name: No Name Provided
DataType: DNA
Substitution Matrix: GTR




RAxML was called as follows:

raxmlHPC -m GTRCAT -p 1600 -N 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-921bfbar/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -w /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp9tsq3d62 -n q2 


Partition: 0 with name: No Name Provided
Base frequencies: 0.243 0.182 0.319 0.256 

Inference[0]: Time 0.577619 CAT-based likelihood -1258.027138, best rearrangement setting 5


Conducting final model optimizations on all 1 trees under GAMMA-based models ....

Inference[0] final GAMMA-based Likelihood: -1387.563631 tree written to file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp9tsq3d62/RAxML_result.q2


Starting final GAMMA-based thorough Optimization on tree 0 likelihood -1387.563631 .... 

Final GAMMA-based Score of best tree -1387.213632

Program execution info written to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp9tsq3d62/RAxML_info.q2
Best-scoring ML tree written to: /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp9tsq3d62/RAxML_bestTree.q2

Overall execution time: 1.186414 secs or 0.000330 hours or 0.000014 days

Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: raxmlHPC -m GTRCAT -p 1600 -N 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-921bfbar/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -w /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp9tsq3d62 -n q2

Saved Phylogeny[Unrooted] to: raxml-cat-tree.qza

Output artifacts:

Perform multiple searches using raxml

If you’d like to perform a more thorough search of “tree space” you can instruct raxml to perform multiple independent searches on the full alignment by using --p-n-searches 5. Once these 5 independent searches are completed, only the single best scoring tree will be returned. Note, we are not bootstrapping here, we’ll do that in a later example. Let’s set --p-substitution-model GTRCAT. Finally, let’s also manually set a seed via --p-seed. By setting our seed, we allow other users the ability to reproduce our phylogeny. That is, anyone using the same sequence alignment and substitution model, will generate the same tree as long as they set the same seed value. Although, --p-seed is not a required argument, it is generally a good idea to set this value.

qiime phylogeny raxml \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-substitution-model GTRCAT \
  --p-seed 1723 \
  --p-n-searches 5 \
  --o-tree raxml-cat-searches-tree.qza \
  --verbose

stdout:

Warning, you specified a working directory via "-w"
Keep in mind that RAxML only accepts absolute path names, not relative ones!

RAxML can't, parse the alignment file as phylip file 
it will now try to parse it as FASTA file



Using BFGS method to optimize GTR rate parameters, to disable this specify "--no-bfgs" 



This is RAxML version 8.2.12 released by Alexandros Stamatakis on May 2018.

With greatly appreciated code contributions by:
Andre Aberer      (HITS)
Simon Berger      (HITS)
Alexey Kozlov     (HITS)
Kassian Kobert    (HITS)
David Dao         (KIT and HITS)
Sarah Lutteropp   (KIT and HITS)
Nick Pattengale   (Sandia)
Wayne Pfeiffer    (SDSC)
Akifumi S. Tanabe (NRIFS)
Charlie Taylor    (UF)


Alignment has 157 distinct alignment patterns

Proportion of gaps and completely undetermined characters in this alignment: 39.77%

RAxML rapid hill-climbing mode

Using 1 distinct models/data partitions with joint branch length optimization


Executing 5 inferences on the original alignment using 5 distinct randomized MP trees

All free model parameters will be estimated by RAxML
ML estimate of 25 per site rate categories

Likelihood of final tree will be evaluated and optimized under GAMMA

GAMMA Model parameters will be estimated up to an accuracy of 0.1000000000 Log Likelihood units

Partition: 0
Alignment Patterns: 157
Name: No Name Provided
DataType: DNA
Substitution Matrix: GTR




RAxML was called as follows:

raxmlHPC -m GTRCAT -p 1723 -N 5 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-i84iwvcl/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -w /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij -n q2 


Partition: 0 with name: No Name Provided
Base frequencies: 0.243 0.182 0.319 0.256 

Inference[0]: Time 0.591104 CAT-based likelihood -1238.242991, best rearrangement setting 5
Inference[1]: Time 0.495106 CAT-based likelihood -1249.502284, best rearrangement setting 5
Inference[2]: Time 0.502167 CAT-based likelihood -1242.978035, best rearrangement setting 5
Inference[3]: Time 0.643842 CAT-based likelihood -1243.159855, best rearrangement setting 5
Inference[4]: Time 0.482026 CAT-based likelihood -1261.321621, best rearrangement setting 5


Conducting final model optimizations on all 5 trees under GAMMA-based models ....

Inference[0] final GAMMA-based Likelihood: -1388.324037 tree written to file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij/RAxML_result.q2.RUN.0
Inference[1] final GAMMA-based Likelihood: -1392.813982 tree written to file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij/RAxML_result.q2.RUN.1
Inference[2] final GAMMA-based Likelihood: -1388.073642 tree written to file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij/RAxML_result.q2.RUN.2
Inference[3] final GAMMA-based Likelihood: -1387.945266 tree written to file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij/RAxML_result.q2.RUN.3
Inference[4] final GAMMA-based Likelihood: -1387.557031 tree written to file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij/RAxML_result.q2.RUN.4


Starting final GAMMA-based thorough Optimization on tree 4 likelihood -1387.557031 .... 

Final GAMMA-based Score of best tree -1387.385075

Program execution info written to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij/RAxML_info.q2
Best-scoring ML tree written to: /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij/RAxML_bestTree.q2

Overall execution time: 3.437533 secs or 0.000955 hours or 0.000040 days

Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: raxmlHPC -m GTRCAT -p 1723 -N 5 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-i84iwvcl/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -w /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpylcnfsij -n q2

Saved Phylogeny[Unrooted] to: raxml-cat-searches-tree.qza

Output artifacts:

raxml-rapid-bootstrap

In phylogenetics, it is good practice to check how well the splits / bipartitions in your phylogeny are supported. Often one is interested in which clades are robustly separated from other clades in the phylogeny. One way, of doing this is via bootstrapping (See the Bootstrapping section of the first introductory link above). In QIIME 2, we’ve provided access to the RAxML rapid bootstrap feature. The only difference between this command and the previous are the additional flags --p-bootstrap-replicates and --p-rapid-bootstrap-seed. It is quite common to perform anywhere from 100 - 1000 bootstrap replicates. The --p-rapid-bootstrap-seed works very much like the --p-seed argument from above except that it allows anyone to reproduce the bootstrapping process and the associated supports for your splits.

As per the RAxML online documentation and the RAxML manual, the rapid bootstrapping command that we will execute below will do the following:

  1. Bootstrap the input alignment 100 times and perform a Maximum Likelihood (ML) search on each.

  2. Find best scoring ML tree through multiple independent searches using the original input alignment. The number of independent searches is determined by the number of bootstrap replicates set in the 1st step. That is, your search becomes more thorough with increasing bootstrap replicates. The ML optimization of RAxML uses every 5th bootstrap tree as the starting tree for an ML search on the original alignment.

  3. Map the bipartitions (bootstrap supports, 1st step) onto the best scoring ML tree (2nd step).

qiime phylogeny raxml-rapid-bootstrap \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-seed 1723 \
  --p-rapid-bootstrap-seed 9384 \
  --p-bootstrap-replicates 100 \
  --p-substitution-model GTRCAT \
  --o-tree raxml-cat-bootstrap-tree.qza \
  --verbose

stdout:

Warning, you specified a working directory via "-w"
Keep in mind that RAxML only accepts absolute path names, not relative ones!

RAxML can't, parse the alignment file as phylip file 
it will now try to parse it as FASTA file



Using BFGS method to optimize GTR rate parameters, to disable this specify "--no-bfgs" 



This is RAxML version 8.2.12 released by Alexandros Stamatakis on May 2018.

With greatly appreciated code contributions by:
Andre Aberer      (HITS)
Simon Berger      (HITS)
Alexey Kozlov     (HITS)
Kassian Kobert    (HITS)
David Dao         (KIT and HITS)
Sarah Lutteropp   (KIT and HITS)
Nick Pattengale   (Sandia)
Wayne Pfeiffer    (SDSC)
Akifumi S. Tanabe (NRIFS)
Charlie Taylor    (UF)


Alignment has 157 distinct alignment patterns

Proportion of gaps and completely undetermined characters in this alignment: 39.77%

RAxML rapid bootstrapping and subsequent ML search

Using 1 distinct models/data partitions with joint branch length optimization



Executing 100 rapid bootstrap inferences and thereafter a thorough ML search 

All free model parameters will be estimated by RAxML
ML estimate of 25 per site rate categories

Likelihood of final tree will be evaluated and optimized under GAMMA

GAMMA Model parameters will be estimated up to an accuracy of 0.1000000000 Log Likelihood units

Partition: 0
Alignment Patterns: 157
Name: No Name Provided
DataType: DNA
Substitution Matrix: GTR




RAxML was called as follows:

raxmlHPC -f a -m GTRCAT -p 1723 -x 9384 -N 100 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-2q4494jr/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -w /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij -n q2bootstrap 



Time for BS model parameter optimization 0.052109
Bootstrap[0]: Time 0.167928 seconds, bootstrap likelihood -1199.758796, best rearrangement setting 12
Bootstrap[1]: Time 0.114191 seconds, bootstrap likelihood -1344.229251, best rearrangement setting 6
Bootstrap[2]: Time 0.105394 seconds, bootstrap likelihood -1295.343000, best rearrangement setting 8
Bootstrap[3]: Time 0.094859 seconds, bootstrap likelihood -1273.768320, best rearrangement setting 8
Bootstrap[4]: Time 0.103246 seconds, bootstrap likelihood -1253.402952, best rearrangement setting 6
Bootstrap[5]: Time 0.107957 seconds, bootstrap likelihood -1260.866113, best rearrangement setting 10
Bootstrap[6]: Time 0.109755 seconds, bootstrap likelihood -1293.636299, best rearrangement setting 14
Bootstrap[7]: Time 0.100284 seconds, bootstrap likelihood -1227.178693, best rearrangement setting 6
Bootstrap[8]: Time 0.107035 seconds, bootstrap likelihood -1321.820787, best rearrangement setting 13
Bootstrap[9]: Time 0.115880 seconds, bootstrap likelihood -1147.233446, best rearrangement setting 6
Bootstrap[10]: Time 0.083615 seconds, bootstrap likelihood -1220.766493, best rearrangement setting 13
Bootstrap[11]: Time 0.117217 seconds, bootstrap likelihood -1200.006355, best rearrangement setting 8
Bootstrap[12]: Time 0.125760 seconds, bootstrap likelihood -1346.392834, best rearrangement setting 14
Bootstrap[13]: Time 0.105716 seconds, bootstrap likelihood -1301.111096, best rearrangement setting 14
Bootstrap[14]: Time 0.112322 seconds, bootstrap likelihood -1262.253559, best rearrangement setting 11
Bootstrap[15]: Time 0.111179 seconds, bootstrap likelihood -1215.017551, best rearrangement setting 14
Bootstrap[16]: Time 0.106467 seconds, bootstrap likelihood -1238.832009, best rearrangement setting 7
Bootstrap[17]: Time 0.102691 seconds, bootstrap likelihood -1393.989732, best rearrangement setting 12
Bootstrap[18]: Time 0.102049 seconds, bootstrap likelihood -1173.921002, best rearrangement setting 15
Bootstrap[19]: Time 0.106148 seconds, bootstrap likelihood -1185.726976, best rearrangement setting 11
Bootstrap[20]: Time 0.095724 seconds, bootstrap likelihood -1158.491940, best rearrangement setting 6
Bootstrap[21]: Time 0.091981 seconds, bootstrap likelihood -1154.664272, best rearrangement setting 11
Bootstrap[22]: Time 0.102317 seconds, bootstrap likelihood -1244.159837, best rearrangement setting 10
Bootstrap[23]: Time 0.122549 seconds, bootstrap likelihood -1211.171036, best rearrangement setting 15
Bootstrap[24]: Time 0.104097 seconds, bootstrap likelihood -1261.440677, best rearrangement setting 12
Bootstrap[25]: Time 0.104620 seconds, bootstrap likelihood -1331.836715, best rearrangement setting 15
Bootstrap[26]: Time 0.107095 seconds, bootstrap likelihood -1129.144509, best rearrangement setting 5
Bootstrap[27]: Time 0.131486 seconds, bootstrap likelihood -1226.624056, best rearrangement setting 7
Bootstrap[28]: Time 0.128974 seconds, bootstrap likelihood -1221.046176, best rearrangement setting 12
Bootstrap[29]: Time 0.086826 seconds, bootstrap likelihood -1211.791204, best rearrangement setting 14
Bootstrap[30]: Time 0.109417 seconds, bootstrap likelihood -1389.442380, best rearrangement setting 5
Bootstrap[31]: Time 0.110264 seconds, bootstrap likelihood -1303.638592, best rearrangement setting 12
Bootstrap[32]: Time 0.117208 seconds, bootstrap likelihood -1172.859456, best rearrangement setting 12
Bootstrap[33]: Time 0.103585 seconds, bootstrap likelihood -1244.617135, best rearrangement setting 9
Bootstrap[34]: Time 0.099437 seconds, bootstrap likelihood -1211.871717, best rearrangement setting 15
Bootstrap[35]: Time 0.122903 seconds, bootstrap likelihood -1299.862912, best rearrangement setting 5
Bootstrap[36]: Time 0.095621 seconds, bootstrap likelihood -1141.967505, best rearrangement setting 5
Bootstrap[37]: Time 0.119088 seconds, bootstrap likelihood -1283.923198, best rearrangement setting 12
Bootstrap[38]: Time 0.095883 seconds, bootstrap likelihood -1304.250946, best rearrangement setting 5
Bootstrap[39]: Time 0.091970 seconds, bootstrap likelihood -1407.084376, best rearrangement setting 15
Bootstrap[40]: Time 0.107999 seconds, bootstrap likelihood -1277.946299, best rearrangement setting 13
Bootstrap[41]: Time 0.107406 seconds, bootstrap likelihood -1279.006200, best rearrangement setting 7
Bootstrap[42]: Time 0.102702 seconds, bootstrap likelihood -1160.274606, best rearrangement setting 6
Bootstrap[43]: Time 0.126289 seconds, bootstrap likelihood -1216.079259, best rearrangement setting 14
Bootstrap[44]: Time 0.096316 seconds, bootstrap likelihood -1382.278311, best rearrangement setting 8
Bootstrap[45]: Time 0.110305 seconds, bootstrap likelihood -1099.004439, best rearrangement setting 11
Bootstrap[46]: Time 0.088627 seconds, bootstrap likelihood -1296.527478, best rearrangement setting 8
Bootstrap[47]: Time 0.129439 seconds, bootstrap likelihood -1291.322658, best rearrangement setting 9
Bootstrap[48]: Time 0.085980 seconds, bootstrap likelihood -1161.908080, best rearrangement setting 6
Bootstrap[49]: Time 0.114630 seconds, bootstrap likelihood -1257.348428, best rearrangement setting 13
Bootstrap[50]: Time 0.132718 seconds, bootstrap likelihood -1309.422533, best rearrangement setting 13
Bootstrap[51]: Time 0.098386 seconds, bootstrap likelihood -1197.633097, best rearrangement setting 11
Bootstrap[52]: Time 0.109749 seconds, bootstrap likelihood -1347.123005, best rearrangement setting 8
Bootstrap[53]: Time 0.093822 seconds, bootstrap likelihood -1234.934890, best rearrangement setting 14
Bootstrap[54]: Time 0.112427 seconds, bootstrap likelihood -1227.092434, best rearrangement setting 6
Bootstrap[55]: Time 0.116096 seconds, bootstrap likelihood -1280.635747, best rearrangement setting 7
Bootstrap[56]: Time 0.097224 seconds, bootstrap likelihood -1225.911449, best rearrangement setting 6
Bootstrap[57]: Time 0.087497 seconds, bootstrap likelihood -1236.213347, best rearrangement setting 11
Bootstrap[58]: Time 0.133145 seconds, bootstrap likelihood -1393.245723, best rearrangement setting 14
Bootstrap[59]: Time 0.104524 seconds, bootstrap likelihood -1212.039371, best rearrangement setting 6
Bootstrap[60]: Time 0.092950 seconds, bootstrap likelihood -1248.692011, best rearrangement setting 10
Bootstrap[61]: Time 0.106336 seconds, bootstrap likelihood -1172.820979, best rearrangement setting 13
Bootstrap[62]: Time 0.123431 seconds, bootstrap likelihood -1126.745788, best rearrangement setting 14
Bootstrap[63]: Time 0.097503 seconds, bootstrap likelihood -1267.434444, best rearrangement setting 12
Bootstrap[64]: Time 0.094707 seconds, bootstrap likelihood -1340.680748, best rearrangement setting 5
Bootstrap[65]: Time 0.097701 seconds, bootstrap likelihood -1072.671059, best rearrangement setting 5
Bootstrap[66]: Time 0.113464 seconds, bootstrap likelihood -1234.294838, best rearrangement setting 8
Bootstrap[67]: Time 0.111812 seconds, bootstrap likelihood -1109.249439, best rearrangement setting 15
Bootstrap[68]: Time 0.090821 seconds, bootstrap likelihood -1314.493588, best rearrangement setting 8
Bootstrap[69]: Time 0.094078 seconds, bootstrap likelihood -1173.850035, best rearrangement setting 13
Bootstrap[70]: Time 0.107474 seconds, bootstrap likelihood -1231.066465, best rearrangement setting 10
Bootstrap[71]: Time 0.102196 seconds, bootstrap likelihood -1146.861379, best rearrangement setting 9
Bootstrap[72]: Time 0.088947 seconds, bootstrap likelihood -1148.753369, best rearrangement setting 8
Bootstrap[73]: Time 0.099033 seconds, bootstrap likelihood -1333.374056, best rearrangement setting 9
Bootstrap[74]: Time 0.089307 seconds, bootstrap likelihood -1259.382378, best rearrangement setting 5
Bootstrap[75]: Time 0.096396 seconds, bootstrap likelihood -1319.944496, best rearrangement setting 6
Bootstrap[76]: Time 0.107631 seconds, bootstrap likelihood -1309.042165, best rearrangement setting 14
Bootstrap[77]: Time 0.132338 seconds, bootstrap likelihood -1232.061289, best rearrangement setting 8
Bootstrap[78]: Time 0.107499 seconds, bootstrap likelihood -1261.333984, best rearrangement setting 9
Bootstrap[79]: Time 0.111659 seconds, bootstrap likelihood -1194.644341, best rearrangement setting 13
Bootstrap[80]: Time 0.099068 seconds, bootstrap likelihood -1214.037389, best rearrangement setting 9
Bootstrap[81]: Time 0.106609 seconds, bootstrap likelihood -1224.527657, best rearrangement setting 8
Bootstrap[82]: Time 0.125919 seconds, bootstrap likelihood -1241.464826, best rearrangement setting 11
Bootstrap[83]: Time 0.097594 seconds, bootstrap likelihood -1230.730558, best rearrangement setting 6
Bootstrap[84]: Time 0.102620 seconds, bootstrap likelihood -1219.034592, best rearrangement setting 10
Bootstrap[85]: Time 0.108160 seconds, bootstrap likelihood -1280.071994, best rearrangement setting 8
Bootstrap[86]: Time 0.095874 seconds, bootstrap likelihood -1444.747777, best rearrangement setting 9
Bootstrap[87]: Time 0.092958 seconds, bootstrap likelihood -1245.890035, best rearrangement setting 14
Bootstrap[88]: Time 0.107344 seconds, bootstrap likelihood -1287.832766, best rearrangement setting 7
Bootstrap[89]: Time 0.100641 seconds, bootstrap likelihood -1325.245976, best rearrangement setting 5
Bootstrap[90]: Time 0.115706 seconds, bootstrap likelihood -1227.883697, best rearrangement setting 5
Bootstrap[91]: Time 0.109335 seconds, bootstrap likelihood -1273.489392, best rearrangement setting 8
Bootstrap[92]: Time 0.045331 seconds, bootstrap likelihood -1234.725870, best rearrangement setting 7
Bootstrap[93]: Time 0.116885 seconds, bootstrap likelihood -1235.733064, best rearrangement setting 11
Bootstrap[94]: Time 0.095949 seconds, bootstrap likelihood -1204.319488, best rearrangement setting 15
Bootstrap[95]: Time 0.093471 seconds, bootstrap likelihood -1183.328582, best rearrangement setting 11
Bootstrap[96]: Time 0.106676 seconds, bootstrap likelihood -1196.298898, best rearrangement setting 13
Bootstrap[97]: Time 0.116932 seconds, bootstrap likelihood -1339.251746, best rearrangement setting 12
Bootstrap[98]: Time 0.044698 seconds, bootstrap likelihood -1404.363552, best rearrangement setting 7
Bootstrap[99]: Time 0.060173 seconds, bootstrap likelihood -1270.157811, best rearrangement setting 7


Overall Time for 100 Rapid Bootstraps 10.515323 seconds
Average Time per Rapid Bootstrap 0.105153 seconds

Starting ML Search ...

Fast ML optimization finished

Fast ML search Time: 4.165015 seconds

Slow ML Search 0 Likelihood: -1387.994678
Slow ML Search 1 Likelihood: -1387.994678
Slow ML Search 2 Likelihood: -1387.994676
Slow ML Search 3 Likelihood: -1387.994650
Slow ML Search 4 Likelihood: -1387.994685
Slow ML Search 5 Likelihood: -1388.092954
Slow ML Search 6 Likelihood: -1388.182551
Slow ML Search 7 Likelihood: -1388.182563
Slow ML Search 8 Likelihood: -1388.182547
Slow ML Search 9 Likelihood: -1387.994723
Slow ML optimization finished

Slow ML search Time: 2.148652 seconds
Thorough ML search Time: 0.557168 seconds

Final ML Optimization Likelihood: -1387.204993

Model Information:

Model Parameters of Partition 0, Name: No Name Provided, Type of Data: DNA
alpha: 1.227800
Tree-Length: 7.823400
rate A <-> C: 0.332564
rate A <-> G: 2.312784
rate A <-> T: 2.215466
rate C <-> G: 1.243321
rate C <-> T: 3.278770
rate G <-> T: 1.000000

freq pi(A): 0.243216
freq pi(C): 0.181967
freq pi(G): 0.319196
freq pi(T): 0.255621


ML search took 6.876888 secs or 0.001910 hours

Combined Bootstrap and ML search took 17.392503 secs or 0.004831 hours

Drawing Bootstrap Support Values on best-scoring ML tree ...



Found 1 tree in File /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij/RAxML_bestTree.q2bootstrap



Found 1 tree in File /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij/RAxML_bestTree.q2bootstrap

Program execution info written to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij/RAxML_info.q2bootstrap
All 100 bootstrapped trees written to: /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij/RAxML_bootstrap.q2bootstrap

Best-scoring ML tree written to: /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij/RAxML_bestTree.q2bootstrap

Best-scoring ML tree with support values written to: /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij/RAxML_bipartitions.q2bootstrap

Best-scoring ML tree with support values as branch labels written to: /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij/RAxML_bipartitionsBranchLabels.q2bootstrap

Overall execution time for full ML analysis: 17.405984 secs or 0.004835 hours or 0.000201 days

Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: raxmlHPC -f a -m GTRCAT -p 1723 -x 9384 -N 100 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-2q4494jr/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -w /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy6fp84ij -n q2bootstrap

Saved Phylogeny[Unrooted] to: raxml-cat-bootstrap-tree.qza

Output artifacts:

Tip

Optimizing RAxML Run Time. You may gave noticed that we haven’t added the flag --p-raxml-version to the RAxML methods. This parameter provides a means to access versions of RAxML that have optimized vector instructions for various modern x86 processor architectures. Paraphrased from the RAxML manual and help documentation: Firstly, most recent processors will support SSE3 vector instructions (i.e. will likely support the faster AVX2 vector instructions). Secondly, these instructions will substantially accelerate the likelihood and parsimony computations. In general, SSE3 versions will run approximately 40% faster than the standard version. The AVX2 version will run 10-30% faster than the SSE3 version. Additionally, keep in mind that using more cores / threads will not necessarily decrease run time. The RAxML manual suggests using 1 core per ~500 DNA alignment patterns. Alignment pattern information is usually visible on screen, when the --verbose option is used. Additionally, try using a rate category (CAT model; via --p-substitution-model), which results in equally good trees as the GAMMA models and is approximately 4 times faster. See the CAT paper. The CAT approximation is also Ideal for alignments containing 10,000 or more taxa, and is very much similar the CAT-like model of FastTree2.

iqtree

Similar to the raxml and raxml-rapid-bootstrap methods above, we provide similar functionality for IQ-TREE: iqtree and iqtree-ultrafast-bootstrap. IQ-TREE is unique compared to the fastree and raxml options, in that it provides access to 286 models of nucleotide substitution! IQ-TREE can also determine which of these models best fits your dataset prior to constructing your tree via its built-in ModelFinder algorithm. This is the default in QIIME 2, but do not worry, you can set any one of the 286 models of nucleotide substitution via the --p-substitution-model flag, e.g. you can set the model as HKY+I+G instead of the default MFP (a basic short-hand for: “build a phylogeny after determining the best fit model as determined by ModelFinder”). Keep in mind the additional computational time required for model testing via ModelFinder.

The simplest way to run the iqtree command with default settings and automatic model selection (MFP) is like so:

qiime phylogeny iqtree \
  --i-alignment masked-aligned-rep-seqs.qza \
  --o-tree iqt-tree.qza \
  --verbose

stdout:

Plugin warning from phylogeny:

iqtree is deprecated and will be removed in a future version of this plugin.
IQ-TREE multicore version 2.1.2 COVID-edition for Mac OS X 64-bit built Mar 30 2021
Developed by Bui Quang Minh, James Barbetti, Nguyen Lam Tung,
Olga Chernomor, Heiko Schmidt, Dominik Schrempf, Michael Woodhams.

Host:    ghost.mggen.nau.edu (AVX, 16 GB RAM)
Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-l6815hga/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m MFP -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpk91txu8p/q2iqtree -nt 1
Seed:    52848 (Using SPRNG - Scalable Parallel Random Number Generator)
Time:    Wed Apr 21 15:44:04 2021
Kernel:  AVX - 1 threads (8 CPU cores detected)

HINT: Use -nt option to specify number of threads because your CPU has 8 cores!
HINT: -nt AUTO will automatically determine the best number of threads to use.

Reading alignment file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-l6815hga/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta ... Fasta format detected
Alignment most likely contains DNA/RNA sequences
Alignment has 20 sequences with 214 columns, 157 distinct patterns
104 parsimony-informative, 33 singleton sites, 77 constant sites
                                          Gap/Ambiguity  Composition  p-value
   1  e84fcf85a6a4065231dcf343bb862f1cb32abae6   40.65%    passed     90.91%
   2  5525fb6dab7b6577960147574465990c6df070ad   42.99%    passed     99.80%
   3  eb3564a35320b53cef22a77288838c7446357327   42.99%    passed     25.49%
   4  418f1d469f08c99976b313028cf6d3f18f61dd55   43.93%    passed     71.86%
   5  2e3b2c075901640c4de739473f9246385430b1ed   31.31%    passed     90.76%
   6  0469f8d819bd45c7638d1c8b0895270a05f34267   38.79%    passed     92.82%
   7  d162ed685007f5adede58f14aece31dfa1b60c18   40.65%    passed     97.17%
   8  1d45b2bce36cd995c5dcb755babf512e612ce8b9   41.59%    passed     39.04%
   9  5aba6bd9debc23ded7041ffdcfe5d68a427e8ce8   31.31%    passed     87.21%
  10  206656bec2abdbc4aee37a661ef5f4a62b5dd6ae   42.99%    passed     85.00%
  11  606c23e79bb730ad74e3c6efd72004c36674c17a   47.20%    passed     87.78%
  12  682e91d7e510ab134d0625234ad224f647c14eb0   41.59%    passed     31.01%
  13  6a36152105590b1eb095b9503e8f1f226fc73e43   39.25%    passed     86.29%
  14  6ca685c39a33bfbcb3123129e7af88d573df7d6f   42.06%    failed      0.02%
  15  8a1c44eb462ed58b21f3fdd72dd22bb657db2980   31.78%    passed     54.40%
  16  9b220cae8d375ea38b8b481cb95949cda8722fcb   36.92%    passed     88.78%
  17  aa4698d2e2b1fa71d08e2934a923aad7374a18f6   37.85%    passed     90.52%
  18  b31aa3f04bc9d5e2498d45cf1983dfaf09faa258   31.78%    passed     72.69%
  19  d44b129a6181f052198bda3813f0802a91612441   41.59%    passed     41.69%
  20  ed1acad8a98e8579a44370733533ad7d3fed8006   48.13%    passed     58.15%
****  TOTAL                                      39.77%  1 sequences failed composition chi2 test (p-value<5%; df=3)


Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds
Perform fast likelihood tree search using GTR+I+G model...
Estimate model parameters (epsilon = 5.000)
Perform nearest neighbor interchange...
Estimate model parameters (epsilon = 1.000)
1. Initial log-likelihood: -1389.605
Optimal log-likelihood: -1388.793
Rate parameters:  A-C: 0.37543  A-G: 2.37167  A-T: 2.15334  C-G: 1.24271  C-T: 3.32365  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.034
Gamma shape alpha: 1.400
Parameters optimization took 1 rounds (0.006 sec)
Time for fast ML tree search: 0.067 seconds

NOTE: ModelFinder requires 1 MB RAM!
ModelFinder will test up to 286 DNA models (sample size: 214) ...
 No. Model         -LnL         df  AIC          AICc         BIC
  1  GTR+F         1402.600     45  2895.200     2919.843     3046.669
  2  GTR+F+I       1401.121     46  2894.242     2920.135     3049.077
  3  GTR+F+G4      1387.358     46  2866.716     2892.609     3021.551
  4  GTR+F+I+G4    1387.726     47  2869.452     2896.633     3027.653
  5  GTR+F+R2      1382.364     47  2858.729     2885.910     3016.930
  6  GTR+F+R3      1382.420     49  2862.840     2892.718     3027.773
 16  SYM+G4        1387.134     43  2860.269     2882.528     3005.006
 18  SYM+R2        1383.095     44  2854.189     2877.621     3002.292
 29  TVM+F+G4      1388.357     45  2866.713     2891.356     3018.182
 31  TVM+F+R2      1383.789     46  2859.578     2885.470     3014.413
 42  TVMe+G4       1387.122     42  2858.245     2879.368     2999.616
 44  TVMe+R2       1383.079     43  2852.159     2874.418     2996.896
 55  TIM3+F+G4     1391.377     44  2870.754     2894.186     3018.857
 57  TIM3+F+R2     1385.912     45  2861.825     2886.468     3013.294
 68  TIM3e+G4      1390.358     41  2862.715     2882.738     3000.720
 70  TIM3e+R2      1385.918     42  2855.836     2876.959     2997.207
 81  TIM2+F+G4     1393.635     44  2875.270     2898.702     3023.373
 83  TIM2+F+R2     1387.681     45  2865.362     2890.005     3016.831
 94  TIM2e+G4      1396.795     41  2875.589     2895.613     3013.594
 96  TIM2e+R2      1391.574     42  2867.148     2888.270     3008.519
107  TIM+F+G4      1390.363     44  2868.726     2892.158     3016.829
109  TIM+F+R2      1384.933     45  2859.866     2884.509     3011.335
120  TIMe+G4       1394.002     41  2870.005     2890.028     3008.010
122  TIMe+R2       1389.000     42  2862.000     2883.123     3003.371
133  TPM3u+F+G4    1392.306     43  2870.611     2892.870     3015.348
135  TPM3u+F+R2    1387.329     44  2862.659     2886.091     3010.762
146  TPM3+F+G4     1392.306     43  2870.611     2892.870     3015.348
148  TPM3+F+R2     1387.329     44  2862.659     2886.091     3010.762
159  TPM2u+F+G4    1394.536     43  2875.071     2897.330     3019.808
161  TPM2u+F+R2    1389.054     44  2866.107     2889.539     3014.210
172  TPM2+F+G4     1394.536     43  2875.071     2897.330     3019.808
174  TPM2+F+R2     1389.054     44  2866.107     2889.539     3014.210
185  K3Pu+F+G4     1391.405     43  2868.811     2891.070     3013.548
187  K3Pu+F+R2     1386.385     44  2860.769     2884.201     3008.872
198  K3P+G4        1394.023     40  2868.046     2887.005     3002.685
200  K3P+R2        1389.010     41  2860.020     2880.043     2998.025
211  TN+F+G4       1394.039     43  2874.077     2896.336     3018.814
213  TN+F+R2       1388.239     44  2864.479     2887.911     3012.582
224  TNe+G4        1396.796     40  2873.593     2892.552     3008.232
226  TNe+R2        1391.590     41  2865.180     2885.204     3003.185
237  HKY+F+G4      1394.954     42  2873.909     2895.032     3015.280
239  HKY+F+R2      1389.609     43  2865.217     2887.476     3009.954
250  K2P+G4        1396.829     39  2871.658     2889.589     3002.931
252  K2P+R2        1391.598     40  2863.197     2882.156     2997.836
263  F81+F+G4      1405.747     41  2893.495     2913.518     3031.500
265  F81+F+R2      1400.802     42  2885.604     2906.727     3026.975
276  JC+G4         1407.653     38  2891.306     2908.243     3019.213
278  JC+R2         1402.856     39  2883.713     2901.644     3014.986
Akaike Information Criterion:           TVMe+R2
Corrected Akaike Information Criterion: TVMe+R2
Bayesian Information Criterion:         TVMe+R2
Best-fit model: TVMe+R2 chosen according to BIC

All model information printed to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpk91txu8p/q2iqtree.model.gz
CPU time for ModelFinder: 0.606 seconds (0h:0m:0s)
Wall-clock time for ModelFinder: 0.610 seconds (0h:0m:0s)

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.100)
1. Initial log-likelihood: -1383.079
Optimal log-likelihood: -1383.077
Rate parameters:  A-C: 0.22953  A-G: 1.98475  A-T: 1.54898  C-G: 0.78167  C-T: 1.98475  G-T: 1.00000
Base frequencies:  A: 0.250  C: 0.250  G: 0.250  T: 0.250
Site proportion and rates:  (0.713,0.411) (0.287,2.461)
Parameters optimization took 1 rounds (0.004 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.006361 sec (of wall-clock time) 0.006250 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000106 sec (of wall-clock time) 0.000132 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1396.842
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Generating 98 parsimony trees... 0.092 second
Computing log-likelihood of 98 initial trees ... 0.084 seconds
Current best score: -1383.077

Do NNI search on 20 best initial trees
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 1: -1382.824
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 2: -1382.305
Iteration 10 / LogL: -1382.850 / Time: 0h:0m:0s
Iteration 20 / LogL: -1382.318 / Time: 0h:0m:0s
Finish initializing candidate tree set (2)
Current best tree score: -1382.305 / CPU time: 0.441
Number of iterations: 20
--------------------------------------------------------------------
|               OPTIMIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 23: -1382.087
Iteration 30 / LogL: -1382.481 / Time: 0h:0m:0s (0h:0m:2s left)
Estimate model parameters (epsilon = 0.100)
UPDATE BEST LOG-LIKELIHOOD: -1382.006
UPDATE BEST LOG-LIKELIHOOD: -1382.004
Iteration 40 / LogL: -1382.580 / Time: 0h:0m:0s (0h:0m:1s left)
Iteration 50 / LogL: -1382.481 / Time: 0h:0m:0s (0h:0m:1s left)
Iteration 60 / LogL: -1382.480 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 70 / LogL: -1382.423 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 80 / LogL: -1382.023 / Time: 0h:0m:1s (0h:0m:0s left)
Iteration 90 / LogL: -1382.100 / Time: 0h:0m:1s (0h:0m:0s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.004
Iteration 100 / LogL: -1382.034 / Time: 0h:0m:1s (0h:0m:0s left)
Iteration 110 / LogL: -1382.004 / Time: 0h:0m:1s (0h:0m:0s left)
Iteration 120 / LogL: -1382.013 / Time: 0h:0m:2s (0h:0m:0s left)
TREE SEARCH COMPLETED AFTER 124 ITERATIONS / Time: 0h:0m:2s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.010)
1. Initial log-likelihood: -1382.004
Optimal log-likelihood: -1382.002
Rate parameters:  A-C: 0.19106  A-G: 1.83581  A-T: 1.52762  C-G: 0.76818  C-T: 1.83581  G-T: 1.00000
Base frequencies:  A: 0.250  C: 0.250  G: 0.250  T: 0.250
Site proportion and rates:  (0.723,0.409) (0.277,2.547)
Parameters optimization took 1 rounds (0.004 sec)
BEST SCORE FOUND : -1382.002
Total tree length: 7.112

Total number of iterations: 124
CPU time used for tree search: 2.325 sec (0h:0m:2s)
Wall-clock time used for tree search: 2.143 sec (0h:0m:2s)
Total CPU time used: 2.360 sec (0h:0m:2s)
Total wall-clock time used: 2.173 sec (0h:0m:2s)

Analysis results written to: 
  IQ-TREE report:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpk91txu8p/q2iqtree.iqtree
  Maximum-likelihood tree:       /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpk91txu8p/q2iqtree.treefile
  Likelihood distances:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpk91txu8p/q2iqtree.mldist
  Screen log file:               /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpk91txu8p/q2iqtree.log

Date and Time: Wed Apr 21 15:44:06 2021
Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-l6815hga/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m MFP -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpk91txu8p/q2iqtree -nt 1

Saved Phylogeny[Unrooted] to: iqt-tree.qza

Output artifacts:

Specifying a substitution model

We can also set a substitution model of our choosing. You may have noticed while watching the onscreen output of the previous command that the best fitting model selected by ModelFinder is noted. For the sake of argument, let’s say the best selected model was shown as GTR+F+I+G4. The F is only a notation to let us know that if a given model supports unequal base frequencies, then the empirical base frequencies will be used by default. Using empirical base frequencies (F), rather than estimating them, greatly reduces computational time. The iqtree plugin will not accept F within the model notation supplied at the command line, as this will always be implied automatically for the appropriate model. Also, the iqtree plugin only accepts G not G4 to be specified within the model notation. The 4 is simply another explicit notation to remind us that four rate categories are being assumed by default. The notation approach used by the plugin simply helps to retain simplicity and familiarity when supplying model notations on the command line. So, in brief, we only have to type GTR+I+G as our input model:

qiime phylogeny iqtree \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-substitution-model 'GTR+I+G' \
  --o-tree iqt-gtrig-tree.qza \
  --verbose

stdout:

Plugin warning from phylogeny:

iqtree is deprecated and will be removed in a future version of this plugin.
IQ-TREE multicore version 2.1.2 COVID-edition for Mac OS X 64-bit built Mar 30 2021
Developed by Bui Quang Minh, James Barbetti, Nguyen Lam Tung,
Olga Chernomor, Heiko Schmidt, Dominik Schrempf, Michael Woodhams.

Host:    ghost.mggen.nau.edu (AVX, 16 GB RAM)
Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-o20c65_9/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp4fxfod5v/q2iqtree -nt 1
Seed:    147650 (Using SPRNG - Scalable Parallel Random Number Generator)
Time:    Wed Apr 21 15:44:11 2021
Kernel:  AVX - 1 threads (8 CPU cores detected)

HINT: Use -nt option to specify number of threads because your CPU has 8 cores!
HINT: -nt AUTO will automatically determine the best number of threads to use.

Reading alignment file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-o20c65_9/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta ... Fasta format detected
Alignment most likely contains DNA/RNA sequences
Alignment has 20 sequences with 214 columns, 157 distinct patterns
104 parsimony-informative, 33 singleton sites, 77 constant sites
                                          Gap/Ambiguity  Composition  p-value
   1  e84fcf85a6a4065231dcf343bb862f1cb32abae6   40.65%    passed     90.91%
   2  5525fb6dab7b6577960147574465990c6df070ad   42.99%    passed     99.80%
   3  eb3564a35320b53cef22a77288838c7446357327   42.99%    passed     25.49%
   4  418f1d469f08c99976b313028cf6d3f18f61dd55   43.93%    passed     71.86%
   5  2e3b2c075901640c4de739473f9246385430b1ed   31.31%    passed     90.76%
   6  0469f8d819bd45c7638d1c8b0895270a05f34267   38.79%    passed     92.82%
   7  d162ed685007f5adede58f14aece31dfa1b60c18   40.65%    passed     97.17%
   8  1d45b2bce36cd995c5dcb755babf512e612ce8b9   41.59%    passed     39.04%
   9  5aba6bd9debc23ded7041ffdcfe5d68a427e8ce8   31.31%    passed     87.21%
  10  206656bec2abdbc4aee37a661ef5f4a62b5dd6ae   42.99%    passed     85.00%
  11  606c23e79bb730ad74e3c6efd72004c36674c17a   47.20%    passed     87.78%
  12  682e91d7e510ab134d0625234ad224f647c14eb0   41.59%    passed     31.01%
  13  6a36152105590b1eb095b9503e8f1f226fc73e43   39.25%    passed     86.29%
  14  6ca685c39a33bfbcb3123129e7af88d573df7d6f   42.06%    failed      0.02%
  15  8a1c44eb462ed58b21f3fdd72dd22bb657db2980   31.78%    passed     54.40%
  16  9b220cae8d375ea38b8b481cb95949cda8722fcb   36.92%    passed     88.78%
  17  aa4698d2e2b1fa71d08e2934a923aad7374a18f6   37.85%    passed     90.52%
  18  b31aa3f04bc9d5e2498d45cf1983dfaf09faa258   31.78%    passed     72.69%
  19  d44b129a6181f052198bda3813f0802a91612441   41.59%    passed     41.69%
  20  ed1acad8a98e8579a44370733533ad7d3fed8006   48.13%    passed     58.15%
****  TOTAL                                      39.77%  1 sequences failed composition chi2 test (p-value<5%; df=3)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.100)
Thoroughly optimizing +I+G parameters from 10 start values...
Init pinv, alpha: 0.000, 1.000 / Estimate: 0.000, 1.282 / LogL: -1392.553
Init pinv, alpha: 0.040, 1.000 / Estimate: 0.008, 1.377 / LogL: -1392.829
Init pinv, alpha: 0.080, 1.000 / Estimate: 0.009, 1.391 / LogL: -1392.898
Init pinv, alpha: 0.120, 1.000 / Estimate: 0.009, 1.388 / LogL: -1392.889
Init pinv, alpha: 0.160, 1.000 / Estimate: 0.008, 1.383 / LogL: -1392.853
Init pinv, alpha: 0.200, 1.000 / Estimate: 0.009, 1.384 / LogL: -1392.879
Init pinv, alpha: 0.240, 1.000 / Estimate: 0.007, 1.379 / LogL: -1392.828
Init pinv, alpha: 0.280, 1.000 / Estimate: 0.008, 1.382 / LogL: -1392.844
Init pinv, alpha: 0.320, 1.000 / Estimate: 0.008, 1.383 / LogL: -1392.849
Init pinv, alpha: 0.360, 1.000 / Estimate: 0.008, 1.384 / LogL: -1392.858
Optimal pinv,alpha: 0.000, 1.282 / LogL: -1392.553

Parameters optimization took 0.492 sec
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007712 sec (of wall-clock time) 0.007681 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000090 sec (of wall-clock time) 0.000102 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1398.750
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Generating 98 parsimony trees... 0.094 second
Computing log-likelihood of 98 initial trees ... 0.113 seconds
Current best score: -1392.553

Do NNI search on 20 best initial trees
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 1: -1387.261
Iteration 10 / LogL: -1387.282 / Time: 0h:0m:0s
Iteration 20 / LogL: -1387.267 / Time: 0h:0m:1s
Finish initializing candidate tree set (1)
Current best tree score: -1387.261 / CPU time: 0.614
Number of iterations: 20
--------------------------------------------------------------------
|               OPTIMIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
UPDATE BEST LOG-LIKELIHOOD: -1387.260
Iteration 30 / LogL: -1387.260 / Time: 0h:0m:1s (0h:0m:3s left)
Iteration 40 / LogL: -1406.929 / Time: 0h:0m:1s (0h:0m:2s left)
Iteration 50 / LogL: -1387.379 / Time: 0h:0m:2s (0h:0m:2s left)
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 58: -1387.167
Iteration 60 / LogL: -1387.352 / Time: 0h:0m:2s (0h:0m:4s left)
Iteration 70 / LogL: -1387.341 / Time: 0h:0m:2s (0h:0m:3s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.167
Iteration 80 / LogL: -1396.405 / Time: 0h:0m:2s (0h:0m:2s left)
Iteration 90 / LogL: -1387.343 / Time: 0h:0m:3s (0h:0m:2s left)
Iteration 100 / LogL: -1387.482 / Time: 0h:0m:3s (0h:0m:2s left)
Iteration 110 / LogL: -1387.331 / Time: 0h:0m:3s (0h:0m:1s left)
WARNING: NNI search needs unusual large number of steps (20) to converge!
Iteration 120 / LogL: -1387.168 / Time: 0h:0m:4s (0h:0m:1s left)
Iteration 130 / LogL: -1387.431 / Time: 0h:0m:4s (0h:0m:0s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.167
Iteration 140 / LogL: -1387.375 / Time: 0h:0m:4s (0h:0m:0s left)
Iteration 150 / LogL: -1387.339 / Time: 0h:0m:5s (0h:0m:0s left)
TREE SEARCH COMPLETED AFTER 159 ITERATIONS / Time: 0h:0m:5s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.010)
1. Initial log-likelihood: -1387.167
Optimal log-likelihood: -1387.167
Rate parameters:  A-C: 0.34760  A-G: 2.32788  A-T: 2.15354  C-G: 1.23704  C-T: 3.22538  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.000
Gamma shape alpha: 1.284
Parameters optimization took 1 rounds (0.004 sec)
BEST SCORE FOUND : -1387.167
Total tree length: 7.610

Total number of iterations: 159
CPU time used for tree search: 4.980 sec (0h:0m:4s)
Wall-clock time used for tree search: 4.799 sec (0h:0m:4s)
Total CPU time used: 5.502 sec (0h:0m:5s)
Total wall-clock time used: 5.319 sec (0h:0m:5s)

Analysis results written to: 
  IQ-TREE report:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp4fxfod5v/q2iqtree.iqtree
  Maximum-likelihood tree:       /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp4fxfod5v/q2iqtree.treefile
  Likelihood distances:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp4fxfod5v/q2iqtree.mldist
  Screen log file:               /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp4fxfod5v/q2iqtree.log

Date and Time: Wed Apr 21 15:44:16 2021
Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-o20c65_9/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp4fxfod5v/q2iqtree -nt 1

Saved Phylogeny[Unrooted] to: iqt-gtrig-tree.qza

Output artifacts:

Let’s rerun the command above and add the --p-fast option. This option, only compatible with the iqtree method, resembles the fast search performed by fasttree. 🏎️ Secondly, let’s also perform multiple tree searches and keep the best of those trees (as we did earlier with the raxml --p-n-searches ... command):

qiime phylogeny iqtree \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-substitution-model 'GTR+I+G' \
  --p-fast \
  --p-n-runs 10 \
  --o-tree iqt-gtrig-fast-ms-tree.qza \
  --verbose

stdout:

Plugin warning from phylogeny:

iqtree is deprecated and will be removed in a future version of this plugin.
IQ-TREE multicore version 2.1.2 COVID-edition for Mac OS X 64-bit built Mar 30 2021
Developed by Bui Quang Minh, James Barbetti, Nguyen Lam Tung,
Olga Chernomor, Heiko Schmidt, Dominik Schrempf, Michael Woodhams.

Host:    ghost.mggen.nau.edu (AVX, 16 GB RAM)
Command: iqtree -st DNA --runs 10 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-yml1wk8h/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpkla8l0c8/q2iqtree -nt 1 -fast
Seed:    693479 (Using SPRNG - Scalable Parallel Random Number Generator)
Time:    Wed Apr 21 15:44:20 2021
Kernel:  AVX - 1 threads (8 CPU cores detected)

HINT: Use -nt option to specify number of threads because your CPU has 8 cores!
HINT: -nt AUTO will automatically determine the best number of threads to use.

Reading alignment file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-yml1wk8h/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta ... Fasta format detected
Alignment most likely contains DNA/RNA sequences
Alignment has 20 sequences with 214 columns, 157 distinct patterns
104 parsimony-informative, 33 singleton sites, 77 constant sites
                                          Gap/Ambiguity  Composition  p-value
   1  e84fcf85a6a4065231dcf343bb862f1cb32abae6   40.65%    passed     90.91%
   2  5525fb6dab7b6577960147574465990c6df070ad   42.99%    passed     99.80%
   3  eb3564a35320b53cef22a77288838c7446357327   42.99%    passed     25.49%
   4  418f1d469f08c99976b313028cf6d3f18f61dd55   43.93%    passed     71.86%
   5  2e3b2c075901640c4de739473f9246385430b1ed   31.31%    passed     90.76%
   6  0469f8d819bd45c7638d1c8b0895270a05f34267   38.79%    passed     92.82%
   7  d162ed685007f5adede58f14aece31dfa1b60c18   40.65%    passed     97.17%
   8  1d45b2bce36cd995c5dcb755babf512e612ce8b9   41.59%    passed     39.04%
   9  5aba6bd9debc23ded7041ffdcfe5d68a427e8ce8   31.31%    passed     87.21%
  10  206656bec2abdbc4aee37a661ef5f4a62b5dd6ae   42.99%    passed     85.00%
  11  606c23e79bb730ad74e3c6efd72004c36674c17a   47.20%    passed     87.78%
  12  682e91d7e510ab134d0625234ad224f647c14eb0   41.59%    passed     31.01%
  13  6a36152105590b1eb095b9503e8f1f226fc73e43   39.25%    passed     86.29%
  14  6ca685c39a33bfbcb3123129e7af88d573df7d6f   42.06%    failed      0.02%
  15  8a1c44eb462ed58b21f3fdd72dd22bb657db2980   31.78%    passed     54.40%
  16  9b220cae8d375ea38b8b481cb95949cda8722fcb   36.92%    passed     88.78%
  17  aa4698d2e2b1fa71d08e2934a923aad7374a18f6   37.85%    passed     90.52%
  18  b31aa3f04bc9d5e2498d45cf1983dfaf09faa258   31.78%    passed     72.69%
  19  d44b129a6181f052198bda3813f0802a91612441   41.59%    passed     41.69%
  20  ed1acad8a98e8579a44370733533ad7d3fed8006   48.13%    passed     58.15%
****  TOTAL                                      39.77%  1 sequences failed composition chi2 test (p-value<5%; df=3)

---> START RUN NUMBER 1 (seed: 693479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
Thoroughly optimizing +I+G parameters from 10 start values...
Init pinv, alpha: 0.000, 1.000 / Estimate: 0.000, 1.266 / LogL: -1392.814
Init pinv, alpha: 0.040, 1.000 / Estimate: 0.018, 1.339 / LogL: -1393.581
Init pinv, alpha: 0.080, 1.000 / Estimate: 0.023, 1.392 / LogL: -1393.793
Init pinv, alpha: 0.120, 1.000 / Estimate: 0.022, 1.407 / LogL: -1393.766
Init pinv, alpha: 0.160, 1.000 / Estimate: 0.025, 1.408 / LogL: -1393.929
Init pinv, alpha: 0.200, 1.000 / Estimate: 0.027, 1.405 / LogL: -1394.069
Init pinv, alpha: 0.240, 1.000 / Estimate: 0.023, 1.401 / LogL: -1393.833
Init pinv, alpha: 0.280, 1.000 / Estimate: 0.024, 1.400 / LogL: -1393.905
Init pinv, alpha: 0.320, 1.000 / Estimate: 0.025, 1.401 / LogL: -1393.956
Init pinv, alpha: 0.360, 1.000 / Estimate: 0.026, 1.402 / LogL: -1394.004
Optimal pinv,alpha: 0.000, 1.266 / LogL: -1392.814

Parameters optimization took 0.322 sec
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007342 sec (of wall-clock time) 0.007295 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000088 sec (of wall-clock time) 0.000091 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1398.769
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1387.270
Finish initializing candidate tree set (3)
Current best tree score: -1387.270 / CPU time: 0.051
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1387.270
Optimal log-likelihood: -1387.256
Rate parameters:  A-C: 0.33192  A-G: 2.27065  A-T: 2.14835  C-G: 1.17849  C-T: 3.29080  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.000
Gamma shape alpha: 1.312
Parameters optimization took 1 rounds (0.004 sec)
BEST SCORE FOUND : -1387.256
Total tree length: 6.762

Total number of iterations: 2
CPU time used for tree search: 0.099 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.051 sec (0h:0m:0s)
Total CPU time used: 0.462 sec (0h:0m:0s)
Total wall-clock time used: 0.406 sec (0h:0m:0s)

---> START RUN NUMBER 2 (seed: 694479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1493.259
2. Current log-likelihood: -1403.078
3. Current log-likelihood: -1398.354
4. Current log-likelihood: -1396.979
5. Current log-likelihood: -1396.262
Optimal log-likelihood: -1395.753
Rate parameters:  A-C: 0.24339  A-G: 2.10097  A-T: 1.98596  C-G: 1.09180  C-T: 2.82193  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.355
Parameters optimization took 5 rounds (0.038 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007930 sec (of wall-clock time) 0.015553 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000064 sec (of wall-clock time) 0.000064 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.687
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1387.950
Finish initializing candidate tree set (4)
Current best tree score: -1387.950 / CPU time: 0.090
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1387.950
2. Current log-likelihood: -1387.817
3. Current log-likelihood: -1387.717
4. Current log-likelihood: -1387.641
5. Current log-likelihood: -1387.582
Optimal log-likelihood: -1387.535
Rate parameters:  A-C: 0.36767  A-G: 2.30158  A-T: 2.10668  C-G: 1.21806  C-T: 3.25866  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.006
Gamma shape alpha: 1.325
Parameters optimization took 5 rounds (0.018 sec)
BEST SCORE FOUND : -1387.535
Total tree length: 7.544

Total number of iterations: 2
CPU time used for tree search: 0.176 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.090 sec (0h:0m:0s)
Total CPU time used: 0.331 sec (0h:0m:0s)
Total wall-clock time used: 0.170 sec (0h:0m:0s)

---> START RUN NUMBER 3 (seed: 695479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1495.571
2. Current log-likelihood: -1402.008
3. Current log-likelihood: -1396.794
4. Current log-likelihood: -1395.393
5. Current log-likelihood: -1394.655
Optimal log-likelihood: -1394.081
Rate parameters:  A-C: 0.27755  A-G: 2.37595  A-T: 2.10647  C-G: 1.20302  C-T: 3.28731  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.386
Parameters optimization took 5 rounds (0.040 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.008330 sec (of wall-clock time) 0.016306 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000072 sec (of wall-clock time) 0.000077 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.762
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1388.150
Finish initializing candidate tree set (4)
Current best tree score: -1388.150 / CPU time: 0.064
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1388.150
2. Current log-likelihood: -1387.960
3. Current log-likelihood: -1387.822
4. Current log-likelihood: -1387.720
5. Current log-likelihood: -1387.643
6. Current log-likelihood: -1387.582
Optimal log-likelihood: -1387.534
Rate parameters:  A-C: 0.37061  A-G: 2.31378  A-T: 2.12048  C-G: 1.22494  C-T: 3.28291  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.006
Gamma shape alpha: 1.329
Parameters optimization took 6 rounds (0.021 sec)
BEST SCORE FOUND : -1387.534
Total tree length: 7.519

Total number of iterations: 2
CPU time used for tree search: 0.126 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.065 sec (0h:0m:0s)
Total CPU time used: 0.293 sec (0h:0m:0s)
Total wall-clock time used: 0.151 sec (0h:0m:0s)

---> START RUN NUMBER 4 (seed: 696479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.000 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1496.015
2. Current log-likelihood: -1403.630
3. Current log-likelihood: -1398.533
4. Current log-likelihood: -1397.077
5. Current log-likelihood: -1396.255
6. Current log-likelihood: -1395.746
Optimal log-likelihood: -1395.367
Rate parameters:  A-C: 0.23667  A-G: 2.05005  A-T: 1.94885  C-G: 1.06762  C-T: 2.81217  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.021
Gamma shape alpha: 1.337
Parameters optimization took 6 rounds (0.042 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007992 sec (of wall-clock time) 0.015666 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000079 sec (of wall-clock time) 0.000077 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.460
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1387.984
Finish initializing candidate tree set (3)
Current best tree score: -1387.984 / CPU time: 0.059
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1387.984
2. Current log-likelihood: -1387.819
3. Current log-likelihood: -1387.696
4. Current log-likelihood: -1387.602
5. Current log-likelihood: -1387.530
6. Current log-likelihood: -1387.474
Optimal log-likelihood: -1387.428
Rate parameters:  A-C: 0.33235  A-G: 2.26205  A-T: 2.13755  C-G: 1.17331  C-T: 3.27686  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.004
Gamma shape alpha: 1.352
Parameters optimization took 6 rounds (0.023 sec)
BEST SCORE FOUND : -1387.428
Total tree length: 6.753

Total number of iterations: 2
CPU time used for tree search: 0.116 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.060 sec (0h:0m:0s)
Total CPU time used: 0.288 sec (0h:0m:0s)
Total wall-clock time used: 0.148 sec (0h:0m:0s)

---> START RUN NUMBER 5 (seed: 697479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1493.167
2. Current log-likelihood: -1403.041
3. Current log-likelihood: -1398.313
4. Current log-likelihood: -1396.957
5. Current log-likelihood: -1396.228
Optimal log-likelihood: -1395.709
Rate parameters:  A-C: 0.23146  A-G: 2.06957  A-T: 1.96268  C-G: 1.07937  C-T: 2.84175  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.322
Parameters optimization took 5 rounds (0.037 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.008006 sec (of wall-clock time) 0.015703 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000071 sec (of wall-clock time) 0.000076 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.741
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1395.309
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 2: -1388.004
Finish initializing candidate tree set (4)
Current best tree score: -1388.004 / CPU time: 0.041
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1388.004
2. Current log-likelihood: -1387.829
3. Current log-likelihood: -1387.694
4. Current log-likelihood: -1387.595
5. Current log-likelihood: -1387.522
6. Current log-likelihood: -1387.466
Optimal log-likelihood: -1387.422
Rate parameters:  A-C: 0.32668  A-G: 2.24644  A-T: 2.11919  C-G: 1.16539  C-T: 3.24437  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.004
Gamma shape alpha: 1.358
Parameters optimization took 6 rounds (0.023 sec)
BEST SCORE FOUND : -1387.422
Total tree length: 6.698

Total number of iterations: 2
CPU time used for tree search: 0.080 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.041 sec (0h:0m:0s)
Total CPU time used: 0.244 sec (0h:0m:0s)
Total wall-clock time used: 0.126 sec (0h:0m:0s)

---> START RUN NUMBER 6 (seed: 698479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1492.097
2. Current log-likelihood: -1401.816
3. Current log-likelihood: -1396.523
4. Current log-likelihood: -1395.122
5. Current log-likelihood: -1394.389
Optimal log-likelihood: -1393.818
Rate parameters:  A-C: 0.27163  A-G: 2.41073  A-T: 2.17144  C-G: 1.24911  C-T: 3.27679  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.416
Parameters optimization took 5 rounds (0.038 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007849 sec (of wall-clock time) 0.015388 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000069 sec (of wall-clock time) 0.000073 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.770
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1388.163
Finish initializing candidate tree set (3)
Current best tree score: -1388.163 / CPU time: 0.046
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1388.163
2. Current log-likelihood: -1387.946
3. Current log-likelihood: -1387.789
4. Current log-likelihood: -1387.672
5. Current log-likelihood: -1387.583
6. Current log-likelihood: -1387.515
7. Current log-likelihood: -1387.462
Optimal log-likelihood: -1387.419
Rate parameters:  A-C: 0.33243  A-G: 2.28400  A-T: 2.15817  C-G: 1.18491  C-T: 3.30806  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.004
Gamma shape alpha: 1.352
Parameters optimization took 7 rounds (0.026 sec)
BEST SCORE FOUND : -1387.419
Total tree length: 6.736

Total number of iterations: 2
CPU time used for tree search: 0.091 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.047 sec (0h:0m:0s)
Total CPU time used: 0.261 sec (0h:0m:0s)
Total wall-clock time used: 0.134 sec (0h:0m:0s)

---> START RUN NUMBER 7 (seed: 699479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1492.389
2. Current log-likelihood: -1401.890
3. Current log-likelihood: -1396.534
4. Current log-likelihood: -1395.117
5. Current log-likelihood: -1394.389
Optimal log-likelihood: -1393.814
Rate parameters:  A-C: 0.27026  A-G: 2.39526  A-T: 2.16931  C-G: 1.24752  C-T: 3.29290  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.415
Parameters optimization took 5 rounds (0.038 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007673 sec (of wall-clock time) 0.015040 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000070 sec (of wall-clock time) 0.000075 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.766
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1388.162
Finish initializing candidate tree set (3)
Current best tree score: -1388.162 / CPU time: 0.048
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1388.162
2. Current log-likelihood: -1387.945
3. Current log-likelihood: -1387.788
4. Current log-likelihood: -1387.671
5. Current log-likelihood: -1387.583
6. Current log-likelihood: -1387.515
7. Current log-likelihood: -1387.462
Optimal log-likelihood: -1387.419
Rate parameters:  A-C: 0.33258  A-G: 2.28451  A-T: 2.15872  C-G: 1.18520  C-T: 3.30903  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.004
Gamma shape alpha: 1.351
Parameters optimization took 7 rounds (0.025 sec)
BEST SCORE FOUND : -1387.419
Total tree length: 6.737

Total number of iterations: 2
CPU time used for tree search: 0.094 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.048 sec (0h:0m:0s)
Total CPU time used: 0.262 sec (0h:0m:0s)
Total wall-clock time used: 0.135 sec (0h:0m:0s)

---> START RUN NUMBER 8 (seed: 700479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1492.199
2. Current log-likelihood: -1404.591
3. Current log-likelihood: -1399.228
4. Current log-likelihood: -1397.831
5. Current log-likelihood: -1397.074
Optimal log-likelihood: -1396.495
Rate parameters:  A-C: 0.24620  A-G: 2.08306  A-T: 1.99580  C-G: 1.06240  C-T: 2.85598  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.432
Parameters optimization took 5 rounds (0.040 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007787 sec (of wall-clock time) 0.015261 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000072 sec (of wall-clock time) 0.000076 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1400.020
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1388.190
Finish initializing candidate tree set (3)
Current best tree score: -1388.190 / CPU time: 0.061
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1388.190
2. Current log-likelihood: -1387.966
3. Current log-likelihood: -1387.806
4. Current log-likelihood: -1387.686
5. Current log-likelihood: -1387.596
6. Current log-likelihood: -1387.525
7. Current log-likelihood: -1387.470
Optimal log-likelihood: -1387.426
Rate parameters:  A-C: 0.33256  A-G: 2.23866  A-T: 2.11314  C-G: 1.16082  C-T: 3.23616  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.004
Gamma shape alpha: 1.356
Parameters optimization took 7 rounds (0.027 sec)
BEST SCORE FOUND : -1387.426
Total tree length: 6.733

Total number of iterations: 2
CPU time used for tree search: 0.119 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.061 sec (0h:0m:0s)
Total CPU time used: 0.296 sec (0h:0m:0s)
Total wall-clock time used: 0.152 sec (0h:0m:0s)

---> START RUN NUMBER 9 (seed: 701479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1493.459
2. Current log-likelihood: -1403.057
3. Current log-likelihood: -1398.315
4. Current log-likelihood: -1396.957
5. Current log-likelihood: -1396.224
Optimal log-likelihood: -1395.705
Rate parameters:  A-C: 0.23667  A-G: 2.08551  A-T: 1.97696  C-G: 1.07651  C-T: 2.86648  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.322
Parameters optimization took 5 rounds (0.034 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007640 sec (of wall-clock time) 0.014977 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000071 sec (of wall-clock time) 0.000075 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.710
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1387.973
Finish initializing candidate tree set (3)
Current best tree score: -1387.973 / CPU time: 0.065
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1387.973
2. Current log-likelihood: -1387.813
3. Current log-likelihood: -1387.692
4. Current log-likelihood: -1387.599
5. Current log-likelihood: -1387.528
6. Current log-likelihood: -1387.472
Optimal log-likelihood: -1387.426
Rate parameters:  A-C: 0.33542  A-G: 2.27104  A-T: 2.14661  C-G: 1.17790  C-T: 3.29174  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.004
Gamma shape alpha: 1.350
Parameters optimization took 6 rounds (0.022 sec)
BEST SCORE FOUND : -1387.426
Total tree length: 6.765

Total number of iterations: 2
CPU time used for tree search: 0.127 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.065 sec (0h:0m:0s)
Total CPU time used: 0.285 sec (0h:0m:0s)
Total wall-clock time used: 0.147 sec (0h:0m:0s)

---> START RUN NUMBER 10 (seed: 702479)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.500)
1. Initial log-likelihood: -1495.571
2. Current log-likelihood: -1402.008
3. Current log-likelihood: -1396.794
4. Current log-likelihood: -1395.393
5. Current log-likelihood: -1394.655
Optimal log-likelihood: -1394.081
Rate parameters:  A-C: 0.27755  A-G: 2.37595  A-T: 2.10646  C-G: 1.20301  C-T: 3.28731  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.027
Gamma shape alpha: 1.386
Parameters optimization took 5 rounds (0.038 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007965 sec (of wall-clock time) 0.015620 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000069 sec (of wall-clock time) 0.000073 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1399.762
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------

Do NNI search on 2 best initial trees
Estimate model parameters (epsilon = 0.500)
BETTER TREE FOUND at iteration 1: -1388.150
Finish initializing candidate tree set (4)
Current best tree score: -1388.150 / CPU time: 0.064
Number of iterations: 2
TREE SEARCH COMPLETED AFTER 2 ITERATIONS / Time: 0h:0m:0s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.050)
1. Initial log-likelihood: -1388.150
2. Current log-likelihood: -1387.960
3. Current log-likelihood: -1387.822
4. Current log-likelihood: -1387.720
5. Current log-likelihood: -1387.643
6. Current log-likelihood: -1387.582
Optimal log-likelihood: -1387.534
Rate parameters:  A-C: 0.37061  A-G: 2.31378  A-T: 2.12048  C-G: 1.22494  C-T: 3.28291  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.006
Gamma shape alpha: 1.329
Parameters optimization took 6 rounds (0.023 sec)
BEST SCORE FOUND : -1387.534
Total tree length: 7.519

Total number of iterations: 2
CPU time used for tree search: 0.125 sec (0h:0m:0s)
Wall-clock time used for tree search: 0.064 sec (0h:0m:0s)
Total CPU time used: 0.289 sec (0h:0m:0s)
Total wall-clock time used: 0.149 sec (0h:0m:0s)

---> SUMMARIZE RESULTS FROM 10 RUNS

Run 1 gave best log-likelihood: -1387.256
Total CPU time for 10 runs: 3.044 seconds.
Total wall-clock time for 10 runs: 1.738 seconds.


Analysis results written to: 
  IQ-TREE report:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpkla8l0c8/q2iqtree.iqtree
  Maximum-likelihood tree:       /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpkla8l0c8/q2iqtree.treefile
  Trees from independent runs:   /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpkla8l0c8/q2iqtree.runtrees
  Likelihood distances:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpkla8l0c8/q2iqtree.mldist
  Screen log file:               /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpkla8l0c8/q2iqtree.log

Date and Time: Wed Apr 21 15:44:22 2021
Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: iqtree -st DNA --runs 10 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-yml1wk8h/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpkla8l0c8/q2iqtree -nt 1 -fast

Saved Phylogeny[Unrooted] to: iqt-gtrig-fast-ms-tree.qza

Output artifacts:

Single branch tests

IQ-TREE provides access to a few single branch testing methods

  1. SH-aLRT via --p-alrt [INT >= 1000]

  2. aBayes via --p-abayes [TRUE | FALSE]

  3. local bootstrap test via --p-lbp [INT >= 1000]

Single branch tests are commonly used as an alternative to the bootstrapping approach we’ve discussed above, as they are substantially faster and often recommended when constructing large phylogenies (e.g. >10,000 taxa). All three of these methods can be applied simultaneously and viewed within iTOL as separate bootstrap support values. These values are always in listed in the following order of alrt / lbp / abayes. We’ll go ahead and apply all of the branch tests in our next command, while specifying the same substitution model as above. Feel free to combine this with the --p-fast option. 😉

qiime phylogeny iqtree \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-alrt 1000 \
  --p-abayes \
  --p-lbp 1000 \
  --p-substitution-model 'GTR+I+G' \
  --o-tree iqt-sbt-tree.qza \
  --verbose

stdout:

Plugin warning from phylogeny:

iqtree is deprecated and will be removed in a future version of this plugin.
IQ-TREE multicore version 2.1.2 COVID-edition for Mac OS X 64-bit built Mar 30 2021
Developed by Bui Quang Minh, James Barbetti, Nguyen Lam Tung,
Olga Chernomor, Heiko Schmidt, Dominik Schrempf, Michael Woodhams.

Host:    ghost.mggen.nau.edu (AVX, 16 GB RAM)
Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-hpwy9i8m/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmptm52iy9y/q2iqtree -nt 1 -alrt 1000 -abayes -lbp 1000
Seed:    638418 (Using SPRNG - Scalable Parallel Random Number Generator)
Time:    Wed Apr 21 15:44:26 2021
Kernel:  AVX - 1 threads (8 CPU cores detected)

HINT: Use -nt option to specify number of threads because your CPU has 8 cores!
HINT: -nt AUTO will automatically determine the best number of threads to use.

Reading alignment file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-hpwy9i8m/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta ... Fasta format detected
Alignment most likely contains DNA/RNA sequences
Alignment has 20 sequences with 214 columns, 157 distinct patterns
104 parsimony-informative, 33 singleton sites, 77 constant sites
                                          Gap/Ambiguity  Composition  p-value
   1  e84fcf85a6a4065231dcf343bb862f1cb32abae6   40.65%    passed     90.91%
   2  5525fb6dab7b6577960147574465990c6df070ad   42.99%    passed     99.80%
   3  eb3564a35320b53cef22a77288838c7446357327   42.99%    passed     25.49%
   4  418f1d469f08c99976b313028cf6d3f18f61dd55   43.93%    passed     71.86%
   5  2e3b2c075901640c4de739473f9246385430b1ed   31.31%    passed     90.76%
   6  0469f8d819bd45c7638d1c8b0895270a05f34267   38.79%    passed     92.82%
   7  d162ed685007f5adede58f14aece31dfa1b60c18   40.65%    passed     97.17%
   8  1d45b2bce36cd995c5dcb755babf512e612ce8b9   41.59%    passed     39.04%
   9  5aba6bd9debc23ded7041ffdcfe5d68a427e8ce8   31.31%    passed     87.21%
  10  206656bec2abdbc4aee37a661ef5f4a62b5dd6ae   42.99%    passed     85.00%
  11  606c23e79bb730ad74e3c6efd72004c36674c17a   47.20%    passed     87.78%
  12  682e91d7e510ab134d0625234ad224f647c14eb0   41.59%    passed     31.01%
  13  6a36152105590b1eb095b9503e8f1f226fc73e43   39.25%    passed     86.29%
  14  6ca685c39a33bfbcb3123129e7af88d573df7d6f   42.06%    failed      0.02%
  15  8a1c44eb462ed58b21f3fdd72dd22bb657db2980   31.78%    passed     54.40%
  16  9b220cae8d375ea38b8b481cb95949cda8722fcb   36.92%    passed     88.78%
  17  aa4698d2e2b1fa71d08e2934a923aad7374a18f6   37.85%    passed     90.52%
  18  b31aa3f04bc9d5e2498d45cf1983dfaf09faa258   31.78%    passed     72.69%
  19  d44b129a6181f052198bda3813f0802a91612441   41.59%    passed     41.69%
  20  ed1acad8a98e8579a44370733533ad7d3fed8006   48.13%    passed     58.15%
****  TOTAL                                      39.77%  1 sequences failed composition chi2 test (p-value<5%; df=3)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.100)
Thoroughly optimizing +I+G parameters from 10 start values...
Init pinv, alpha: 0.000, 1.000 / Estimate: 0.000, 1.261 / LogL: -1392.813
Init pinv, alpha: 0.040, 1.000 / Estimate: 0.008, 1.354 / LogL: -1393.088
Init pinv, alpha: 0.080, 1.000 / Estimate: 0.009, 1.366 / LogL: -1393.160
Init pinv, alpha: 0.120, 1.000 / Estimate: 0.009, 1.363 / LogL: -1393.150
Init pinv, alpha: 0.160, 1.000 / Estimate: 0.008, 1.359 / LogL: -1393.113
Init pinv, alpha: 0.200, 1.000 / Estimate: 0.009, 1.361 / LogL: -1393.140
Init pinv, alpha: 0.240, 1.000 / Estimate: 0.007, 1.356 / LogL: -1393.088
Init pinv, alpha: 0.280, 1.000 / Estimate: 0.008, 1.358 / LogL: -1393.104
Init pinv, alpha: 0.320, 1.000 / Estimate: 0.008, 1.360 / LogL: -1393.109
Init pinv, alpha: 0.360, 1.000 / Estimate: 0.008, 1.361 / LogL: -1393.119
Optimal pinv,alpha: 0.000, 1.261 / LogL: -1392.813

Parameters optimization took 0.479 sec
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007570 sec (of wall-clock time) 0.007519 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000085 sec (of wall-clock time) 0.000080 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1398.750
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Generating 98 parsimony trees... 0.092 second
Computing log-likelihood of 98 initial trees ... 0.113 seconds
Current best score: -1392.813

Do NNI search on 20 best initial trees
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 1: -1387.261
Iteration 10 / LogL: -1387.281 / Time: 0h:0m:0s
Iteration 20 / LogL: -1387.266 / Time: 0h:0m:1s
Finish initializing candidate tree set (1)
Current best tree score: -1387.261 / CPU time: 0.635
Number of iterations: 20
--------------------------------------------------------------------
|               OPTIMIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Iteration 30 / LogL: -1388.157 / Time: 0h:0m:1s (0h:0m:3s left)
Iteration 40 / LogL: -1387.501 / Time: 0h:0m:1s (0h:0m:2s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.259
Iteration 50 / LogL: -1418.620 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 60 / LogL: -1387.707 / Time: 0h:0m:2s (0h:0m:1s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.254
Iteration 70 / LogL: -1387.374 / Time: 0h:0m:2s (0h:0m:1s left)
Iteration 80 / LogL: -1387.427 / Time: 0h:0m:2s (0h:0m:0s left)
Iteration 90 / LogL: -1387.307 / Time: 0h:0m:3s (0h:0m:0s left)
Iteration 100 / LogL: -1396.713 / Time: 0h:0m:3s (0h:0m:0s left)
TREE SEARCH COMPLETED AFTER 102 ITERATIONS / Time: 0h:0m:3s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.010)
1. Initial log-likelihood: -1387.254
Optimal log-likelihood: -1387.252
Rate parameters:  A-C: 0.33467  A-G: 2.27369  A-T: 2.15215  C-G: 1.18024  C-T: 3.30771  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.000
Gamma shape alpha: 1.318
Parameters optimization took 1 rounds (0.004 sec)
BEST SCORE FOUND : -1387.252

Testing tree branches by SH-like aLRT with 1000 replicates...
Testing tree branches by local-BP test with 1000 replicates...
Testing tree branches by aBayes parametric test...
0.054 sec.
Total tree length: 6.746

Total number of iterations: 102
CPU time used for tree search: 3.077 sec (0h:0m:3s)
Wall-clock time used for tree search: 2.895 sec (0h:0m:2s)
Total CPU time used: 3.647 sec (0h:0m:3s)
Total wall-clock time used: 3.461 sec (0h:0m:3s)

Analysis results written to: 
  IQ-TREE report:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmptm52iy9y/q2iqtree.iqtree
  Maximum-likelihood tree:       /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmptm52iy9y/q2iqtree.treefile
  Likelihood distances:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmptm52iy9y/q2iqtree.mldist
  Screen log file:               /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmptm52iy9y/q2iqtree.log

Date and Time: Wed Apr 21 15:44:30 2021
Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-hpwy9i8m/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmptm52iy9y/q2iqtree -nt 1 -alrt 1000 -abayes -lbp 1000

Saved Phylogeny[Unrooted] to: iqt-sbt-tree.qza

Output artifacts:

Tip

IQ-TREE search settings. There are quite a few adjustable parameters available for iqtree that can be modified improve searches through “tree space” and prevent the search algorithms from getting stuck in local optima. One particular best practice to aid in this regard, is to adjust the following parameters: --p-perturb-nni-strength and --p-stop-iter (each respectively maps to the -pers and -nstop flags of iqtree ). In brief, the larger the value for NNI (nearest-neighbor interchange) perturbation, the larger the jumps in “tree space”. This value should be set high enough to allow the search algorithm to avoid being trapped in local optima, but not to high that the search is haphazardly jumping around “tree space”. That is, like Goldilocks and the three 🐻s you need to find a setting that is “just right”, or at least within a set of reasonable bounds. One way of assessing this, is to do a few short trial runs using the --verbose flag. If you see that the likelihood values are jumping around to much, then lowering the value for --p-perturb-nni-strength may be warranted. As for the stopping criteria, i.e. --p-stop-iter, the higher this value, the more thorough your search in “tree space”. Be aware, increasing this value may also increase the run time. That is, the search will continue until it has sampled a number of trees, say 100 (default), without finding a better scoring tree. If a better tree is found, then the counter resets, and the search continues. These two parameters deserve special consideration when a given data set contains many short sequences, quite common for microbiome survey data. We can modify our original command to include these extra parameters with the recommended modifications for short sequences, i.e. a lower value for perturbation strength (shorter reads do not contain as much phylogenetic information, thus we should limit how far we jump around in “tree space”) and a larger number of stop iterations. See the IQ-TREE command reference for more details about default parameter settings. Finally, we’ll let iqtree perform the model testing, and automatically determine the optimal number of CPU cores to use.

qiime phylogeny iqtree \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-perturb-nni-strength 0.2 \
  --p-stop-iter 200 \
  --p-n-cores 1 \
  --o-tree iqt-nnisi-fast-tree.qza \
  --verbose

stdout:

Plugin warning from phylogeny:

iqtree is deprecated and will be removed in a future version of this plugin.
IQ-TREE multicore version 2.1.2 COVID-edition for Mac OS X 64-bit built Mar 30 2021
Developed by Bui Quang Minh, James Barbetti, Nguyen Lam Tung,
Olga Chernomor, Heiko Schmidt, Dominik Schrempf, Michael Woodhams.

Host:    ghost.mggen.nau.edu (AVX, 16 GB RAM)
Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-u8n7c1om/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m MFP -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpc6mbahnf/q2iqtree -nt 1 -nstop 200 -pers 0.200000
Seed:    319753 (Using SPRNG - Scalable Parallel Random Number Generator)
Time:    Wed Apr 21 15:44:34 2021
Kernel:  AVX - 1 threads (8 CPU cores detected)

HINT: Use -nt option to specify number of threads because your CPU has 8 cores!
HINT: -nt AUTO will automatically determine the best number of threads to use.

Reading alignment file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-u8n7c1om/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta ... Fasta format detected
Alignment most likely contains DNA/RNA sequences
Alignment has 20 sequences with 214 columns, 157 distinct patterns
104 parsimony-informative, 33 singleton sites, 77 constant sites
                                          Gap/Ambiguity  Composition  p-value
   1  e84fcf85a6a4065231dcf343bb862f1cb32abae6   40.65%    passed     90.91%
   2  5525fb6dab7b6577960147574465990c6df070ad   42.99%    passed     99.80%
   3  eb3564a35320b53cef22a77288838c7446357327   42.99%    passed     25.49%
   4  418f1d469f08c99976b313028cf6d3f18f61dd55   43.93%    passed     71.86%
   5  2e3b2c075901640c4de739473f9246385430b1ed   31.31%    passed     90.76%
   6  0469f8d819bd45c7638d1c8b0895270a05f34267   38.79%    passed     92.82%
   7  d162ed685007f5adede58f14aece31dfa1b60c18   40.65%    passed     97.17%
   8  1d45b2bce36cd995c5dcb755babf512e612ce8b9   41.59%    passed     39.04%
   9  5aba6bd9debc23ded7041ffdcfe5d68a427e8ce8   31.31%    passed     87.21%
  10  206656bec2abdbc4aee37a661ef5f4a62b5dd6ae   42.99%    passed     85.00%
  11  606c23e79bb730ad74e3c6efd72004c36674c17a   47.20%    passed     87.78%
  12  682e91d7e510ab134d0625234ad224f647c14eb0   41.59%    passed     31.01%
  13  6a36152105590b1eb095b9503e8f1f226fc73e43   39.25%    passed     86.29%
  14  6ca685c39a33bfbcb3123129e7af88d573df7d6f   42.06%    failed      0.02%
  15  8a1c44eb462ed58b21f3fdd72dd22bb657db2980   31.78%    passed     54.40%
  16  9b220cae8d375ea38b8b481cb95949cda8722fcb   36.92%    passed     88.78%
  17  aa4698d2e2b1fa71d08e2934a923aad7374a18f6   37.85%    passed     90.52%
  18  b31aa3f04bc9d5e2498d45cf1983dfaf09faa258   31.78%    passed     72.69%
  19  d44b129a6181f052198bda3813f0802a91612441   41.59%    passed     41.69%
  20  ed1acad8a98e8579a44370733533ad7d3fed8006   48.13%    passed     58.15%
****  TOTAL                                      39.77%  1 sequences failed composition chi2 test (p-value<5%; df=3)


Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds
Perform fast likelihood tree search using GTR+I+G model...
Estimate model parameters (epsilon = 5.000)
Perform nearest neighbor interchange...
Estimate model parameters (epsilon = 1.000)
1. Initial log-likelihood: -1389.711
Optimal log-likelihood: -1388.843
Rate parameters:  A-C: 0.36734  A-G: 2.36723  A-T: 2.14911  C-G: 1.23876  C-T: 3.32308  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.034
Gamma shape alpha: 1.420
Parameters optimization took 1 rounds (0.008 sec)
Time for fast ML tree search: 0.057 seconds

NOTE: ModelFinder requires 1 MB RAM!
ModelFinder will test up to 286 DNA models (sample size: 214) ...
 No. Model         -LnL         df  AIC          AICc         BIC
  1  GTR+F         1402.573     45  2895.147     2919.790     3046.616
  2  GTR+F+I       1401.119     46  2894.238     2920.130     3049.072
  3  GTR+F+G4      1387.362     46  2866.724     2892.616     3021.559
  4  GTR+F+I+G4    1387.729     47  2869.458     2896.638     3027.658
  5  GTR+F+R2      1382.368     47  2858.736     2885.917     3016.937
  6  GTR+F+R3      1382.422     49  2862.845     2892.723     3027.778
 16  SYM+G4        1387.133     43  2860.266     2882.525     3005.003
 18  SYM+R2        1383.095     44  2854.190     2877.621     3002.292
 29  TVM+F+G4      1388.357     45  2866.713     2891.356     3018.182
 31  TVM+F+R2      1383.790     46  2859.580     2885.472     3014.415
 42  TVMe+G4       1387.121     42  2858.243     2879.366     2999.614
 44  TVMe+R2       1383.080     43  2852.159     2874.418     2996.896
 55  TIM3+F+G4     1391.377     44  2870.754     2894.186     3018.857
 57  TIM3+F+R2     1385.913     45  2861.826     2886.469     3013.295
 68  TIM3e+G4      1390.357     41  2862.713     2882.736     3000.718
 70  TIM3e+R2      1385.918     42  2855.835     2876.958     2997.206
 81  TIM2+F+G4     1393.635     44  2875.271     2898.703     3023.374
 83  TIM2+F+R2     1387.682     45  2865.363     2890.006     3016.832
 94  TIM2e+G4      1396.794     41  2875.588     2895.611     3013.593
 96  TIM2e+R2      1391.573     42  2867.147     2888.270     3008.518
107  TIM+F+G4      1390.364     44  2868.727     2892.159     3016.830
109  TIM+F+R2      1384.935     45  2859.870     2884.512     3011.339
120  TIMe+G4       1394.002     41  2870.004     2890.027     3008.009
122  TIMe+R2       1389.000     42  2862.001     2883.123     3003.372
133  TPM3u+F+G4    1392.305     43  2870.611     2892.870     3015.348
135  TPM3u+F+R2    1387.330     44  2862.659     2886.091     3010.762
146  TPM3+F+G4     1392.305     43  2870.611     2892.870     3015.348
148  TPM3+F+R2     1387.330     44  2862.659     2886.091     3010.762
159  TPM2u+F+G4    1394.536     43  2875.071     2897.330     3019.808
161  TPM2u+F+R2    1389.054     44  2866.108     2889.540     3014.211
172  TPM2+F+G4     1394.536     43  2875.071     2897.330     3019.808
174  TPM2+F+R2     1389.054     44  2866.108     2889.540     3014.211
185  K3Pu+F+G4     1391.406     43  2868.812     2891.070     3013.549
187  K3Pu+F+R2     1386.386     44  2860.772     2884.203     3008.874
198  K3P+G4        1394.023     40  2868.045     2887.005     3002.684
200  K3P+R2        1389.010     41  2860.020     2880.044     2998.025
211  TN+F+G4       1394.039     43  2874.077     2896.336     3018.814
213  TN+F+R2       1388.240     44  2864.480     2887.912     3012.583
224  TNe+G4        1396.796     40  2873.591     2892.551     3008.230
226  TNe+R2        1391.590     41  2865.180     2885.203     3003.185
237  HKY+F+G4      1394.954     42  2873.909     2895.031     3015.280
239  HKY+F+R2      1389.609     43  2865.218     2887.477     3009.955
250  K2P+G4        1396.828     39  2871.657     2889.588     3002.930
252  K2P+R2        1391.598     40  2863.196     2882.156     2997.835
263  F81+F+G4      1405.748     41  2893.496     2913.520     3031.501
265  F81+F+R2      1400.803     42  2885.607     2906.729     3026.978
276  JC+G4         1407.653     38  2891.306     2908.244     3019.214
278  JC+R2         1402.857     39  2883.715     2901.646     3014.988
Akaike Information Criterion:           TVMe+R2
Corrected Akaike Information Criterion: TVMe+R2
Bayesian Information Criterion:         TVMe+R2
Best-fit model: TVMe+R2 chosen according to BIC

All model information printed to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpc6mbahnf/q2iqtree.model.gz
CPU time for ModelFinder: 0.596 seconds (0h:0m:0s)
Wall-clock time for ModelFinder: 0.600 seconds (0h:0m:0s)

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.100)
1. Initial log-likelihood: -1383.080
Optimal log-likelihood: -1383.077
Rate parameters:  A-C: 0.22956  A-G: 1.98471  A-T: 1.54887  C-G: 0.78156  C-T: 1.98471  G-T: 1.00000
Base frequencies:  A: 0.250  C: 0.250  G: 0.250  T: 0.250
Site proportion and rates:  (0.713,0.411) (0.287,2.462)
Parameters optimization took 1 rounds (0.004 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.004259 sec (of wall-clock time) 0.004213 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000086 sec (of wall-clock time) 0.000108 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1396.843
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Generating 98 parsimony trees... 0.086 second
Computing log-likelihood of 98 initial trees ... 0.081 seconds
Current best score: -1383.077

Do NNI search on 20 best initial trees
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 1: -1382.824
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 2: -1382.304
Iteration 10 / LogL: -1382.313 / Time: 0h:0m:0s
Iteration 20 / LogL: -1382.319 / Time: 0h:0m:0s
Finish initializing candidate tree set (2)
Current best tree score: -1382.304 / CPU time: 0.438
Number of iterations: 20
--------------------------------------------------------------------
|               OPTIMIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
UPDATE BEST LOG-LIKELIHOOD: -1382.304
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 26: -1382.087
Iteration 30 / LogL: -1382.429 / Time: 0h:0m:0s (0h:0m:3s left)
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 32: -1382.006
UPDATE BEST LOG-LIKELIHOOD: -1382.006
Iteration 40 / LogL: -1382.021 / Time: 0h:0m:0s (0h:0m:3s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.005
Iteration 50 / LogL: -1382.867 / Time: 0h:0m:0s (0h:0m:3s left)
Iteration 60 / LogL: -1382.024 / Time: 0h:0m:0s (0h:0m:2s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.004
Iteration 70 / LogL: -1382.022 / Time: 0h:0m:1s (0h:0m:2s left)
Iteration 80 / LogL: -1382.016 / Time: 0h:0m:1s (0h:0m:2s left)
Iteration 90 / LogL: -1382.005 / Time: 0h:0m:1s (0h:0m:2s left)
Iteration 100 / LogL: -1382.005 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 110 / LogL: -1382.012 / Time: 0h:0m:1s (0h:0m:1s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.004
Iteration 120 / LogL: -1382.014 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 130 / LogL: -1382.008 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 140 / LogL: -1382.480 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 150 / LogL: -1382.613 / Time: 0h:0m:1s (0h:0m:1s left)
Iteration 160 / LogL: -1382.090 / Time: 0h:0m:2s (0h:0m:0s left)
Iteration 170 / LogL: -1382.011 / Time: 0h:0m:2s (0h:0m:0s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.004
Iteration 180 / LogL: -1382.090 / Time: 0h:0m:2s (0h:0m:0s left)
Iteration 190 / LogL: -1382.017 / Time: 0h:0m:2s (0h:0m:0s left)
Iteration 200 / LogL: -1382.011 / Time: 0h:0m:2s (0h:0m:0s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.004
Iteration 210 / LogL: -1388.322 / Time: 0h:0m:2s (0h:0m:0s left)
Iteration 220 / LogL: -1382.004 / Time: 0h:0m:2s (0h:0m:0s left)
Iteration 230 / LogL: -1382.108 / Time: 0h:0m:2s (0h:0m:0s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.004
TREE SEARCH COMPLETED AFTER 233 ITERATIONS / Time: 0h:0m:2s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.010)
1. Initial log-likelihood: -1382.004
Optimal log-likelihood: -1382.002
Rate parameters:  A-C: 0.19122  A-G: 1.84335  A-T: 1.53378  C-G: 0.77327  C-T: 1.84335  G-T: 1.00000
Base frequencies:  A: 0.250  C: 0.250  G: 0.250  T: 0.250
Site proportion and rates:  (0.724,0.408) (0.276,2.548)
Parameters optimization took 1 rounds (0.004 sec)
BEST SCORE FOUND : -1382.002
Total tree length: 7.114

Total number of iterations: 233
CPU time used for tree search: 2.924 sec (0h:0m:2s)
Wall-clock time used for tree search: 2.738 sec (0h:0m:2s)
Total CPU time used: 2.955 sec (0h:0m:2s)
Total wall-clock time used: 2.765 sec (0h:0m:2s)

Analysis results written to: 
  IQ-TREE report:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpc6mbahnf/q2iqtree.iqtree
  Maximum-likelihood tree:       /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpc6mbahnf/q2iqtree.treefile
  Likelihood distances:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpc6mbahnf/q2iqtree.mldist
  Screen log file:               /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpc6mbahnf/q2iqtree.log

Date and Time: Wed Apr 21 15:44:37 2021
Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: iqtree -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-u8n7c1om/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m MFP -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpc6mbahnf/q2iqtree -nt 1 -nstop 200 -pers 0.200000

Saved Phylogeny[Unrooted] to: iqt-nnisi-fast-tree.qza

Output artifacts:

iqtree-ultrafast-bootstrap

As per our discussion in the raxml-rapid-bootstrap section above, we can also use IQ-TREE to evaluate how well our splits / bipartitions are supported within our phylogeny via the ultrafast bootstrap algorithm. Below, we’ll apply the plugin’s ultrafast bootstrap command: automatic model selection (MFP), perform 1000 bootstrap replicates (minimum required), set the same generally suggested parameters for constructing a phylogeny from short sequences, and automatically determine the optimal number of CPU cores to use:

qiime phylogeny iqtree-ultrafast-bootstrap \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-perturb-nni-strength 0.2 \
  --p-stop-iter 200 \
  --p-n-cores 1 \
  --o-tree iqt-nnisi-bootstrap-tree.qza \
  --verbose

stdout:

Plugin warning from phylogeny:

iqtree-ultrafast-bootstrap is deprecated and will be removed in a future version of this plugin.
IQ-TREE multicore version 2.1.2 COVID-edition for Mac OS X 64-bit built Mar 30 2021
Developed by Bui Quang Minh, James Barbetti, Nguyen Lam Tung,
Olga Chernomor, Heiko Schmidt, Dominik Schrempf, Michael Woodhams.

Host:    ghost.mggen.nau.edu (AVX, 16 GB RAM)
Command: iqtree -bb 1000 -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-46qj2tge/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m MFP -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot -nt 1 -nstop 200 -pers 0.200000
Seed:    907504 (Using SPRNG - Scalable Parallel Random Number Generator)
Time:    Wed Apr 21 15:44:41 2021
Kernel:  AVX - 1 threads (8 CPU cores detected)

HINT: Use -nt option to specify number of threads because your CPU has 8 cores!
HINT: -nt AUTO will automatically determine the best number of threads to use.

Reading alignment file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-46qj2tge/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta ... Fasta format detected
Alignment most likely contains DNA/RNA sequences
Alignment has 20 sequences with 214 columns, 157 distinct patterns
104 parsimony-informative, 33 singleton sites, 77 constant sites
                                          Gap/Ambiguity  Composition  p-value
   1  e84fcf85a6a4065231dcf343bb862f1cb32abae6   40.65%    passed     90.91%
   2  5525fb6dab7b6577960147574465990c6df070ad   42.99%    passed     99.80%
   3  eb3564a35320b53cef22a77288838c7446357327   42.99%    passed     25.49%
   4  418f1d469f08c99976b313028cf6d3f18f61dd55   43.93%    passed     71.86%
   5  2e3b2c075901640c4de739473f9246385430b1ed   31.31%    passed     90.76%
   6  0469f8d819bd45c7638d1c8b0895270a05f34267   38.79%    passed     92.82%
   7  d162ed685007f5adede58f14aece31dfa1b60c18   40.65%    passed     97.17%
   8  1d45b2bce36cd995c5dcb755babf512e612ce8b9   41.59%    passed     39.04%
   9  5aba6bd9debc23ded7041ffdcfe5d68a427e8ce8   31.31%    passed     87.21%
  10  206656bec2abdbc4aee37a661ef5f4a62b5dd6ae   42.99%    passed     85.00%
  11  606c23e79bb730ad74e3c6efd72004c36674c17a   47.20%    passed     87.78%
  12  682e91d7e510ab134d0625234ad224f647c14eb0   41.59%    passed     31.01%
  13  6a36152105590b1eb095b9503e8f1f226fc73e43   39.25%    passed     86.29%
  14  6ca685c39a33bfbcb3123129e7af88d573df7d6f   42.06%    failed      0.02%
  15  8a1c44eb462ed58b21f3fdd72dd22bb657db2980   31.78%    passed     54.40%
  16  9b220cae8d375ea38b8b481cb95949cda8722fcb   36.92%    passed     88.78%
  17  aa4698d2e2b1fa71d08e2934a923aad7374a18f6   37.85%    passed     90.52%
  18  b31aa3f04bc9d5e2498d45cf1983dfaf09faa258   31.78%    passed     72.69%
  19  d44b129a6181f052198bda3813f0802a91612441   41.59%    passed     41.69%
  20  ed1acad8a98e8579a44370733533ad7d3fed8006   48.13%    passed     58.15%
****  TOTAL                                      39.77%  1 sequences failed composition chi2 test (p-value<5%; df=3)


Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds
Perform fast likelihood tree search using GTR+I+G model...
Estimate model parameters (epsilon = 5.000)
Perform nearest neighbor interchange...
Estimate model parameters (epsilon = 1.000)
1. Initial log-likelihood: -1389.703
Optimal log-likelihood: -1388.843
Rate parameters:  A-C: 0.35840  A-G: 2.36329  A-T: 2.12618  C-G: 1.22968  C-T: 3.29817  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.034
Gamma shape alpha: 1.424
Parameters optimization took 1 rounds (0.007 sec)
Time for fast ML tree search: 0.056 seconds

NOTE: ModelFinder requires 1 MB RAM!
ModelFinder will test up to 286 DNA models (sample size: 214) ...
 No. Model         -LnL         df  AIC          AICc         BIC
  1  GTR+F         1402.574     45  2895.147     2919.790     3046.616
  2  GTR+F+I       1401.119     46  2894.238     2920.130     3049.072
  3  GTR+F+G4      1387.362     46  2866.724     2892.616     3021.558
  4  GTR+F+I+G4    1387.729     47  2869.457     2896.638     3027.658
  5  GTR+F+R2      1382.368     47  2858.736     2885.917     3016.937
  6  GTR+F+R3      1382.422     49  2862.845     2892.723     3027.777
 16  SYM+G4        1387.133     43  2860.266     2882.525     3005.003
 18  SYM+R2        1383.095     44  2854.190     2877.621     3002.292
 29  TVM+F+G4      1388.357     45  2866.713     2891.356     3018.182
 31  TVM+F+R2      1383.790     46  2859.580     2885.472     3014.415
 42  TVMe+G4       1387.121     42  2858.243     2879.366     2999.614
 44  TVMe+R2       1383.080     43  2852.159     2874.418     2996.896
 55  TIM3+F+G4     1391.377     44  2870.754     2894.186     3018.857
 57  TIM3+F+R2     1385.913     45  2861.826     2886.469     3013.295
 68  TIM3e+G4      1390.357     41  2862.713     2882.736     3000.718
 70  TIM3e+R2      1385.918     42  2855.835     2876.958     2997.206
 81  TIM2+F+G4     1393.635     44  2875.271     2898.703     3023.374
 83  TIM2+F+R2     1387.682     45  2865.363     2890.006     3016.832
 94  TIM2e+G4      1396.794     41  2875.588     2895.611     3013.593
 96  TIM2e+R2      1391.573     42  2867.147     2888.270     3008.518
107  TIM+F+G4      1390.364     44  2868.727     2892.159     3016.830
109  TIM+F+R2      1384.935     45  2859.870     2884.512     3011.338
120  TIMe+G4       1394.002     41  2870.004     2890.027     3008.009
122  TIMe+R2       1389.000     42  2862.001     2883.123     3003.372
133  TPM3u+F+G4    1392.305     43  2870.611     2892.870     3015.348
135  TPM3u+F+R2    1387.330     44  2862.659     2886.091     3010.762
146  TPM3+F+G4     1392.305     43  2870.611     2892.870     3015.348
148  TPM3+F+R2     1387.330     44  2862.659     2886.091     3010.762
159  TPM2u+F+G4    1394.536     43  2875.071     2897.330     3019.808
161  TPM2u+F+R2    1389.054     44  2866.108     2889.540     3014.211
172  TPM2+F+G4     1394.536     43  2875.071     2897.330     3019.808
174  TPM2+F+R2     1389.054     44  2866.108     2889.540     3014.211
185  K3Pu+F+G4     1391.406     43  2868.812     2891.070     3013.549
187  K3Pu+F+R2     1386.386     44  2860.771     2884.203     3008.874
198  K3P+G4        1394.023     40  2868.045     2887.005     3002.684
200  K3P+R2        1389.010     41  2860.020     2880.044     2998.025
211  TN+F+G4       1394.039     43  2874.077     2896.336     3018.814
213  TN+F+R2       1388.240     44  2864.480     2887.912     3012.583
224  TNe+G4        1396.796     40  2873.591     2892.551     3008.230
226  TNe+R2        1391.590     41  2865.180     2885.203     3003.185
237  HKY+F+G4      1394.954     42  2873.909     2895.031     3015.280
239  HKY+F+R2      1389.609     43  2865.218     2887.477     3009.955
250  K2P+G4        1396.828     39  2871.657     2889.588     3002.930
252  K2P+R2        1391.598     40  2863.196     2882.156     2997.835
263  F81+F+G4      1405.748     41  2893.496     2913.520     3031.501
265  F81+F+R2      1400.803     42  2885.607     2906.729     3026.978
276  JC+G4         1407.653     38  2891.306     2908.244     3019.214
278  JC+R2         1402.857     39  2883.715     2901.646     3014.988
Akaike Information Criterion:           TVMe+R2
Corrected Akaike Information Criterion: TVMe+R2
Bayesian Information Criterion:         TVMe+R2
Best-fit model: TVMe+R2 chosen according to BIC

All model information printed to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.model.gz
CPU time for ModelFinder: 0.599 seconds (0h:0m:0s)
Wall-clock time for ModelFinder: 0.603 seconds (0h:0m:0s)
Generating 1000 samples for ultrafast bootstrap (seed: 907504)...

NOTE: 0 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.100)
1. Initial log-likelihood: -1383.080
Optimal log-likelihood: -1383.077
Rate parameters:  A-C: 0.22956  A-G: 1.98471  A-T: 1.54888  C-G: 0.78156  C-T: 1.98471  G-T: 1.00000
Base frequencies:  A: 0.250  C: 0.250  G: 0.250  T: 0.250
Site proportion and rates:  (0.713,0.411) (0.287,2.462)
Parameters optimization took 1 rounds (0.006 sec)
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.005414 sec (of wall-clock time) 0.005357 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000089 sec (of wall-clock time) 0.000099 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1396.843
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Generating 98 parsimony trees... 0.090 second
Computing log-likelihood of 98 initial trees ... 0.083 seconds
Current best score: -1383.077

Do NNI search on 20 best initial trees
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 1: -1382.824
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 2: -1382.305
Iteration 10 / LogL: -1382.313 / Time: 0h:0m:0s
Iteration 20 / LogL: -1382.319 / Time: 0h:0m:0s
Finish initializing candidate tree set (2)
Current best tree score: -1382.305 / CPU time: 0.609
Number of iterations: 20
--------------------------------------------------------------------
|               OPTIMIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 22: -1382.087
Iteration 30 / LogL: -1382.430 / Time: 0h:0m:0s (0h:0m:5s left)
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 38: -1382.004
Iteration 40 / LogL: -1382.091 / Time: 0h:0m:1s (0h:0m:5s left)
Iteration 50 / LogL: -1382.481 / Time: 0h:0m:1s (0h:0m:4s left)
Log-likelihood cutoff on original alignment: -1401.767
Iteration 60 / LogL: -1389.123 / Time: 0h:0m:1s (0h:0m:4s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.004
Iteration 70 / LogL: -1382.419 / Time: 0h:0m:1s (0h:0m:4s left)
Iteration 80 / LogL: -1382.279 / Time: 0h:0m:1s (0h:0m:3s left)
Iteration 90 / LogL: -1382.912 / Time: 0h:0m:2s (0h:0m:3s left)
UPDATE BEST LOG-LIKELIHOOD: -1382.003
Iteration 100 / LogL: -1382.004 / Time: 0h:0m:2s (0h:0m:3s left)
Log-likelihood cutoff on original alignment: -1402.236
NOTE: Bootstrap correlation coefficient of split occurrence frequencies: 0.997
Iteration 110 / LogL: -1382.017 / Time: 0h:0m:2s (0h:0m:2s left)
Iteration 120 / LogL: -1382.092 / Time: 0h:0m:2s (0h:0m:2s left)
Iteration 130 / LogL: -1382.090 / Time: 0h:0m:2s (0h:0m:2s left)
Iteration 140 / LogL: -1382.021 / Time: 0h:0m:3s (0h:0m:2s left)
Iteration 150 / LogL: -1382.094 / Time: 0h:0m:3s (0h:0m:1s left)
Log-likelihood cutoff on original alignment: -1402.408
Iteration 160 / LogL: -1382.009 / Time: 0h:0m:3s (0h:0m:1s left)
Iteration 170 / LogL: -1382.894 / Time: 0h:0m:3s (0h:0m:1s left)
Iteration 180 / LogL: -1382.005 / Time: 0h:0m:3s (0h:0m:1s left)
Iteration 190 / LogL: -1382.004 / Time: 0h:0m:3s (0h:0m:1s left)
Iteration 200 / LogL: -1382.095 / Time: 0h:0m:4s (0h:0m:0s left)
Log-likelihood cutoff on original alignment: -1402.489
NOTE: Bootstrap correlation coefficient of split occurrence frequencies: 0.994
Iteration 210 / LogL: -1382.032 / Time: 0h:0m:4s (0h:0m:1s left)
Iteration 220 / LogL: -1382.099 / Time: 0h:0m:4s (0h:0m:1s left)
Iteration 230 / LogL: -1382.016 / Time: 0h:0m:4s (0h:0m:1s left)
TREE SEARCH COMPLETED AFTER 239 ITERATIONS / Time: 0h:0m:5s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.010)
1. Initial log-likelihood: -1382.003
Optimal log-likelihood: -1382.002
Rate parameters:  A-C: 0.19114  A-G: 1.83396  A-T: 1.52546  C-G: 0.76712  C-T: 1.83396  G-T: 1.00000
Base frequencies:  A: 0.250  C: 0.250  G: 0.250  T: 0.250
Site proportion and rates:  (0.723,0.409) (0.277,2.547)
Parameters optimization took 1 rounds (0.004 sec)
BEST SCORE FOUND : -1382.002
Creating bootstrap support values...
Split supports printed to NEXUS file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.splits.nex
Total tree length: 7.111

Total number of iterations: 239
CPU time used for tree search: 5.151 sec (0h:0m:5s)
Wall-clock time used for tree search: 4.978 sec (0h:0m:4s)
Total CPU time used: 5.261 sec (0h:0m:5s)
Total wall-clock time used: 5.088 sec (0h:0m:5s)

Computing bootstrap consensus tree...
Reading input file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.splits.nex...
20 taxa and 133 splits.
Consensus tree written to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.contree
Reading input trees file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.contree
Log-likelihood of consensus tree: -1382.003

Analysis results written to: 
  IQ-TREE report:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.iqtree
  Maximum-likelihood tree:       /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.treefile
  Likelihood distances:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.mldist

Ultrafast bootstrap approximation results written to:
  Split support values:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.splits.nex
  Consensus tree:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.contree
  Screen log file:               /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot.log

Date and Time: Wed Apr 21 15:44:47 2021
Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: iqtree -bb 1000 -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-46qj2tge/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m MFP -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmp3k7gq046/q2iqtreeufboot -nt 1 -nstop 200 -pers 0.200000

Saved Phylogeny[Unrooted] to: iqt-nnisi-bootstrap-tree.qza

Output artifacts:

Perform single branch tests alongside ufboot

We can also apply single branch test methods concurrently with ultrafast bootstrapping. The support values will always be represented in the following order: alrt / lbp / abayes / ufboot. Again, these values can be seen as separately listed bootstrap values in iTOL. We’ll also specify a model as we did earlier.

qiime phylogeny iqtree-ultrafast-bootstrap \
  --i-alignment masked-aligned-rep-seqs.qza \
  --p-perturb-nni-strength 0.2 \
  --p-stop-iter 200 \
  --p-n-cores 1 \
  --p-alrt 1000 \
  --p-abayes \
  --p-lbp 1000 \
  --p-substitution-model 'GTR+I+G' \
  --o-tree iqt-nnisi-bootstrap-sbt-gtrig-tree.qza \
  --verbose

stdout:

Plugin warning from phylogeny:

iqtree-ultrafast-bootstrap is deprecated and will be removed in a future version of this plugin.
IQ-TREE multicore version 2.1.2 COVID-edition for Mac OS X 64-bit built Mar 30 2021
Developed by Bui Quang Minh, James Barbetti, Nguyen Lam Tung,
Olga Chernomor, Heiko Schmidt, Dominik Schrempf, Michael Woodhams.

Host:    ghost.mggen.nau.edu (AVX, 16 GB RAM)
Command: iqtree -bb 1000 -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-lz_rdhul/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot -nt 1 -alrt 1000 -abayes -lbp 1000 -nstop 200 -pers 0.200000
Seed:    815389 (Using SPRNG - Scalable Parallel Random Number Generator)
Time:    Wed Apr 21 15:44:51 2021
Kernel:  AVX - 1 threads (8 CPU cores detected)

HINT: Use -nt option to specify number of threads because your CPU has 8 cores!
HINT: -nt AUTO will automatically determine the best number of threads to use.

Reading alignment file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-lz_rdhul/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta ... Fasta format detected
Alignment most likely contains DNA/RNA sequences
Alignment has 20 sequences with 214 columns, 157 distinct patterns
104 parsimony-informative, 33 singleton sites, 77 constant sites
                                          Gap/Ambiguity  Composition  p-value
   1  e84fcf85a6a4065231dcf343bb862f1cb32abae6   40.65%    passed     90.91%
   2  5525fb6dab7b6577960147574465990c6df070ad   42.99%    passed     99.80%
   3  eb3564a35320b53cef22a77288838c7446357327   42.99%    passed     25.49%
   4  418f1d469f08c99976b313028cf6d3f18f61dd55   43.93%    passed     71.86%
   5  2e3b2c075901640c4de739473f9246385430b1ed   31.31%    passed     90.76%
   6  0469f8d819bd45c7638d1c8b0895270a05f34267   38.79%    passed     92.82%
   7  d162ed685007f5adede58f14aece31dfa1b60c18   40.65%    passed     97.17%
   8  1d45b2bce36cd995c5dcb755babf512e612ce8b9   41.59%    passed     39.04%
   9  5aba6bd9debc23ded7041ffdcfe5d68a427e8ce8   31.31%    passed     87.21%
  10  206656bec2abdbc4aee37a661ef5f4a62b5dd6ae   42.99%    passed     85.00%
  11  606c23e79bb730ad74e3c6efd72004c36674c17a   47.20%    passed     87.78%
  12  682e91d7e510ab134d0625234ad224f647c14eb0   41.59%    passed     31.01%
  13  6a36152105590b1eb095b9503e8f1f226fc73e43   39.25%    passed     86.29%
  14  6ca685c39a33bfbcb3123129e7af88d573df7d6f   42.06%    failed      0.02%
  15  8a1c44eb462ed58b21f3fdd72dd22bb657db2980   31.78%    passed     54.40%
  16  9b220cae8d375ea38b8b481cb95949cda8722fcb   36.92%    passed     88.78%
  17  aa4698d2e2b1fa71d08e2934a923aad7374a18f6   37.85%    passed     90.52%
  18  b31aa3f04bc9d5e2498d45cf1983dfaf09faa258   31.78%    passed     72.69%
  19  d44b129a6181f052198bda3813f0802a91612441   41.59%    passed     41.69%
  20  ed1acad8a98e8579a44370733533ad7d3fed8006   48.13%    passed     58.15%
****  TOTAL                                      39.77%  1 sequences failed composition chi2 test (p-value<5%; df=3)

Create initial parsimony tree by phylogenetic likelihood library (PLL)... 0.001 seconds
Generating 1000 samples for ultrafast bootstrap (seed: 815389)...

NOTE: 1 MB RAM (0 GB) is required!
Estimate model parameters (epsilon = 0.100)
Thoroughly optimizing +I+G parameters from 10 start values...
Init pinv, alpha: 0.000, 1.000 / Estimate: 0.000, 1.242 / LogL: -1394.542
Init pinv, alpha: 0.040, 1.000 / Estimate: 0.010, 1.345 / LogL: -1394.882
Init pinv, alpha: 0.080, 1.000 / Estimate: 0.010, 1.351 / LogL: -1394.883
Init pinv, alpha: 0.120, 1.000 / Estimate: 0.009, 1.355 / LogL: -1394.867
Init pinv, alpha: 0.160, 1.000 / Estimate: 0.009, 1.351 / LogL: -1394.832
Init pinv, alpha: 0.200, 1.000 / Estimate: 0.009, 1.354 / LogL: -1394.859
Init pinv, alpha: 0.240, 1.000 / Estimate: 0.010, 1.355 / LogL: -1394.881
Init pinv, alpha: 0.280, 1.000 / Estimate: 0.008, 1.349 / LogL: -1394.822
Init pinv, alpha: 0.320, 1.000 / Estimate: 0.009, 1.348 / LogL: -1394.833
Init pinv, alpha: 0.360, 1.000 / Estimate: 0.009, 1.347 / LogL: -1394.843
Optimal pinv,alpha: 0.000, 1.242 / LogL: -1394.542

Parameters optimization took 0.452 sec
Computing ML distances based on estimated model parameters...
Computing ML distances took 0.007299 sec (of wall-clock time) 0.007274 sec(of CPU time)
WARNING: Some pairwise ML distances are too long (saturated)
Computing RapidNJ tree took 0.000087 sec (of wall-clock time) 0.000092 sec (of CPU time)
Log-likelihood of RapidNJ tree: -1398.720
--------------------------------------------------------------------
|             INITIALIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Generating 98 parsimony trees... 0.089 second
Computing log-likelihood of 98 initial trees ... 0.112 seconds
Current best score: -1394.542

Do NNI search on 20 best initial trees
Estimate model parameters (epsilon = 0.100)
BETTER TREE FOUND at iteration 1: -1387.265
Iteration 10 / LogL: -1387.283 / Time: 0h:0m:0s
Iteration 20 / LogL: -1387.283 / Time: 0h:0m:1s
Finish initializing candidate tree set (1)
Current best tree score: -1387.265 / CPU time: 0.782
Number of iterations: 20
--------------------------------------------------------------------
|               OPTIMIZING CANDIDATE TREE SET                      |
--------------------------------------------------------------------
Iteration 30 / LogL: -1389.429 / Time: 0h:0m:1s (0h:0m:9s left)
Iteration 40 / LogL: -1389.542 / Time: 0h:0m:1s (0h:0m:7s left)
Iteration 50 / LogL: -1389.429 / Time: 0h:0m:2s (0h:0m:6s left)
Log-likelihood cutoff on original alignment: -1409.018
Iteration 60 / LogL: -1387.304 / Time: 0h:0m:2s (0h:0m:5s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.258
Iteration 70 / LogL: -1387.351 / Time: 0h:0m:2s (0h:0m:5s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.256
Iteration 80 / LogL: -1387.563 / Time: 0h:0m:2s (0h:0m:4s left)
BETTER TREE FOUND at iteration 84: -1387.256
UPDATE BEST LOG-LIKELIHOOD: -1387.256
Iteration 90 / LogL: -1387.349 / Time: 0h:0m:3s (0h:0m:7s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.256
Iteration 100 / LogL: -1387.349 / Time: 0h:0m:3s (0h:0m:6s left)
Log-likelihood cutoff on original alignment: -1409.018
NOTE: Bootstrap correlation coefficient of split occurrence frequencies: 0.966
NOTE: UFBoot does not converge, continue at least 100 more iterations
Iteration 110 / LogL: -1387.273 / Time: 0h:0m:3s (0h:0m:6s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.256
Iteration 120 / LogL: -1387.256 / Time: 0h:0m:4s (0h:0m:5s left)
Iteration 130 / LogL: -1387.273 / Time: 0h:0m:4s (0h:0m:5s left)
Iteration 140 / LogL: -1387.281 / Time: 0h:0m:4s (0h:0m:4s left)
Iteration 150 / LogL: -1387.266 / Time: 0h:0m:4s (0h:0m:4s left)
Log-likelihood cutoff on original alignment: -1409.421
UPDATE BEST LOG-LIKELIHOOD: -1387.256
Iteration 160 / LogL: -1387.256 / Time: 0h:0m:5s (0h:0m:3s left)
Iteration 170 / LogL: -1387.287 / Time: 0h:0m:5s (0h:0m:3s left)
Iteration 180 / LogL: -1397.942 / Time: 0h:0m:5s (0h:0m:3s left)
Iteration 190 / LogL: -1387.274 / Time: 0h:0m:5s (0h:0m:2s left)
Iteration 200 / LogL: -1387.405 / Time: 0h:0m:6s (0h:0m:2s left)
Log-likelihood cutoff on original alignment: -1409.421
NOTE: Bootstrap correlation coefficient of split occurrence frequencies: 0.996
Iteration 210 / LogL: -1387.298 / Time: 0h:0m:6s (0h:0m:2s left)
Iteration 220 / LogL: -1387.655 / Time: 0h:0m:6s (0h:0m:2s left)
Iteration 230 / LogL: -1387.352 / Time: 0h:0m:6s (0h:0m:2s left)
Iteration 240 / LogL: -1387.305 / Time: 0h:0m:7s (0h:0m:1s left)
Iteration 250 / LogL: -1387.351 / Time: 0h:0m:7s (0h:0m:1s left)
Log-likelihood cutoff on original alignment: -1409.421
Iteration 260 / LogL: -1388.532 / Time: 0h:0m:7s (0h:0m:1s left)
UPDATE BEST LOG-LIKELIHOOD: -1387.256
Iteration 270 / LogL: -1387.281 / Time: 0h:0m:7s (0h:0m:0s left)
Iteration 280 / LogL: -1387.281 / Time: 0h:0m:8s (0h:0m:0s left)
TREE SEARCH COMPLETED AFTER 285 ITERATIONS / Time: 0h:0m:8s

--------------------------------------------------------------------
|                    FINALIZING TREE SEARCH                        |
--------------------------------------------------------------------
Performs final model parameters optimization
Estimate model parameters (epsilon = 0.010)
1. Initial log-likelihood: -1387.256
Optimal log-likelihood: -1387.252
Rate parameters:  A-C: 0.32718  A-G: 2.24271  A-T: 2.12192  C-G: 1.16382  C-T: 3.25928  G-T: 1.00000
Base frequencies:  A: 0.243  C: 0.182  G: 0.319  T: 0.256
Proportion of invariable sites: 0.000
Gamma shape alpha: 1.320
Parameters optimization took 1 rounds (0.004 sec)
BEST SCORE FOUND : -1387.252

Testing tree branches by SH-like aLRT with 1000 replicates...
Testing tree branches by local-BP test with 1000 replicates...
Testing tree branches by aBayes parametric test...
0.054 sec.
Creating bootstrap support values...
Split supports printed to NEXUS file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.splits.nex
Total tree length: 6.736

Total number of iterations: 285
CPU time used for tree search: 7.984 sec (0h:0m:7s)
Wall-clock time used for tree search: 7.815 sec (0h:0m:7s)
Total CPU time used: 8.612 sec (0h:0m:8s)
Total wall-clock time used: 8.443 sec (0h:0m:8s)

Computing bootstrap consensus tree...
Reading input file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.splits.nex...
20 taxa and 167 splits.
Consensus tree written to /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.contree
Reading input trees file /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.contree
Log-likelihood of consensus tree: -1387.254

Analysis results written to: 
  IQ-TREE report:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.iqtree
  Maximum-likelihood tree:       /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.treefile
  Likelihood distances:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.mldist

Ultrafast bootstrap approximation results written to:
  Split support values:          /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.splits.nex
  Consensus tree:                /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.contree
  Screen log file:               /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot.log

Date and Time: Wed Apr 21 15:45:00 2021
Running external command line application. This may print messages to stdout and/or stderr.
The command being run is below. This command cannot be manually re-run as it will depend on temporary files that no longer exist.

Command: iqtree -bb 1000 -st DNA --runs 1 -s /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/qiime2-archive-lz_rdhul/6fb47a48-f2f8-44cd-810e-bd6319968277/data/aligned-dna-sequences.fasta -m GTR+I+G -pre /var/folders/9h/268zfwl56h37jwt5qv866jcr0000gp/T/tmpy9yhcf0y/q2iqtreeufboot -nt 1 -alrt 1000 -abayes -lbp 1000 -nstop 200 -pers 0.200000

Saved Phylogeny[Unrooted] to: iqt-nnisi-bootstrap-sbt-gtrig-tree.qza

Output artifacts:

Tip

If there is a need to reduce the impact of potential model violations that occur during a UFBoot search, and / or would simply like to be more rigorous, we can add the --p-bnni option to any of the iqtree-ultrafast-bootstrap commands above.

Root the phylogeny

In order to make proper use of diversity metrics such as UniFrac, the phylogeny must be rooted. Typically an outgroup is chosen when rooting a tree. In general, phylogenetic inference tools using Maximum Likelihood often return an unrooted tree by default.

QIIME 2 provides a way to mid-point root our phylogeny. Other rooting options may be available in the future. For now, we’ll root our bootstrap tree from iqtree-ultrafast-bootstrap like so:

qiime phylogeny midpoint-root \
  --i-tree iqt-nnisi-bootstrap-sbt-gtrig-tree.qza \
  --o-rooted-tree iqt-nnisi-bootstrap-sbt-gtrig-tree-rooted.qza

Output artifacts:

  • iqt-nnisi-bootstrap-sbt-gtrig-tree-rooted.qza: view | download

Tip

iTOL viewing Reminder. We can view our tree and its associated alignment via iTOL. All you need to do is upload the iqt-nnisi-bootstrap-sbt-gtrig-tree-rooted.qza tree file. Display the tree in Normal mode. Then drag and drop the masked-aligned-rep-seqs.qza file onto the visualization. Now you can view the phylogeny alongside the alignment.

Pipelines

Here we will outline the use of the phylogeny pipeline align-to-tree-mafft-fasttree

One advantage of pipelines is that they combine ordered sets of commonly used commands, into one condensed simple command. To keep these “convenience” pipelines easy to use, it is quite common to only expose a few options to the user. That is, most of the commands executed via pipelines are often configured to use default option settings. However, options that are deemed important enough for the user to consider setting, are made available. The options exposed via a given pipeline will largely depend upon what it is doing. Pipelines are also a great way for new users to get started, as it helps to lay a foundation of good practices in setting up standard operating procedures.

Rather than run one or more of the following QIIME 2 commands listed below:

  1. qiime alignment mafft ...

  2. qiime alignment mask ...

  3. qiime phylogeny fasttree ...

  4. qiime phylogeny midpoint-root ...

We can make use of the pipeline align-to-tree-mafft-fasttree to automate the above four steps in one go. Here is the description taken from the pipeline help doc:

This pipeline will start by creating a sequence alignment using MAFFT, after which any alignment columns that are phylogenetically uninformative or ambiguously aligned will be removed (masked). The resulting masked alignment will be used to infer a phylogenetic tree and then subsequently rooted at its midpoint. Output files from each step of the pipeline will be saved. This includes both the unmasked and masked MAFFT alignment from q2-alignment methods, and both the rooted and unrooted phylogenies from q2-phylogeny methods.

This can all be accomplished by simply running the following:

qiime phylogeny align-to-tree-mafft-fasttree \
  --i-sequences rep-seqs.qza \
  --output-dir mafft-fasttree-output

Output artifacts:

Congratulations! You now know how to construct a phylogeny in QIIME 2!