نتایج جستجو برای: p1

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

Journal: :Journal of virology 1992
D C Ansardi D C Porter C D Morrow

The poliovirus capsid precursor polyprotein, P1, is cotranslationally modified by the addition of myristic acid. We have examined the importance of myristylation of the P1 capsid precursor during the poliovirus assembly process by using a recently described recombinant vaccinia virus expression system which allows the independent production of the poliovirus P1 protein and the poliovirus 3CD pr...

S. Susilowati, T. Wahyu Suprayogi

This study aimed to improve the quality of cryopreserved goat semen for artificial insemination by the addition of cattle seminal plasma crude protein. Semen collected from cattle and centrifuged to obtain seminal plasma. Then it was purified to obtain the crude protein. The diluent used in this study was milk-yolk. There were three groups, control group without crude protein (P0), the addition...

Journal: :Entropy 2016
David H. Wolpert

The following corrections should be made to the published paper [1]: First, the sentence before Equation (50) on Page 19 should be replaced with the following text: “As a comparison point, we can also evaluate the work used in an impossible scenario where P1 varies stochastically, but the organism magically ’knows’ what each P1 is before it receives an input sampled from that P1, and then chang...

2012
Didier Rémy

A reduction relation m −→ is defined by the following reduction rules. This relation computes the simple substitution φ that can be applied to a pattern to match a particular value, or returns the undefined substitution ⊥ if no such simple substitution exists. {(p1, p2) 7→ (v1, v2)} m −→ {p1 7→ v1} ⊗ {p2 7→ v2} {K (p1, . . . , pn) 7→ K (v1, . . . , vn)} m −→ {p1 7→ v1} ⊗ . . .⊗ {pn 7→ vn} {K (p...

2012
DANIEL OBERLIN RICHARD OBERLIN

We study some discrete and continuous variants of the following problem of Erdős: given a finite subset P of R or R, what is the maximum number of pairs (p1, p2) with p1, p2 ∈ P and |p1−p2| = 1?

Journal: :Cancer research 2006
Nadia Lasagna Ornella Fantappiè Michela Solazzo Lucia Morbidelli Serena Marchetti Greta Cipriani Marina Ziche Roberto Mazzanti

Based on literature, it is possible to hypothesize that multidrug resistance (MDR) and angiogenic phenotypes are linked to each other in human liver cancer cells. Our goal is to assess whether MDR cells trigger angiogenesis and to study the possible molecular mechanisms involved. Conditioned medium from parental drug-sensitive P5 cells (P5-CM) and MDR-positive P1(0.5) cells [P1(0.5)-CM] stimula...

2005
VERA FISCHER

If ≤ is a preorder on a set P and p0 ≤ p1, we say that p1 is an extension of p0. Recall that a preorder is separative if and only if whenever p1 is not an extension of p0 there is an extension of p1 which is incompatible with p0. We say that P = (P,≤) is a forcing notion (also forcing poset) if ≤ is a separative preorder with minimal element 0P. Note that if P is separative and p1 p̌0 ∈ Ġ then p...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1987
S H Wickner D K Chattoraj

We have developed an in vitro DNA-replication system that replicates exogenously added mini-P1 plasmid DNA. The system consists of purified P1 RepA protein and a partially purified mixture of Escherichia coli replication proteins. It is essentially the same as that described for the replication of oriC plasmid DNA [Fuller, R.S., Kaguni, J.M. & Kornberg, A. (1981) Proc. Natl. Acad. Sci. USA 78, ...

2007

P 2 , y / ∈ P . 5. We have I ⊆ P1 ∩ P 2 2 and I ⊆ P1 ∩ Q by definition of the ideals involved. For the reverse inclusions, note that if f(x, y)x = g(x, y)y (or f(x, y)x = g(x, y)y), then g(x, y) must involve x and f(x, y) must involve y, so f(x, y) is a polynomial multiple of xy. Now P1 is prime (because R/P1 ∼= k[y], a domain), hence P1 is P1-primary. P2 is maximal and √ P 2 2 = √ Q = P2. Thus...

Journal: :Discussiones Mathematicae Graph Theory 2000
Izak Broere Michael Dorfling

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. If P1, . . . ,Pn are properties of graphs, then a (P1, . . . ,Pn)-decomposition of a graph G is a partition E1, . . . , En of E(G) such that G[Ei], the subgraph of G induced by Ei, is in Pi, for i = 1, . . . , n. We define P1⊕· · ·⊕ Pn as the property {G ∈ I : G has a ...

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

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