Results 131 to 140 of about 1,522,114 (310)

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

Establishing an assay to evaluate d‐amino acid oxidase enzyme kinetics and inhibition using WST‐8 redox dye

open access: yesFEBS Open Bio, EarlyView.
This study investigated a novel WST‐8‐based assay for evaluating d‐Amino acid oxidase (DAO) inhibitors. We confirmed its effectiveness using known inhibitors and found that uremic toxins possess relatively weak inhibitory activity compared to existing drugs.
Kahoko Miyake   +4 more
wiley   +1 more source

Modular edge colorings of Mycielskian graphs [PDF]

open access: yesTransactions on Combinatorics, 2015
Let G be a connected graph of order 3 or more and c:E(G)→Z k ‎ ‎(k≥2 ) a k -edge coloring of G where adjacent edges may be colored the same‎. ‎The color sum s(v) of a vertex v of G is the sum in Z k of the colors of the edges incident with v.
N. Paramaguru, R. Sampathkumar
doaj  

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs

open access: yesContemporary Mathematics and Applications (ConMathA)
Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir   +4 more
doaj   +1 more source

Screening and epitope characterization of Nidogen‐2‐specific nanobodies

open access: yesFEBS Open Bio, EarlyView.
Camel immunization and phage display were employed to generate high‐affinity VHH nanobodies against Nidogen‐2. After library construction, biopanning, ELISA screening, sequencing, and recombinant expression, selected nanobodies were purified and characterized, leading to the preliminary exploration of a nanobody‐based sandwich ELISA for specific ...
Jianchuan Wen   +9 more
wiley   +1 more source

YlmG1 is localized exclusively to the chloroplast envelope membrane and is involved in preprotein translocation in Arabidopsis thaliana

open access: yesFEBS Open Bio, EarlyView.
Cytosolically synthesized chloroplast preproteins are translocated across the outer and inner envelope membranes through translocons called TOC and TIC, respectively. In green algae and plants, the TIC core is composed of essential membrane proteins, Tic12, Tic20, and Tic214.
Mengyi Li, Xueyang Zhao, Masato Nakai
wiley   +1 more source

Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function

open access: yesFEBS Open Bio, EarlyView.
We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke   +4 more
wiley   +1 more source

Edge Cover Through Edge Coloring

open access: yesThe Electronic Journal of Combinatorics
Let $G$ be a multigraph. A subset $F$ of $E(G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$. The cover index, $\xi(G)$, is the largest number of edge covers into which the edges of $G$ can be partitioned. Clearly $\xi(G) \le \delta(G)$, the minimum degree of $G$.
Chen, Guantao, Shan, Songling
openaire   +1 more source

Large‐scale bidirectional arrayed genetic screens identify OXR1 and EMC4 as modifiers of αSynuclein aggregation

open access: yesFEBS Open Bio, EarlyView.
Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane   +11 more
wiley   +1 more source

Home - About - Disclaimer - Privacy