Results 51 to 60 of about 41,334 (304)
Zhejiang Daxue xuebao. Lixue ban, 2017 A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj +1 more source
FEBS Letters, EarlyView.Multidrug transporters BpeB and BpeF from the Gram‐negative pathogen Burkholderia pseudomallei have a hydrophilic patch in their substrate‐binding pocket. Drug susceptibility tests and growth curve analyses using an Escherichia coli recombinant expression system revealed that the hydrophilic patches of BpeB and BpeF are involved in the substrate ...
Ui Okada, Satoshi Murakami
wiley +1 more source
Retinal Processes in Total Color Blindness
The Tohoku Journal of Experimental Medicine, 1957 Retinal processes in two typical achromats were investigated. by the method of electrostimulation. From measurements of time courses of electrical excitability of the eye following a brief illumination, two kinds of process were distinguished. 1. The time courses of the two processes showed no dependence on wavelengths of lights, and their magnitudes ...
K, MOTOKAWA, T, AIZAWA
openaire +3 more sources
All totally symmetric colored graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Graph Theory In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs.
Grech, Mariusz, Kisielewicz, Andrzej
openaire +5 more sources
Function‐driven design of a surrogate interleukin‐2 receptor ligand
FEBS Letters, EarlyView.Interleukin (IL)‐2 signaling can be achieved and precisely fine‐tuned through the affinity, distance, and orientation of the heterodimeric receptors with their ligands. We designed a biased IL‐2 surrogate ligand that selectively promotes effector T and natural killer cell activation and differentiation. Interleukin (IL) receptors play a pivotal role in
Ziwei Tang +9 more
wiley +1 more source
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
FEBS Letters, EarlyView.Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source
PICALM::MLLT10 translocated leukemia
FEBS Letters, EarlyView.This comprehensive review of PICALM::MLLT10 translocated acute leukemia provides an in‐depth review of the structure and function of CALM, AF10, and the fusion oncoprotein (1). The multifaceted molecular mechanisms of oncogenesis, including nucleocytoplasmic shuttling (2), epigenetic modifications (3), and disruption of endocytosis (4), are then ...
John M. Cullen +7 more
wiley +1 more source
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
Discussiones Mathematicae Graph Theory, 2020 A graph G is edge k-choosable (respectively, total k-choosable) if, whenever we are given a list L(x) of colors with |L(x)| = k for each x ∈ E(G) (x ∈ E(G) ∪ V (G)), we can choose a color from L(x) for each element x such that no two adjacent (or ...
Sun Lin +3 more
doaj +1 more source