Results 101 to 110 of about 13,115 (262)
Hijacking emergency granulopoiesis: Neutrophil ontogeny and reprogramming in cancer
Neutrophils are highly plastic innate immune cells; their functions in cancer extend beyond the tumour microenvironment. This Review summarises current understanding of neutrophil maturation and heterogeneity and highlights tumour‐induced granulopoiesis as a systemic programme that expands immature, immunosuppressive neutrophils via tumour‐derived ...
Gabriela Marinescu, Yi Feng
wiley +1 more source
Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Signed total strong Roman domination in graphs [PDF]
Maryam Hajjari +1 more
doaj +1 more source
Partial Total Domination in Hypergraphs
This paper establishes fundamental results for partial total domination in hypergraphs. We present tight bounds for the partial total domination number in k-uniform hypergraphs, demonstrate relationships with classical domination parameters, and provide ...
Abdulkafi Sanad, Chaoqian Li
doaj +1 more source
Characterization of Cubic Graphs G with irt(G) = Irt(G) = 2
A subset S of vertices in a graph G is called a total irredundant set if, for each vertex v in G, v or one of its neighbors has no neighbor in S −{v}. The total irredundance number, ir(G), is the minimum cardinality of a maximal total irredundant set of ...
Eslahchi Changiz +2 more
doaj +1 more source
Improved Total Domination and Total Roman Domination in Unit Disk Graphs
Let $G=(V, E)$ be a simple undirected graph with no isolated vertex. A set $D_t\subseteq V$ is a total dominating set of $G$ if $(i)$ $D_t$ is a dominating set, and $(ii)$ the set $D_t$ induces a subgraph with no isolated vertex. The total dominating set of minimum cardinality is called the minimum total dominating set, and the size of the minimum ...
Sasmita Rout, Gautam Kumar Das
openaire +2 more sources
Ixazomib inhibits proteasome‐mediated degradation of topoisomerase I induced by irinotecan, thereby restoring drug sensitivity and promoting tumor cell death in colorectal cancer. Irinotecan, a topoisomerase I (topoI) inhibitor, is widely used for colorectal cancer, but resistance remains a major clinical challenge.
Yuho Ebata +10 more
wiley +1 more source
Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source

