Results 101 to 110 of about 477,458 (300)
An example of a cut and minimum cut for 3 interrupted links.
, 2019 An example of a cut and minimum cut for 3 interrupted links.
Rostislav Vodák (6990071) +6 more
core +1 more source
FEBS Letters, EarlyView.Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura +2 more
wiley +1 more source
A Sufficient Condition for Graphs to Be Super K-Restricted Edge Connected
Discussiones Mathematicae Graph Theory, 2017 For a subset S of edges in a connected graph G, S is a k-restricted edge cut if G − S is disconnected and every component of G − S has at least k vertices.
Wang Shiying, Wang Meiyu, Zhang Lei
doaj +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Minimum Cuts of Distance-Regular Digraphs
The Electronic Journal of Combinatorics, 2017 In this paper, we investigate the structure of minimum vertex and edge cuts of distance-regular digraphs. We show that each distance-regular digraph $\Gamma$, different from an undirected cycle, is super edge-connected, that is, any minimum edge cut of $\Gamma$ is the set of all edges going into (or coming out of) a single vertex.
Saleh Ashkboos +3 more
openaire +2 more sources
, 2007 Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem.
Kolmogorov, V., Shioura, A.
core
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS 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
Aceh International Journal of Science and Technology, 2018 A research was conducted for the optimization of the turning process st 60 tool steel with multiple performance characteristics based on the orthogonal array with Taguchi-WPCA method.
Dian Ridlo Pamuji +4 more
doaj +1 more source
Minimum Stable Cut and Treewidth
Discrete Mathematics & Theoretical Computer ScienceA stable or locally-optimal cut of a graph is a cut whose weight cannot be increased by changing the side of a single vertex. In this paper we study Minimum Stable Cut, the problem of finding a stable cut of minimum weight. Since this problem is NP-hard, we study its complexity on graphs of low treewidth, low degree, or both.
openaire +5 more sources
The ubiquitin ligase RNF115 is required for the clearance of damaged lysosomes
FEBS Letters, EarlyView.Upon lysosomal rupture, an E3 ubiquitin ligase RNF115 translocates from the cytosol to the damaged lysosomal membrane. Moreover, RNF115 depletion impairs the clearance of damaged lysosomes, identifying it as a key regulator of lysosomal quality control.
Sae Nakanaga +3 more
wiley +1 more source