Results 71 to 80 of about 157,845 (305)
Molecular Oncology, EarlyView.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
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
Molecular Oncology, EarlyView.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
On $[1,2]$-Domination in Interval and Circle Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA subset $S$ of vertices in a graph $G=(V, E)$ is a Dominating Set if each vertex in $V(G)\setminus S$ is adjacent to at least one vertex in $S$. Chellali et al.
Mohsen Alambardar Meybodi +1 more
doaj +1 more source
Algorithms for optimal min hop and foremost paths in interval temporal graphs
Applied Network Science, 2022 Path problems are fundamental to the study of graphs. Temporal graphs are graphs in which the edges connecting the vertices change with time. Min hop paths problem in a temporal graph is the problem of finding time respecting paths from source vertex to ...
Anuj Jain, Sartaj K. Sahni
doaj +1 more source
On list colouring and list homomorphism of permutation and interval graphs [PDF]
, 2014 List coloring is an NP-complete decision problem even if the total number of colors is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list coloring of permutation graphs with a bounded total number of ...
Tardos, Gábor +2 more
core +1 more source
Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma
Molecular Oncology, EarlyView.Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski +10 more
wiley +1 more source
A Novel Study of Graphs Based on m-Polar Cubic Structures
Journal of Function Spaces, 2022 By combining the notions of interval-valued m-polar fuzzy graphs and m-polar fuzzy graphs, the notion of m-polar cubic graphs is first introduced. Then, the degree of a vertex in m-polar cubic graphs and complete m-polar cubic graphs is defined.
G. Muhiuddin +4 more
doaj +1 more source
Molecular Oncology, EarlyView.BCL9 and BCL9L drive bladder cancer progression by enhancing β‐catenin signaling, promoting proliferation, migration, invasion, and organoid growth. Genetic depletion of BCL9(L) suppresses malignant phenotypes, while pharmacological disruption of the β‐catenin/BCL9(L) complex with ZW4864 inhibits canonical Wnt signaling and tumor‐associated cellular ...
Roland Kotolloshi +11 more
wiley +1 more source
The upper chromatic number of quasi-interval co-hypergraphs
Le Matematiche, 1997 We investigate the structural and colouring properties of clique hyper-graphs of interval graphs called the quasi-interval hypergraphs. We find the conditions when they are interval hypergraphs. The upper chromatic number for the clique co-hypergraphs of
Violeta Prisakaru
doaj
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core