Sentence examples for maximum parsimony algorithm from inspiring English sources

Only the maximum parsimony algorithm (Additional file 4), which accounts for the most parsimonious explanation based on weighting each amino acid position discretely [ 52], clusters the three Chlamydomonas reinhardtii 2CP with a 2CP known from Chlamydomonas incerta in a group which is closely related to cyanobacterial 2CP.

Alignments and dendrograms were generated with the software using the Maximum Parsimony algorithm.

We built phylogenies using the maximum parsimony algorithm under default settings in MEGA4 (Closest neighbor interchange search with a depth of 1 and with the initial trees setting at "random addition trees with 20 replications").

Because an extensive search is impossible with as many as 15 k SNPs we used the maximum parsimony algorithm that minimizes the number of steps, or tree length, needed to account for the differences between strains.

After superimposing the city of origin of the Albanian sequences on the tip branches of the ML genealogy, we inferred the city of origin of each ancestral node (i.e. ancestral sequence) in the tree using the maximum parsimony algorithm (supplemental Figure S3).

By using the maximum parsimony algorithm implemented in MEGA5.1, the phylogenetic trees were constructed.

Finally, we used maximum parsimony algorithms on character data to obtain the best estimate of phylogenetic relationships among diplodocoid sauropods.

The node to which isolate VKLR-01 belonged was also supported in phylogenetic trees generated with the maximum-likelihood and maximum parsimony algorithms (data not shown).

Phylogenetic analysis was performed with the program package MEGA4 [ 107] using neighbor-joining, minimum evolution and maximum parsimony algorithms and bootstrapping with 500 replicates.

A matrix of pairwise genetic distances by the maximum-parsimony algorithm and the neighbor-joining method was used to generate phylogenetic trees.

Similar results were obtained for strain BFLP-6T when the maximum-parsimony algorithm was used.