Search results for "6b"

showing 10 items of 66 documents

Inducible and reversible inhibition of mirna-mediated gene repression in vivo

2021

Although virtually all gene networks are predicted to be controlled by miRNAs, the contribution of this important layer of gene regulation to tissue homeostasis in adult animals remains unclear. Gain and loss-of-function experiments have provided key insights into the specific function of individual miRNAs, but effective genetic tools to study the functional consequences of global inhibition of miRNA activity in vivo are lacking. Here we report the generation and characterization of a genetically engineered mouse strain in which miRNA-mediated gene repression can be reversibly inhibited without affecting miRNA biogenesis or abundance. We demonstrate the usefulness of this strategy by invest…

QH301-705.5ScienceGene regulatory networkregenerative medicineMice TransgenicBiologyGeneral Biochemistry Genetics and Molecular BiologyMiceT6BPregnancystem cellsmicroRNAAnimalsHomeostasisRNA-Induced Silencing ComplexRegenerationmolecular biologyGene Regulatory NetworksTransgenesBiology (General)Tissue homeostasisargonautemousemiRNARegulation of gene expressionGeneral Immunology and MicrobiologymicroRNAGeneral NeuroscienceRegeneration (biology)QRRISCmiRISCGeneral MedicineCell BiologyArgonauteStem Cells and Regenerative MedicineCell biologyTNRC6MicroRNAsMedicineFemaleStem cellPeptidesFunction (biology)Research Article
researchProduct

Structure of eigenvectors of random regular digraphs

2018

Let $d$ and $n$ be integers satisfying $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in \mathbb{C}$. Denote by $M$ the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. In this paper, we study the structure of the kernel of submatrices of $M-z\,{\rm Id}$, formed by removing a subset of rows. We show that with large probability the kernel consists of two non-intersecting types of vectors, which we call very steep and gradual with many levels. As a corollary, we show, in particular, that every eigenvector of $M$, except for constant multiples of $(1,1,\dots,1)$, possesses a weak delocalization property: its level sets have cardin…

Random graphDegree (graph theory)Applied MathematicsGeneral MathematicsProbability (math.PR)010102 general mathematicsBlock matrix16. Peace & justice01 natural sciencesCombinatoricsCircular lawFOS: MathematicsRank (graph theory)60B20 15B52 46B06 05C80Adjacency matrix0101 mathematicsRandom matrixEigenvalues and eigenvectorsMathematics - ProbabilityMathematics
researchProduct

Associazioni ‘ndranghetiste di nuovo insediamento e problemi applicativi dell’art. 416 bis c.p.

2016

Il fenomeno dell’espansione della ‘ndrangheta al di fuori della terra di origine impone alla dottrina e alla giurisprudenza di interrogarsi sulla questione della applicabilità della fattispecie di associazione di stampo mafioso alle “mafie delocalizzate” in aree geografiche non tradizionali. L’autore prende le mosse da una breve ricostruzione del modello organizzativo adottato dalla ‘ndrangheta nell’Italia settentrionale, e procede nel vagliare le possibili soluzioni al quesito se l’accertamento di una struttura organizzativa tipicamente ‘ndranghetista sia di per sé idonea ad integrare la fattispecie di cui all’art. 416bis c.p., anche in mancanza della prova di una effettiva estrinsecazione…

Settore IUS/17 - Diritto Penalemafia 'ndrangheta art. 416bis c.p. mafie delocalizzate
researchProduct

CCDC 251467: Experimental Crystal Structure Determination

2004

Related Article: J.R.Hanson, P.B.Hitchcock, I.Pibiri, F.Piozzi|2003|J.Chem.Res.||147|doi:10.3184/030823403103173291

Space GroupCrystallography6beta-HydroxyrosenonolactoneCrystal SystemCrystal StructureCell ParametersExperimental 3D Coordinates
researchProduct

CCDC 1981430: Experimental Crystal Structure Determination

2020

Related Article: Kibrom Gebreheiwot Bedane, Lukas Brieger, Carsten Strohmann, Ean-Jeong Seo, Thomas Efferth, Michael Spiteller|2020|Bioorg.Chem.|102|104102|doi:10.1016/j.bioorg.2020.104102

