<p>Simply use the iterations option (e.g. <code>-n 1000</code>) of IQTREE.
It's a lot quicker (several logs) and is strongly of identical performance to RAxML.</p>
<pre><code>iqtree -s alignment.phy -n 1000 -m GTR+I+G -nt 4

</code></pre>
<p>It takes phylip, fasta, nexus  ... and no-one questions 1000 iterations, so you're safe.</p>
<p>I personally I'd then go on to bootstrap the tree (IQTREE is extremely fast). If you were bootstrapping with iterations RAxML is unworkable, you'd need e.g. 10 iterations per bootstrap (1000 bootstraps) and would be time consuming. IQTREE could easily perform 10 iterations per bootstrap and would accommodate 100 iterations (1000 would be a bit excessive for bootstrapping).</p>
<p>RAxML is an old program now, IQTREE is its successor and massively refactored for maximum likelihood phylogeny.</p>
<hr />
<p>If you don't understand the command line, drop a note and I'll explain the model it's using.</p>

CC BY-SA 4.0
2024-02-28T22:06:25.203Z
2024-02-29T01:11:36.673Z
2024-02-29T01:11:36.673Z
M__
<p>I created a phylogenetic tree of 328 species using RAxML. I run the ML algorithm 20 times and I chose the best tree (the one with the highest likelihood).</p>
<p>The choice of 20 iterations was based on a tutorial that was carrying out the same analysis but on fewer species.</p>
<p>Now I have a doubt that my search is actually not optimal, and could have got better by increasing the number of iterations.</p>
<p>Do you know if there is a way to estimate the optimal number of iterations to find the best robust ML Tree?</p>

<phylogenetics><phylogeny><taxonomy><dna>
How many ML tree should I build?
# How many ML tree should I build?

(Asked by: username_0 on 2024-02-28)

I created a phylogenetic tree of 328 species using RAxML. I run the ML algorithm 20 times and I chose the best tree (the one with the highest likelihood).

The choice of 20 iterations was based on a tutorial that was carrying out the same analysis but on fewer species.

Now I have a doubt that my search is actually not optimal, and could have got better by increasing the number of iterations.

Do you know if there is a way to estimate the optimal number of iterations to find the best robust ML Tree?

**Tags:** phylogenetics, phylogeny, taxonomy, dna

---

## 1 answers

### Answer by username_1 on 2024-02-28. Score: 2

Simply use the iterations option (e.g. -n 1000) of IQTREE.
It's a lot quicker (several logs) and is strongly of identical performance to RAxML.
iqtree -s alignment.phy -n 1000 -m GTR+I+G -nt 4


It takes phylip, fasta, nexus  ... and no-one questions 1000 iterations, so you're safe.
I personally I'd then go on to bootstrap the tree (IQTREE is extremely fast). If you were bootstrapping with iterations RAxML is unworkable, you'd need e.g. 10 iterations per bootstrap (1000 bootstraps) and would be time consuming. IQTREE could easily perform 10 iterations per bootstrap and would accommodate 100 iterations (1000 would be a bit excessive for bootstrapping).
RAxML is an old program now, IQTREE is its successor and massively refactored for maximum likelihood phylogeny.

If you don't understand the command line, drop a note and I'll explain the model it's using.


---

