Results 151 to 160 of about 641,529 (298)
Acyclic Edge Coloring Of Graphs [PDF]
A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called the chromatic index of Gand is ...
Basavaraju, Manu
core
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Abruptly changing from aerobic to anaerobic conditions (sudden anaerobization) induced growth inhibition and a significant increase in intracellular labile ferrous iron in the aerotolerant anaerobe Amphibacillus xylanus. We found that free flavins mediate efficient electron transfer from NADH to ferric iron under anaerobic conditions, suggesting that ...
Shinya Kimata +13 more
wiley +1 more source
Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture [PDF]
Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture provides an overview of the current state of the science ...
Scheide, Diego +3 more
core
The crystal structure of Borrelia burgdorferi nicotinamidase (PncA/BBE22) reveals the correct full‐length protein initiated from a non‐canonical AUU start codon. The structure validates previous biochemical findings and resolves a long‐standing annotation error, demonstrating that the truncated database sequence is structurally incompatible with the ...
Kalvis Brangulis
wiley +1 more source
Edge-locating coloring of graphs
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.
Meysam Korivand +3 more
doaj +1 more source
Directed evolution of enzymes at the crossroads of tradition and innovation
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 +2 more
wiley +1 more source
Vertex Coloring Edge-Weighting of Coronation by Path Graphs [PDF]
In this paper, we study vertex coloring edge of corona graph. A k-edge weigting of graph G is mapping w : (EG) ! f1; 2; ; kg. An edge-weighting w induces a vertex coloring Fw : V (G) ! N de ned by fw(v) = P v2e w(e).
KRISTIANA, Arika Indah +5 more
core
Guiding AlphaFold to predict how Munc13‐1 opens Syntaxin‐1
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 +2 more
wiley +1 more source
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source