Space GroupCrystallographyCrystal System16beta-formyloxymelianthugenin monohydrateCrystal StructureCell ParametersExperimental 3D Coordinates
researchProduct

CCDC 647231: Experimental Crystal Structure Determination

2007

Related Article: C.Peifer, D.Schollmeyer, M.Tschertsche, S.Laufer|2007|Acta Crystallogr.,Sect.E:Struct.Rep.Online|63|o2249|doi:10.1107/S1600536807014717

Space GroupCrystallographyCrystal SystemCrystal StructureCell Parameters(2aRS3RS4aSR6aRS6bSR)-3-Hydroxy-2a34a66a6b-hexahydro-14-dioxacyclopenta(cd)pentalen-2(5H)-oneExperimental 3D Coordinates
researchProduct

CCDC 1961567: Experimental Crystal Structure Determination

2020

Related Article: Kibrom Gebreheiwot Bedane, Lukas Brieger, Carsten Strohmann, Ean-Jeong Seo, Thomas Efferth, Michael Spiteller|2020|J.Nat.Prod.|83|2122|doi:10.1021/acs.jnatprod.0c00060

Space GroupCrystallographyCrystal SystemCrystal StructureCell Parameters14-deoxy-15beta16beta-epoxymelianthugeninExperimental 3D Coordinates
researchProduct

CCDC 606000: Experimental Crystal Structure Determination

2006

Related Article: E.Kaasalainen, J.Tois, L.Russo, K.Rissanen, J.Helaja|2006|Tetrahedron Lett.|47|5669|doi:10.1016/j.tetlet.2006.06.014

Space GroupCrystallographyCrystal SystemCrystal StructureCell Parameters6a-Methyl-2-methoxy-8-phenyl-566a6b9a1010a10b1112-decahydropentaleno(21-a)phenanthren-7(4bH)-oneExperimental 3D Coordinates
researchProduct

The rank of random regular digraphs of constant degree

2018

Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .

Statistics and ProbabilityControl and OptimizationUniform distribution (continuous)General Mathematics0102 computer and information sciencesrandom matrices01 natural sciencesCombinatoricsIntegerFOS: Mathematics60B20 15B52 46B06 05C80Rank (graph theory)Adjacency matrix0101 mathematicsEigenvalues and eigenvectorsMathematicsNumerical AnalysisAlgebra and Number TheoryDegree (graph theory)Applied MathematicsProbability (math.PR)010102 general mathematicsrandom regular graphssingularity probabilityrank010201 computation theory & mathematicsRegular graphRandom matrixMathematics - ProbabilityJournal of Complexity
researchProduct

The smallest singular value of a shifted $d$-regular random square matrix

2017

We derive a lower bound on the smallest singular value of a random d-regular matrix, that is, the adjacency matrix of a random d-regular directed graph. Specifically, let $$C_1<d< c n/\log ^2 n$$ and let $$\mathcal {M}_{n,d}$$ be the set of all $$n\times n$$ square matrices with 0 / 1 entries, such that each row and each column of every matrix in $$\mathcal {M}_{n,d}$$ has exactly d ones. Let M be a random matrix uniformly distributed on $$\mathcal {M}_{n,d}$$ . Then the smallest singular value $$s_{n} (M)$$ of M is greater than $$n^{-6}$$ with probability at least $$1-C_2\log ^2 d/\sqrt{d}$$ , where c, $$C_1$$ , and $$C_2$$ are absolute positive constants independent of any other parameter…

Statistics and ProbabilityIdentity matrixAdjacency matrices01 natural sciencesSquare matrixCombinatorics010104 statistics & probabilityMatrix (mathematics)Mathematics::Algebraic GeometryFOS: MathematicsMathematics - Combinatorics60B20 15B52 46B06 05C80Adjacency matrix0101 mathematicsCondition numberCondition numberMathematicsRandom graphsRandom graphLittlewood–Offord theorySingularity010102 general mathematicsProbability (math.PR)InvertibilityRegular graphsSingular valueSmallest singular valueAnti-concentrationSingular probabilitySparse matricesCombinatorics (math.CO)Statistics Probability and UncertaintyRandom matricesRandom matrixMathematics - ProbabilityAnalysis
researchProduct