Results 91 to 100 of about 86,037 (264)

Longitudinal circulating tumor DNA profiling in patients with advanced endometrial cancer using an off‐the‐shelf targeted NGS panel

open access: yesMolecular Oncology, EarlyView.
Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena   +15 more
wiley   +1 more source

Colorings of plane graphs: A survey

open access: yesDiscrete Mathematics, 2013
Abstract After a brief historical account, a few simple structural theorems about plane graphs useful for coloring are stated, and two simple applications of discharging are given. Afterwards, the following types of proper colorings of plane graphs are discussed, both in their classical and choosability (list coloring) versions: simultaneous ...
openaire   +1 more source

Metastasis on pause: How dormant tumor cells stay hidden within the tumor microenvironment and evade immune surveillance

open access: yesMolecular Oncology, EarlyView.
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

A Note On Vertex Colorings Of Plane Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
Given an integer valued weighting of all elements of a 2-connected plane graph G with vertex set V , let c(v) denote the sum of the weight of v ∈ V and of the weights of all edges and all faces incident with v.
Fabricia Igor   +2 more
doaj   +1 more source

Decomposing plane cubic graphs

open access: yesEuropean Journal of Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenta Ozeki, Dong Ye 0002
openaire   +2 more sources

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

open access: yesMolecular 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

A note on face coloring entire weightings of plane graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _.
Jendrol Stanislav, Šugerek Peter
doaj   +1 more source

New Results of Face Labeling for Some Plane Graphs

open access: yesIEEE Access, 2019
A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that ...
Nabila Hameed   +4 more
doaj   +1 more source

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

open access: yesMolecular Oncology, EarlyView.
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

On the Weight of Minor Faces in Triangle-Free 3-Polytopes

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The weight w(f) of a face f in a 3-polytope is the degree-sum of vertices incident with f. It follows from Lebesgue’s results of 1940 that every triangle-free 3-polytope without 4-faces incident with at least three 3-vertices has a 4-face with w ≤ 21 or ...
Borodin Oleg V., Ivanova Anna O.
doaj   +1 more source

Home - About - Disclaimer - Privacy