Results 131 to 140 of about 14,237 (338)
FEBS Open Bio, EarlyView.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
Equitable list coloring of planar graphs with given maximum degree [PDF]
, 2023 H. A. Kierstead +2 more
openalex +1 more source
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 +2 more
wiley +1 more source
Vestibular Patient Journey: Insights From Vestibular Disorders Association (VeDA) Registry
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Vestibular symptoms impose a high burden of disability. Understanding real‐world diagnostic and treatment pathways can identify care gaps and guide interventions. We aimed to characterize symptom profiles, diagnostic trends, provider involvement, and treatment patterns in vestibular disorders.
Ali Rafati +10 more
wiley +1 more source
Annals of Clinical and Translational Neurology, EarlyView.Epigenetic reprogramming in hematopoietic stem and progenitor cells (HSPCs) and downstream myeloid cells, mediated by H3.3 downregulation and endogenous retroelement (ERE) overexpression, contributes to the progression of multiple sclerosis (MS). ABSTRACT Background Skewed myelopoiesis in the bone marrow has been identified as a key driver of multiple ...
Li‐Mei Xiao +6 more
wiley +1 more source
List circular coloring of even cycles
, 2004 Suppose G is a graph and p >= 2q are positive integers. A color-list is a mapping L: V --> P(0, 1,...,p-1) which assigns to each vertex a set L(v) of permissible colors. An L-(p, q)-coloring of G is a (p, q)-coloring h of G such that for each vertex v, h(
Yang, Chung-ying
core
Elevated Connectivity During Language Processing Is Associated With Cognitive Performance in SeLECTS
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Self‐Limited Epilepsy with Centrotemporal Spikes (SeLECTS) is associated with language impairments despite seizures originating in the motor cortex, suggesting aberrant cross‐network interactions. Here we tested whether functional connectivity in SeLECTS during language tasks predicts language performance.
Wendy Qi +8 more
wiley +1 more source
On list coloring with separation of the complete graph and set system intersections
Electronic Journal of Graph Theory and ApplicationsWe consider the following list coloring with separation problem: Given a graph G and integers a, b, find the largest integer c such that for any list assignment L of G with |L(v)| = a for any vertex v and |L(u)∩L(v)| ≤ c for any edge uv of G, there ...
Jean-Christophe Godin +2 more
doaj +1 more source
Strong List Edge Coloring Of Subcubic Graphs [PDF]
, 2013 We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors ...
Miao, Zhengke +4 more
core