Preparation and Use of 32P-Labeled Single-Locus VNTR Probes in Identity Testing

2003 ◽  
pp. 69-82
Author(s):  
Jiirgen Henke ◽  
Lotte Henke
2019 ◽  
Author(s):  
S Peter ◽  
BNK Abdelmalek ◽  
C Demuth ◽  
B Meier ◽  
E Wolfram
Keyword(s):  

Genes ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 456
Author(s):  
Hewa Bahithige Pavithra Chathurangi Ariyarathne ◽  
Martin Correa-Luna ◽  
Hugh Thomas Blair ◽  
Dorian John Garrick ◽  
Nicolas Lopez-Villalobos

The objective of this study was to identify genomic regions associated with milk fat percentage (FP), crude protein percentage (CPP), urea concentration (MU) and efficiency of crude protein utilization (ECPU: ratio between crude protein yield in milk and dietary crude protein intake) using grazing, mixed-breed, dairy cows in New Zealand. Phenotypes from 634 Holstein Friesian, Jersey or crossbred cows were obtained from two herds at Massey University. A subset of 490 of these cows was genotyped using Bovine Illumina 50K SNP-chips. Two genome-wise association approaches were used, a single-locus model fitted to data from 490 cows and a single-step Bayes C model fitted to data from all 634 cows. The single-locus analysis was performed with the Efficient Mixed-Model Association eXpedited model as implemented in the SVS package. Single nucleotide polymorphisms (SNPs) with genome-wide association p-values ≤ 1.11 × 10−6 were considered as putative quantitative trait loci (QTL). The Bayes C analysis was performed with the JWAS package and 1-Mb genomic windows containing SNPs that explained > 0.37% of the genetic variance were considered as putative QTL. Candidate genes within 100 kb from the identified SNPs in single-locus GWAS or the 1-Mb windows were identified using gene ontology, as implemented in the Ensembl Genome Browser. The genes detected in association with FP (MGST1, DGAT1, CEBPD, SLC52A2, GPAT4, and ACOX3) and CPP (DGAT1, CSN1S1, GOSR2, HERC6, and IGF1R) were identified as candidates. Gene ontology revealed six novel candidate genes (GMDS, E2F7, SIAH1, SLC24A4, LGMN, and ASS1) significantly associated with MU whose functions were in protein catabolism, urea cycle, ion transportation and N excretion. One novel candidate gene was identified in association with ECPU (MAP3K1) that is involved in post-transcriptional modification of proteins. The findings should be validated using a larger population of New Zealand grazing dairy cows.


Genetics ◽  
1998 ◽  
Vol 150 (1) ◽  
pp. 449-458 ◽  
Author(s):  
Patrick C Phillips ◽  
Norman A Johnson

Abstract Synthetic lethals are variants at different loci that have little or no effect on viability singly but cause lethality in combination. The importance of synthetic lethals and, more generally, of synthetic deleterious loci (SDL) has been controversial. Here, we derive the expected frequencies for SDL under a mutation-selection balance for the complete haploid model and selected cases of the diploid model. We have also obtained simple approximations that demonstrate good fit to exact solutions based on numerical iterations. In the haploid case, equilibrium frequencies of carrier haplotypes (individuals with only a single mutation) are comparable to analogous single-locus results, after allowing for the effects of linkage. Frequencies in the diploid case, however, are much higher and more comparable to the square root of the single-locus results. In particular, when selection operates only on the double-mutant homozygote and linkage is not too tight, the expected frequency of the carriers is approximately the quartic root of the ratio between the mutation rate and the selection coefficient of the synthetics. For a reasonably wide set of models, the frequencies of carriers can be on the order of a few percent. The equilibrium frequencies of these deleterious alleles can be relatively high because, with SDL, both dominance and epistasis act to shield carriers from exposure to selection. We also discuss the possible role of SDL in maintaining genetic variation and in hybrid breakdown.


2015 ◽  
Vol 07 (02) ◽  
pp. 1550019
Author(s):  
Jinyu Huang

A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity) is in NC2, provided that there are polynomial number of common bases (basic matroid parity sets). For graphic matroids, we show that finding a common base for matroid intersection is in NC2, if the number of common bases is polynomial bounded. To our knowledge, these algorithms are the first deterministic NC algorithms for matroid intersection and matroid parity. We also give a new RNC2 algorithm that finds a common base for graphic matroid intersection. We prove that if there is a black-box NC algorithm for Polynomial Identity Testing (PIT), then there is an NC algorithm to determine the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity).


Sign in / Sign up

Export Citation Format

Share Document