Sentence examples for partitions comprising from inspiring English sources

The sequence data used in the MrBayes analysis was divided into six partitions comprising 1st, 2nd, and 3rd codon positions of the COI mitochondrial data, with single partitions for each of EF-1α, wingless, and the 16S gene fragments.

A dataset with 26 partitions (12S rRNA, 16S rRNA, ND1, ND2, CO1, CO2+ATP8+ATP6, CO3+ND3+ND4L, ND4, ND5, CYTB, with all protein-coding genes being split into three partitions comprising 1st, 2nd and 3rd codon positions) represented H1 and the 4-partition dataset represented H0.

Figure 1 shows juxtaposed evolutionary trees of human H3N2 HA and PA (polymerase) genes, with colored shading connecting HA and PA tree partitions comprised of gene segments from the same clinical isolate.

The Indo-Burmese Wedge (IBW) is a site of diffuse strain partitioning, comprising right-lateral shearing in the innermost part, and E-W shortening in the outermost part; the E-W compression is currently active (e.g., Le Dain et al., 1984; Maurin and Rangin, 2009).

The ND2 partition comprised 1088 bp (incl. up to 47 bp from the flanking tRNA-Met region), with 493 bp being variable and 436 bp parsimony-informative.

Additionally, msp1 alignment columns were separated into a partition composed of first and second codon position sites (partition of nonsynonymous sites; codon 1 + 2) and another partition comprised of third codon position sites (partition of synonymous sites; codon 3), with trees constructed independently for the two distinct partitions.

This data matrix (excluding the partition comprising indels) was used to recover a maximum likelihood tree by generating 200 iterations of the 'likelihood ratchet' [ 110], which is a model-based procedure analogous to the parsimony ratchet [ 111].

Using SAS (rank and means procedures) and GIS, we partitioned cells comprising raster surfaces into deciles based on cell value, resulting in ten ranks for the relative probability of occurrence (1 = lowest, 10 = highest).

Moreover, we found that by using this cut-off, nearly all the tendency to select an overly complex model for ω, κ or c was avoided, and that errors for selecting overly-simplistic models happen mostly for datasets where one of the partitions was comprised of a very small number of codon sites.

Regression trees were built through an iterative process called binary recursive partitioning, which comprises the splitting of the data into partitions and further splitting of the branches to minimise the squared deviations.

We note that the TILD test can be applied to partitions and trees comprising incompletely overlapping sets of taxa, but preferred to make a direct comparison with the ILD results here.