Results 101 to 110 of about 9,430 (262)

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

Even edge colorings of a graph

open access: yesJournal of Combinatorial Theory, Series B, 1983
AbstractIt is shown that the maximum number of colors needed to paint the edges of a connected graphG of orderp so that in every cycle ofG there is a nonzero even number of edges of at least one color isp−1. A study on the minimum number of colors to edge-colorG under the same requirement seems to be more promising.
openaire   +1 more source

Promiscuous stimulation of HSP70 ATPase activity by parasite‐derived J‐domains

open access: yesFEBS Open Bio, EarlyView.
The malaria parasite Plasmodium falciparum exports three highly homologous yet functionally divergent J‐domain proteins into human erythrocytes. Here, we show that J‐domains isolated from all three proteins effectively stimulate the ATPase activity of both endogenous host and exported parasite HSP70 chaperones.
Julian Barth   +6 more
wiley   +1 more source

A Biased Edge Coloring Game

open access: yesDiscrete Applied Mathematics
fixed an error; did some minor ...
openaire   +2 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

Kernels in edge-colored digraphs

open access: yesDiscrete Mathematics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +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

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types [PDF]

open access: yesComputer Science Journal of Moldova, 2003
We consider the coloring of edges in a graph in which there are vertices of three types. In a feasible edge coloring, each vertex of the first type is incident with at least two edges of the same color, and each vertex of the second type with at least ...
Zsolt Tuza, Vitaly Voloshin
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

Home - About - Disclaimer - Privacy