Results 101 to 110 of about 473,067 (264)

Mycobacterial cell division arrest and smooth‐to‐rough envelope transition using CRISPRi‐mediated genetic repression systems

open access: yesFEBS Open Bio, EarlyView.
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point   +7 more
wiley   +1 more source

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

open access: yesFEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei   +3 more
wiley   +1 more source

Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj   +1 more source

On the strong metric generators of strong product graphs

open access: yes, 2013
12 ...
Kuziak, Dorota   +2 more
openaire   +2 more sources

On the strong metric dimension of corona product graphs and join graphs

open access: yesDiscrete Applied Mathematics, 2013
Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving set for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $W$.
Dorota Kuziak   +2 more
openaire   +5 more sources

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

open access: yesFEBS 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   +8 more
wiley   +1 more source

Product Operations on Pythagorean Co-Neutrosophic Graphs and its Application [PDF]

open access: yesNeutrosophic Sets and Systems
Pythagorean Co-Neutrosophic Graphs (PyCNGs) have newly emerged after the foundation of Pythagorean fuzzy graph and Co-neutrosophic graphs, where the membership of indeterminacy(uncertain) is independent and membership of truth(existence) & false(non ...
G. Vetrivel, M. Mullai , G. Rajchakit
doaj   +1 more source

YIPFα1A expression is regulated by multilayered molecular mechanisms

open access: yesFEBS Open Bio, EarlyView.
YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji   +2 more
wiley   +1 more source

Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens

open access: yesFEBS 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   +3 more
wiley   +1 more source

On generalized 3-connectivity of the strong product of graphs

open access: yesApplicable Analysis and Discrete Mathematics, 2018
Let G be a connected graph with n vertices and let k be an integer such that 2 ? k ? n. The generalized connectivity kk(G) of G is the greatest positive integer l for which G contains at least l internally disjoint trees connecting S for any set S ? V (G) of k vertices.
Abajo, Encarnación   +3 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy