Results 101 to 110 of about 3,157 (213)

Forbidden subgraphs of TI-power graphs of finite groups

Open Mathematics
Given a finite group GG with identity ee, the TI-power graph (trivial intersection power graph) defined on GG, denoted by Γ(G)\Gamma \left(G), is an undirected graph with vertex set GG where distinct vertices aa and bb are adjacent if ⟨a⟩∩⟨b⟩={e}\langle ...
Li Huani, Chen Jin, Lin Shixun
doaj   +1 more source

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

FEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli, Mohammad Nour Alsamsam, Ugnė Bagdonaitė, Van Truc Vu, Chun‐Jen Huang, Polina Kuzhir, Mindaugas Zaremba, Aurimas Kopūstas, Marijonas Tutkus   +8 more
wiley   +1 more source

Identifying gene expression signatures for risk stratification of postoperative adjuvant chemotherapy in colorectal cancer

FEBS Open Bio, EarlyView.
A novel signature integrating genome‐wide analysis with clinical factors predicts recurrence in stage II colorectal cancer and enables a new risk stratification to guide postoperative adjuvant chemotherapy. Clinical risk stratification for postoperative recurrence in patients with pathological stage II (pStage II) colorectal cancer (CRC) is essential ...
Mayuko Otomo, Keisuke Okuno, Shuichi Watanabe, Sakiko Oba, Hiroyasu Kagawa, Masanori Tokunaga, Daisuke Ban, Yusuke Kinugasa   +7 more
wiley   +1 more source

Efficient State Estimation Through Rapid Topological Analysis Based on Spatiotemporal Graph Methodology

IEEE Open Access Journal of Power and Energy
The seamless integration of swift and precise topological analysis with state estimation is crucial for ensuring the dependability, stability, and efficiency of the power system.
Zhen Dai, Shouyu Liang, Yachen Tang, Jun Tan, Guangyi Liu, Qinyu Feng, Xuanang Li   +6 more
doaj   +1 more source

The Shannon Capacity of Graph Powers

IEEE Transactions on Information Theory
For a graph $G$, its $k$-th graph power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$. We consider the problem of deriving upper bounds on the Shannon capacity of graph powers by using spectral graph theory and linear optimization methods.
Aida Abiad, Cristina Dalfó, Miguel Angel Fiol   +2 more
openaire   +3 more sources

Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens

FEBS Open Bio, EarlyView.
Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee, Giulia Zanetti, Bram van den Broek, Kees Jalink   +3 more
wiley   +1 more source

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

FEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong, Yuhei Hosokawa, Lars Oliver Essen, Manuel Maestre‐Reyna   +3 more
wiley   +1 more source

On colorings of graph fractional powers

Discrete Mathematics, 2010
\noindent Let $G$ be a simple graph. For any $k\in N$, the $k-$power of $G$ is a simple graph $G^k$ with vertex set $V(G)$ and edge set $\{xy:d_G(x,y)\leq k\}$ and the $k-$subdivision of $G$ is a simple graph $G^{\frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$.
openaire   +3 more sources

Treatment with KCL‐286, a first‐in‐class retinoic acid receptor‐β (RARβ) agonist, ameliorates neuronal DNA damage and inflammation in a mouse model of Alzheimer's disease

FEBS Open Bio, EarlyView.
Repair of neuronal DNA damage in Alzheimer's disease by KCL‐286. (A) Amyloid‐β oligomers and plaques impair neuronal DNA repair pathways, leading to DNA double‐strand breaks and glial activation. (B) KCL‐286 activates RARβ/RXR signalling via retinoic acid response elements (RAREs), associated with increased BRCA1 expression, enhanced DNA repair and ...
Natasha Hill, Hassan Yousef Othman AlMuallim, Elouisa Maddock, Carl Hobbs, Earl Clarke, Maria B. Goncalves, Jonathan P. T. Corcoran   +6 more
wiley   +1 more source

Spatiotemporal Data Graph Modeling and Exploration of Application Scenarios in “Power Grid One Graph”

CSEE Journal of Power and Energy Systems
By modeling the spatiotemporal data of the power grid, it is possible to better understand its operational status, identify potential issues and risks, and take timely measures to adjust and optimize the system. Compared to the bus-branch model, the node-
Peng Li, Zhen Dai, Yachen Tang, Guangyi Liu, Jiaxuan Hou, Qinyu Feng, Quanchen Lin   +6 more
doaj   +1 more source