Results 91 to 100 of about 119,419 (266)
Molecular Oncology, EarlyView.Radiotherapy (RT) response depends on the DNA repair capacity of tumor and host cells. We show that circulating tumor cell (CTC) counts and apoptosis rates before and after RT predict treatment response and outcome, which can be accessed via easily accessible liquid biopsy approaches. Created in BioRender. Wikman, H.
Yvonne Goy +10 more
wiley +1 more source
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
Molecular 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 certain regular graphs of girth 5
International Journal of Mathematics and Mathematical Sciences, 1984 Let f(v,5) be the number of vertices of a (v,5)-cage (v≥3). We give an upper bound for f(v,5) which is considerably better than the previously known upper bounds. In particular, when v=7, it coincides with the well-known Hoffman- Singleton graph.
M. O'keefe, P. K. Wong
doaj +1 more source
Discrete Mathematics, 1996 A monoid which is von Neumann regular is called orthodox if its idempotents form a submonoid. A graph is called (End)-regular or (End)-orthodox if its monoid of graph endomorphisms is a (von Neumann) regular or orthodox monoid. Here graph endomorphisms are mappings of the vertex set which preserve edges.
openaire +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
Handicap Labelings of 4-Regular Graphs
Advances in Electrical and Electronic Engineering, 2017 Let G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same
Petr Kovar +3 more
doaj +1 more source
Discrete Mathematics, 2003 The author proves that the endomorphism monoid of \(\overline{C_n}\) \((n\geq 3)\) is regular where \(\overline{C_n}\) denotes the complement graph of a undirected cycle of \(n\) vertices. It is noted that \(\text{End}(\overline{C_6})\) is not an orthodox monoid.
openaire +1 more source
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Molecular Oncology, EarlyView.Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source
Maximum Hypergraphs without Regular Subgraphs
Discussiones Mathematicae Graph Theory, 2014 We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2n−1+r−2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2n−1 ...
Kim Jaehoon, Kostochka Alexandr V.
doaj +1 more source