1,107 research outputs found

    Normal Levels of Sox9 Expression in the Developing Mouse Testis Depend on the TES/TESCO Enhancer, but This Does Not Act Alone

    Get PDF
    During mouse sex determination, transient expression of the Y-linked gene Sry up-regulates its direct target gene Sox9, via a 3.2 kb testis specific enhancer of Sox9 (TES), which includes a core 1.4 kb element, TESCO. SOX9 activity leads to differentiation of Sertoli cells, rather than granulosa cells from the bipotential supporting cell precursor lineage. Here, we present functional analysis of TES/TESCO, using CRISPR/Cas9 genome editing in mice. Deletion of TESCO or TES reduced Sox9 expression levels in XY fetal gonads to 60 or 45% respectively relative to wild type gonads, and reduced expression of the SOX9 target Amh. Although human patients heterozygous for null mutations in SOX9, which are assumed to have 50% of normal expression, often show XY female sex reversal, mice deleted for one copy of Sox9 do not. Consistent with this, we did not observe sex reversal in either TESCO-/- or TES-/- XY embryos or adult mice. However, embryos carrying both a conditional Sox9 null allele and the TES deletion developed ovotestes. Quantitative analysis of these revealed levels of 23% expression of Sox9 compared to wild type, and a significant increase in the expression of the granulosa cell marker Foxl2. This indicates that the threshold in mice where sex reversal begins to be seen is about half that of the ~50% levels predicted in humans. Our results demonstrate that TES/TESCO is a crucial enhancer regulating Sox9 expression in the gonad, but point to the existence of additional enhancers that act redundantly

    Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs

    Full text link
    For a graph GG, let Z(G,λ)Z(G,\lambda) be the partition function of the monomer-dimer system defined by kmk(G)λk\sum_k m_k(G)\lambda^k, where mk(G)m_k(G) is the number of matchings of size kk in GG. We consider graphs of bounded degree and develop a sublinear-time algorithm for estimating logZ(G,λ)\log Z(G,\lambda) at an arbitrary value λ>0\lambda>0 within additive error ϵn\epsilon n with high probability. The query complexity of our algorithm does not depend on the size of GG and is polynomial in 1/ϵ1/\epsilon, and we also provide a lower bound quadratic in 1/ϵ1/\epsilon for this problem. This is the first analysis of a sublinear-time approximation algorithm for a # P-complete problem. Our approach is based on the correlation decay of the Gibbs distribution associated with Z(G,λ)Z(G,\lambda). We show that our algorithm approximates the probability for a vertex to be covered by a matching, sampled according to this Gibbs distribution, in a near-optimal sublinear time. We extend our results to approximate the average size and the entropy of such a matching within an additive error with high probability, where again the query complexity is polynomial in 1/ϵ1/\epsilon and the lower bound is quadratic in 1/ϵ1/\epsilon. Our algorithms are simple to implement and of practical use when dealing with massive datasets. Our results extend to other systems where the correlation decay is known to hold as for the independent set problem up to the critical activity

    GSP with General Independent Click-Through-Rates

    Full text link
    The popular generalized second price (GSP) auction for sponsored search is built upon a separable model of click-through-rates that decomposes the likelihood of a click into the product of a "slot effect" and an "advertiser effect" --- if the first slot is twice as good as the second for some bidder, then it is twice as good for everyone. Though appealing in its simplicity, this model is quite suspect in practice. A wide variety of factors including externalities and budgets have been studied that can and do cause it to be violated. In this paper we adopt a view of GSP as an iterated second price auction (see, e.g., Milgrom 2010) and study how the most basic violation of separability --- position dependent, arbitrary public click-through-rates that do not decompose --- affects results from the foundational analysis of GSP (Varian 2007, Edelman et al. 2007). For the two-slot setting we prove that for arbitrary click-through-rates, for arbitrary bidder values, an efficient pure-strategy equilibrium always exists; however, without separability there always exist values such that the VCG outcome and payments cannot be realized by any bids, in equilibrium or otherwise. The separability assumption is therefore necessary in the two-slot case to match the payments of VCG but not for efficiency. We moreover show that without separability, generic existence of efficient equilibria is sensitive to the choice of tie-breaking rule, and when there are more than two slots, no (bid-independent) tie-breaking rule yields the positive result. In light of this we suggest alternative mechanisms that trade the simplicity of GSP for better equilibrium properties when there are three or more slots

    Fragment-based determination of a proteinase K structure from MicroED data using ARCIMBOLDO_SHREDDER.

    Get PDF
    Structure determination of novel biological macromolecules by X-ray crystallography can be facilitated by the use of small structural fragments, some of only a few residues in length, as effective search models for molecular replacement to overcome the phase problem. Independence from the need for a complete pre-existing model with sequence similarity to the crystallized molecule is the primary appeal of ARCIMBOLDO, a suite of programs which employs this ab initio algorithm for phase determination. Here, the use of ARCIMBOLDO is investigated to overcome the phase problem with the electron cryomicroscopy (cryoEM) method known as microcrystal electron diffraction (MicroED). The results support the use of the ARCIMBOLDO_SHREDDER pipeline to provide phasing solutions for a structure of proteinase K from 1.6 Å resolution data using model fragments derived from the structures of proteins sharing a sequence identity of as low as 20%. ARCIMBOLDO_SHREDDER identified the most accurate polyalanine fragments from a set of distantly related sequence homologues. Alternatively, such templates were extracted in spherical volumes and given internal degrees of freedom to refine towards the target structure. Both modes relied on the rotation function in Phaser to identify or refine fragment models and its translation function to place them. Model completion from the placed fragments proceeded through phase combination of partial solutions and/or density modification and main-chain autotracing using SHELXE. The combined set of fragments was sufficient to arrive at a solution that resembled that determined by conventional molecular replacement using the known target structure as a search model. This approach obviates the need for a single, complete and highly accurate search model when phasing MicroED data, and permits the evaluation of large fragment libraries for this purpose
    corecore