Results 91 to 100 of about 7,350,988 (308)
On Cotree-Critical and DFS Cotree-Critical Graphs
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph Algorithm Library and Editor []) by the authors, and deduce a justification ...
Hubert de Fraysseix +1 more
doaj +1 more source
Centralizers in graph products of groups
Graph products of groups generalize both free and direct products of groups just as graph groups generalize both free and free Abelian groups. For graph groups the centralizer is known to be itself a graph group [see \textit{H. Servatius}, J. Algebra 126, No. 1, 34-60 (1989; Zbl 0682.20022)].
openaire +2 more sources
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
Scientific Knowledge Graph and Trend Analysis of Central Sensitization: A Bibliometric Analysis
Zhuo Li,1,2,* Chi Xu,2,* Jun Fu,2 Maimaiti Zulipikaer,2 Tao Deng,2 Jiying Chen2 1School of Medicine, Nankai University, Tianjin, People’s Republic of China; 2Department of Orthopedic Surgery, Chinese PLA General Hospital, Beijing, People’s ...
Li Z +5 more
doaj
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
On the Complexity of Stacked Graphs Associated with Paths and Cycles
The complexity of a graph, defined as its number of spanning trees, serves as a key measure of network reliability. Stacked graphs constitute a significant and versatile class of graphs, formed by superimposing multiple copies of a base graph upon a ...
Salama Nagy Daoud, Ahmad Asiri
doaj +1 more source
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
Central partition for a partition-distance and strong pattern graph
When several clustering algorithms are applied to a dataset E or the same algorithm with different parameters, we get several different partitions of the dataset.
Joaquim F. Pinto da Costa , P.R. Rao
doaj +1 more source
Project centralization based on graph coloring
Version conflicts are common in a component-based system, where each component is developed and managed independently. Changes during the life-cycle of components require multiple versions to coexist. This creates a challenge in representing multiple versions for program analysis tools and execution platforms that are designed to handle only one ...
Ma, Lei, Artho, Cyrille, Sato, Hiroyuki
openaire +3 more sources
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis +3 more
wiley +1 more source

