Results 81 to 90 of about 732,396 (308)

Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation

open access: yesFEBS Letters, EarlyView.
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz   +11 more
wiley   +1 more source

Disjunctive total domination in graphs [PDF]

open access: yesJournal of Combinatorial Optimization, 2014
Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $γ_t(G)$. A set $S$ of vertices in $G$ is a disjunctive total dominating set of $G$ if every vertex is adjacent to a vertex of $S$ or has at least two vertices in ...
Michael A. Henning, Viroshan Naicker
openaire   +3 more sources

An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane

open access: yesFEBS Letters, EarlyView.
Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa   +3 more
wiley   +1 more source

Edge and total choosability of near-outerplanar graphs [PDF]

open access: yes, 2006
It is proved that, if G is a K4-minor-free graph with maximum degree ∆ ≥ 4, then G is totally (∆ + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ∆ + 1 colours, then every element can be coloured with a colour from ...
Woodall, DR, Hetherington, TJ
core  

Biophysical approaches for studying viral entry

open access: yesFEBS Letters, EarlyView.
Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley   +1 more source

Vertex and edge covers with clustering properties: complexity and algorithms [PDF]

open access: yes, 2009
We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning   +3 more
core   +1 more source

The Total Graph of a Commutative Semiring

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2013
We introduce and investigate the total graph of a commutative semiring with non-zero identity. The main purpose of this paper is to extend the definition and some results given in [2] to a more general semiring case.
Atani Shahabaddin Ebrahimi   +1 more
doaj   +1 more source

Total Weight Choosability of Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2011
Suppose the edges and the vertices of a simple graph $G$ are assigned $k$-element lists of real weights. By choosing a representative of each list, we specify a vertex colouring, where for each vertex its colour is defined as the sum of the weights of its incident edges and the weight of the vertex itself.
Jakub Przybylo, Mariusz Wozniak
openaire   +2 more sources

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

open access: yesFEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai   +4 more
wiley   +1 more source

Distributed Graph Simulation: Impossibility and Possibility [PDF]

open access: yes, 2014
This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin   +3 more
core  

Home - About - Disclaimer - Privacy