Sentence examples for maximum parsimony starting from inspiring English sources

For RAxML analysis, ML trees were inferred with the WAG+Γ+I+F for the EEF2 data and the WAG+Γ+I for the concatenated protein data (4 discrete gamma rates), and from 100 distinct randomized maximum parsimony starting trees.

The best ML tree was determined with the PROTGAMMA implementation in multiple inferences using 10 randomized maximum parsimony starting trees.

All 49 trees were compared in a maximum likelihood framework, and we reported the tree with the highest likelihood (RAxML with maximum parsimony starting tree, log likelihood = −5895.384778).

We computed 10 maximum likelihood trees using 10 distinct randomized maximum parsimony starting trees and chose the tree with the highest likelihood.

100 bootstrap replicates and maximum parsimony starting trees of the original and bootstrap sequence alignments were generated using the RAxML phylogenetic software [ 77].

The best-known likelihood tree under the GTRMIX model of nucleotide substitution was computed from 100 runs starting from distinct randomised maximum parsimony starting trees.

ML analyses were performed with RAxML version 7.2.6 [ 64] using the rapid hill-climbing algorithm [ 65] and starting from 100 distinct randomized maximum-parsimony starting trees.

RAxML used the rapid hill-climbing algorithm [ 61] computing 100 distinct ML trees starting from 100 distinct randomized maximum-parsimony starting trees.

For the maximum parsimony analysis starting trees were obtained by stepwise addition with 100 random sequence additions.

In order to double-check our topologies, we also ran RAxML (RAxML-VI-HPC-2.2.3) [44], using randomized maximum parsimony (MP) starting trees in multiple inferences and the rapid hill-climbing algorithm.

First, a set of 10 randomised Maximum Parsimony (MP) starting trees was generated.