Results 111 to 120 of about 159,016,183 (278)
CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens +8 more
wiley +1 more source
An experimental evidence on the validity of third Smarandache conjecture on primes [PDF]
In this note v.e report the results regarding ,he check of the third Smarandache conjecture on ...
Russo, Felice
core +1 more source
Reconstructing enzyme evolution by protein engineering
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj +1 more source
Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions
The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang +4 more
wiley +1 more source
An extremal problem on potentially K p,1,1-graphic sequences
A sequence S is potentially K p,1,1 graphical if it has a realization containing a K p,1,1 as a subgraph, where K p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj
Natural Numbers Generalized Parity, and the Collatz Algorithm
An extended definition of the even-odd property for natural numbers is used to highlightprime numbers in their classification. For a given natural number $M$ and a chosen prime$P$, one can say that $PM$ is $P$-even-like, and $PM+K$, with$K = [1, 2 ...
Ramon Carbó-Dorca
doaj +1 more source
We consider conformal N = 2 $$ \mathcal{N}=2 $$ super Yang-Mills theories with gauge group SU(N) and N f = 2N fundamental hypermultiplets in presence of a circular 1/2-BPS Wilson loop. It is natural to conjecture that the matrix model which describes the
M. Billò +3 more
doaj +1 more source
Structure‐forward targeting of claudins with synthetic binders
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
On Independent Domination in Planar Cubic Graphs
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S.
Abrishami Gholamreza +2 more
doaj +1 more source

