Results 111 to 120 of about 1,185,468 (303)
Drosophila park mutants serve as a model for Parkinson's disease. We used this strain to investigate the connection between oxidative stress and the circadian clock mechanism. We showed that increased oxidative stress affects the physiology of pacemaker cells, disrupting their daily structural plasticity. Lack of rhythmic signaling from pacemaker cells
Kamila Zientara +3 more
wiley +1 more source
A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs
The generalized k-connectivity κk(G) of a graph G, mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity. As a natural counterpart of this concept, Li et al.
Sun Yuefang
doaj +1 more source
Bootstrap Percolation in Strong Products of Graphs
Given a graph $G$ and assuming that some vertices of $G$ are infected, the $r$-neighbor bootstrap percolation rule makes an uninfected vertex $v$ infected if $v$ has at least $r$ infected neighbors. The $r$-percolation number, $m(G,r)$, of $G$ is the minimum cardinality of a set of initially infected vertices in $G$ such that after continuously ...
Bostjan Bresar, Jaka Hedzet
openaire +3 more sources
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
Computing strong articulation points and strong bridges in large scale graphs
Let G = (V,E) be a directed graph. A vertex v ∈ V (respectively an edge e ∈ E) is a strong articulation point (respectively a strong bridge) if its removal increases the number of strongly connected components of G.
A. Orlandi +22 more
core +1 more source
The Restricted Edge-Connectivity of Strong Product Graphs
The restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each component has at least two vertices.
Hazhe Ye, Yingzhi Tian
doaj +1 more source
Products of Extra Strong Świa̧tkowski Functions
For a real-valued function \(f\) defined on a non-degenerate interval \(I\), let \({\mathcal C}(f)\) denote the set of points of continuity of \(f\). Then \(f\) is called a strong Świątkowski function if for all \(\alpha,\beta\in I\) and \(y \in (f(\alpha),f(\beta))\) there is an \(x_0\in (\alpha,\beta) \cap {\mathcal C}(f)\) such that \(f(x_0)=y ...
openaire +3 more sources
CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens +8 more
wiley +1 more source
On the strong metric generators of strong product graphs
12 ...
Kuziak, Dorota +2 more
openaire +2 more sources
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source

