نتایج جستجو برای: p5 peptide

تعداد نتایج: 161329  

2010
Elizabeth A. Stubblefield Tim A. Benke Tim Benke

(246/250 words) 16 We assessed synaptic α-amino-3-hydroxy-5-methyl-4-isoxazole propionate 17 receptor (AMPAR) properties during synaptogenesis in order to describe the 18 development of individual glutamatergic synapses on rat hippocampal CA1 principal 19 neurons. Pharmacologically isolated AMPAR-mediated glutamatergic synaptic currents 20 (evoked by stimulation of the Schaffer Collateral pathw...

2014
Daniel Lokshtanov Martin Vatshelle Yngve Villanger

The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, a...

2006
Laurent R. Chiarelli Elisa Fermo Patrizia Abrusci Paola Bianchi Chiara M. Dellacasa Alessandro Galizzi Alberto Zanella Giovanna Valentini

Hereditary pyrimidine 5'-nucleotidase type-1 (P5’N-1) deficiency is the most frequent disorder of nucleotide metabolism causing hereditary non-spherocytic hemolytic anemia. It is an autosomal recessive disease and is characterized by mild-to moderate hemolytic anemia, reticulocytosis and hyperbilirubinemia. The hallmark of this red cell enzyme disorder is the presence of pronounced basophilic s...

Journal: :Discussiones Mathematicae Graph Theory 2012
Oliver Pechenik Jenifer Wise

Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonious labelings. If A is an abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edgelabeling on G; the edge uv receives the label f(u) + f(v). A graph G is A-cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one...

Journal: :Electr. J. Comb. 2018
Yoshimi Egawa Michitaka Furuya

A {P2, P5}-factor of a graph is a spanning subgraph of the graph each of whose components is isomorphic to either P2 or P5, where Pn denote the path of order n. In this paper, we show that if a graph G satisfies c1(G−X)+ 2 3c3(G−X) 6 4 3 |X|+ 1 3 for all X ⊆ V (G), then G has a {P2, P5}-factor, where ci(G − X) is the number of components C of G − X with |V (C)| = i. Moreover, it is shown that a...

2015
Sebastian Heinl Eugenia Peresypkina Jörg Sutter Manfred Scheer

We report on an effective cluster expansion of CuBr-linked aggregates by the increase of the steric bulk of the Cp(R) ligand in the pentatopic molecules [Cp(R)Fe(η(5)-P5)]. Using [Cp(BIG)Fe(η(5)-P5)] (Cp(BIG)=C5(4-nBuC6H4)5), the novel multishell aggregate [{Cp(BIG)Fe(η(5:2:1:1:1:1:1)-P5)}12(CuBr)92] is obtained. It shows topological analogy to the theoretically predicted I-C140 fullerene molec...

Journal: :Discrete Mathematics 2022

Let G be a graph. We say that is perfectly divisible if for each induced subgraph H of G, V(H) can partitioned into A and B such H[A] perfect ω(H[B])<ω(H). use Pt Ct to denote path cycle on t vertices, respectively. For two disjoint graphs F1 F2, we F1∪F2 the graph with vertex set V(F1)∪V(F2) edge E(F1)∪E(F2), F1+F2 E(F1)∪E(F2)∪{xy|x∈V(F1) y∈V(F2)}. In this paper, prove (i) (P5,C5,K2,3)-free ar...

Journal: :Computer Aided Geometric Design 2011
Justin Bisceglio Thomas J. Peters John A. Roulier Carlo H. Séquin

An example is presented of a cubic Bézier curve that is the unknot (a knot with no crossings), but whose control polygon is knotted. It is also shown that there is no upper bound on the number of crossings in the control polygon for an unknotted Bézier curve. These examples complement known upper bounds on the number of subdivisions sufficient for a control polygon to be ambient isotopic to its...

Journal: :Journal of virology 2009
Kari A Peter Frederick Gildow Peter Palukaitis Stewart M Gray

Poleroviruses are restricted to vascular phloem tissues from which they are transmitted by their aphid vectors and are not transmissible mechanically. Phloem limitation has been attributed to the absence of virus proteins either facilitating movement or counteracting plant defense. The polerovirus capsid is composed of two forms of coat protein, the major P3 protein and the minor P3/P5 protein,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید