Results 111 to 120 of about 445,292 (276)
Neighbor Sum Distinguishing Total Choice Number of IC-Planar Graphs Without 4-Cycles
A neighbor sum distinguishing (NSD) total coloring of a graph G is a mapping ϕ:T(G)=V(G)∪E(G)→{1,2,⋯,k} such that any two adjacent or incident elements in T(G) receive different colors, and the sum of the colors of all incident edges of u and the color ...
Meili Ye, Donghan Zhang
doaj +1 more source
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
Phosphoinositides and inositol phosphates as molecular glues
Inositol phosphates (IPs) and phosphoinositides (PIPs) regulate diverse eukaryotic processes. Beyond recruiting signaling proteins or acting as structural cofactors, recent studies suggest they mediate protein–protein interactions as natural molecular glues.
Aleshia Seaton‐Terry +9 more
wiley +1 more source
Bounding the distinguishing number of infinite graphs and permutation groups [PDF]
A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k cells such that only the identity permutation in G fixes setwise all of the cells of the partition.
Mark E. Watkins (17209468) +1 more
core +2 more sources
Inositol pyrophosphates are energy‐rich signaling molecules that perform critical functions in cells. Three different families of phosphatases hydrolyze the β phosphate of the inositol pyrophosphate molecules: two have narrow specificities and one is promiscuous.
Ronda J. Rolfes
wiley +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
The Determining Number and Cost of 2-Distinguishing of Select Kneser Graphs [PDF]
A graph $G$ is said to be \emph{d-distinguishable} if there exists a not-necessarily proper coloring with $d$ colors such that only the trivial automorphism preserves the color classes.
Garrison, James E
core +1 more source
Design and analysis strategies for robust microbiome ageing research
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Number of SNPs distinguishing pairs of strains identified in 3,453,192 bp. [PDF]
Number of SNPs distinguishing pairs of strains identified in 3,453,192 bp.
Maria C. Taratufolo (166040) +8 more
core +1 more source
Investigating transcription factor dynamics in health and disease using FRAP
FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source

