Dev110395 3134..3142
نویسندگان
چکیده
A crucial event in animal development is the specification of primordial germ cells (PGCs), which become the stem cells that create sperm and eggs. How PGCs are created provides a valuable paradigm for understanding stem cells in general. We find that the PGCs of the sea urchin Strongylocentrotus purpuratus exhibit broad transcriptional repression, yet enrichment for a set of inherited mRNAs. Enrichment of several germline determinants in the PGCs requires the RNA-binding protein Nanos to target the transcript that encodes CNOT6, a deadenylase, for degradation in the PGCs, thereby creating a stable environment for RNA. Misexpression of CNOT6 in the PGCs results in their failure to retain Seawi transcripts and Vasa protein. Conversely, broad knockdown of CNOT6 expands the domain of Seawi RNA as well as exogenous reporters. Thus, Nanos-dependent spatially restricted CNOT6 differential expression is used to selectively localize germline RNAs to the PGCs. Our findings support a ‘time capsule’ model of germline determination, whereby the PGCs are insulated from differentiation by retaining the molecular characteristics of the totipotent egg and early embryo.
منابع مشابه
The BMR freeness conjecture for the 2-reflection groups
We prove the freeness conjecture of Broué, Malle and Rouquier for the Hecke algebras associated to most of the primitive complex 2-reflection groups with a single conjugacy class of reflections.
متن کاملRecipient HLA-G +3142 CC Genotype and Concentrations of Soluble HLA-G Impact on Occurrence of CMV Infection after Living-Donor Kidney Transplantation
The expression modulation of the immunosuppressive non-classical Human leukocyte antigen-G (HLA-G) molecule and its soluble isoforms is an immune evasion strategy being deployed by cytomegalovirus (CMV). The +3142 C>G single nucleotide polymorphism (SNP) located within the 3' untranslated region (3'UTR) is of crucial importance for the regulation of HLA-G expression. Therefore, we analyzed the ...
متن کاملStrong Pseudoprimes to Twelve Prime Bases
Let ψm be the smallest strong pseudoprime to the first m prime bases. This value is known for 1 ≤ m ≤ 11. We extend this by finding ψ12 and ψ13. We also present an algorithm to find all integers n ≤ B that are strong pseudoprimes to the first m prime bases; with a reasonable heuristic assumption we can show that it takes at most B2/3+o(1) time.
متن کاملEgge triples and unbalanced Wilf equivalence
Egge, in a talk at the AMS Fall Eastern Meeting, 2012, conjectured that permutations avoiding the set of patterns {2143, 3142, τ}, where τ ∈ {246135, 254613, 524361, 546132, 263514}, are enumerated by the large Schröder numbers (and thus {2143, 3142, τ} with τ as above is Wilfequivalent to the set of patterns {2413, 3142}). Burstein and Pantone [J. Combin. 6 (2015) no. 1-2, 55–67] proved the ca...
متن کامل