Your English writing platform
Discover LudwigSuggestions(1)
Exact(15)
The heuristic search for the best tree was performed using an NJ tree as starting tree and the TBR branch-swapping algorithm.
The ML tree, found with TreeFinder and rendered ultrametric using the program r8s [133], was used as starting tree for the BEAST runs.
The heuristic search for the ML tree was performed using an NJ tree as starting tree and the TBR branch-swapping algorithm.
The ML tree was used as starting tree.
We replicated 200 heuristic searches using a randomized maximum parsimony tree as starting tree.
For all calculations data were partitioned as described earlier and the BI topology was used as starting tree.
Similar(44)
Tree length is optimized through two subtree pruning-regrafting moves and these MP trees are used as starting trees for the ML search.
The resulting trees were then used as starting trees for TBR searching using the Multrees option in PAUP.
The trees saved in this analysis were used as starting trees for a new analysis with a maximum number of trees saved set to 100.000.
Out of concern that this less aggressive search strategy might limit our ML analyses, we also used as starting trees the outputs from our more aggressive MP search strategy.
The equally MP trees were then used as starting trees for TBR branch swapping.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com