Results 111 to 120 of about 5,759,724 (297)
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
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 +8 more
wiley +1 more source
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
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 +3 more
wiley +1 more source
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 +6 more
wiley +1 more source
Forbidden subgraphs of TI-power graphs of finite groups
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
Automorphism group of certain power graphs of finite groups
The power graph $\mathcal{P}(G)$ of a group $G$ is the graphwith group elements as vertex set and two elements areadjacent if one is a power of the other. The aim of this paper is to compute the automorphism group of the power graph of several well-known
Ali Reza Ashrafi +2 more
doaj +1 more source
On powers of m-trapezoid graphs
The author introduces \(m\)-trapezoid graphs (\(m\)-TGs) as intersection graphs of \(m\)-trapezoids, where an \(m\)-trapezoid is given by \(m+ 1\) intervals on \(m+ 1\) parallel lines. (The class of 0-TGs is the class of interval graphs.) The main result concerns powers of graphs: If \(G^{k- 1}\) is an \(m\)-TG then \(G^k\) is also an \(m\)-TG.
openaire +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
Forcing (G,D)-number of a Graph [PDF]
By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple ...
Nagarajan, A. +3 more
core +1 more source
We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen +5 more
wiley +1 more source
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 +6 more
doaj +1 more source

