Sentence examples for maximum parsimony search from inspiring English sources

Maximum parsimony search yielded 13 most parsimonious trees 113 steps long.

Maximum parsimony search yielded one most parsimonious tree 153 steps long.

The phylogenetic reconstruction represents a random tree from a heuristic maximum parsimony search.

Neighbor-joining (Kimura-2 parameters model) and maximum parsimony (search with heuristic method closes-neighbor-interchange CNI with 100 random stepwise addition replicates) phylogenetic analyses were carried out with MEGA4.1 (http://www.megasoftware.net/ Tamura et al. 2007).

An unweighted heuristic maximum parsimony search was performed with the same dataset (50 replicates).

A heuristic maximum parsimony search also gave high bootstrap support to the nodes delimiting clades S (98%) and P (81%).

Maximum parsimony searches and bootstrapping were completed using a heuristic search in PAUP 4.0b10 [ 98] with 500 ratchet iterations as implemented by PRAP [ 100] with ten random sequence addition replications and tree-bisection-reconnection (TBR) branch swapping.

For each analysis, preliminary maximum parsimony searches were conducted using heuristic search methods with tree bisection reconnection (TBR) branch swapping, collapse of zero-length branches, all characters weighted equally, and 100 replicates of the random addition starting tree option.

One thousand partition replicates were analyzed by maximum parsimony (heuristic search option with random addition replicates and tree bisection-reconnection branch swapping).

The data were ordered by computing trees using several approaches: neighbor-joining, maximum parsimony (heuristic search with 100 random-addition sequences and the TBR branch-swapping algorithm; Figure 3a) and maximum likelihood (Figrue 3b).

The phylogeny of the mtDNAs was reconstructed using a thorough maximum parsimony (MP) search that is implemented in TNT [ 58], with 500 random-addition sequences and a variety of tree space exploration techniques.