Results 141 to 150 of about 978,529 (303)

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

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  

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

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  

Edge-locating coloring of graphs

Electronic Journal of Graph Theory and Applications
An edge-locating coloring of a simple connected graph $G$ is a partition of its edge set into matchings such that the vertices of $G$ are distinguished by the distance to the matchings. The minimum number of the matchings of $G$ that admits an edge-locating coloring is the edge-locating chromatic number of $G$, and denoted by $χ'_L(G)$.
Meysam Korivand, Doost Ali Mojdeh, Edy Tri Baskoro, Ahmad Erfanian   +3 more
openaire   +3 more sources

Edge coloring lattice graphs

We develop the theory of the edge coloring of lattice graphs. A central role is played by a necessary and sufficient condition for a proper edge coloring of a patch of a lattice graph to induce a proper edge coloring of the entire lattice graph by ...
Kattemölle, Joris
core   +1 more source

Directed evolution of enzymes at the crossroads of tradition and innovation

FEBS Open Bio, EarlyView.
An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova, Andrej Mirossay, Erik Sedlak   +2 more
wiley   +1 more source

Graphs and colors : edge-colored graphs, edge-colorings and proper connections

Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre Dans cette thèse nous étudions différents problèmes de graphes et multigraphes arêtes-coloriés tels que la connexité propre, la coloration forte d'arêtes et les chaînes et cycles hamiltoniens propres.
openaire   +2 more sources

Guiding AlphaFold to predict how Munc13‐1 opens Syntaxin‐1

FEBS Open Bio, EarlyView.
The syntaxin‐1 Habc‐domain (orange), linker (pink) and SNARE motif (yellow) form a closed conformation that binds to Munc18‐1 (violet) and is opened by the Munc13‐1 MUN domain (cyan) to form the SNARE complex that triggers neurotransmitter release.
Madhurima Chattopadhyay, Junjie Xu, Josep Rizo   +2 more
wiley   +1 more source