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

Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae

FEBS Open Bio, EarlyView.
Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj, Eline M. F. de Lange, Klaas A. Sjollema, Ben N. G. Giepmans   +3 more
wiley   +1 more source

Polarization‐resolved femtosecond Vis/IR spectroscopy tailored for resolving weak signals in biological samples using minimal sample volume

FEBS Open Bio, EarlyView.
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley   +1 more source

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

FEBS 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, Fredrik Orädd, Konstantinos Magkakis, Magnus Andersson   +3 more
wiley   +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

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

FEBS 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, Yuki Enoki, Yuka Nakazawa, Kazuaki Taguchi, Kazuaki Matsumoto   +4 more
wiley   +1 more source

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

Computer 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

FEBS 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, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

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

Contemporary 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, Dafik, Robiatul Adawiyah, Rafiantika Megahnia Prihandini, Arika Indah Kristiana   +4 more
doaj   +1 more source

Modular edge colorings of Mycielskian graphs [PDF]

Transactions 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  

Screening and epitope characterization of Nidogen‐2‐specific nanobodies

FEBS 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, Qianqian Cui, Zhongyun Lan, Yingjun Wang, Shuaiying Zhao, Wenxuan Feng, Yunfeng Liu, Qiting Huang, Dongna Zhang, Jianfeng Xu   +9 more
wiley   +1 more source