Results 71 to 80 of about 2,418,413 (302)
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
Distance-Preserving Graph Compression Techniques
Journal of Graph Algorithms and ApplicationsWe study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph $G = (V, E)$ with non-negative weights and a subset of edges $E^{\prime} \subset E$, which needs to be removed from G (with
Amirali Madani, Anil Maheshwari
doaj +1 more source
Degree Distance of Zero-Divisor Graph Г[Z_n ]
Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2020 In this article, degree distance of zero-divisor graph Г[Z_n ] is computed for n=p^2,n=pq and n=p^3, where p,q are distinct prime numbers.
N.feyza Yalçın
doaj +1 more source
Information Sciences, 2018 Ministerio de Ciencia e Innovación ECO2013-17766 ...
José Manuel, Gallardo +2 more
openaire +4 more sources
Spectral distances on graphs [PDF]
Discrete Applied Mathematics, 2015 25 pages, 12 ...
Jiao Gu, Bobo Hua, Shiping Liu
openaire +3 more sources
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
Random graph models for wireless communication networks [PDF]
, 2010 PhDThis thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802:11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver.
Song, Linlin
core +4 more sources
Distance-Regular Graphs and Halved Graphs
European Journal of Combinatorics, 1986 Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire +3 more sources
On the rotation distance of graphs
Discrete Mathematics, 1994 Let \(G\) be a simple undirected graph and suppose that \((x,y)\in E(G)\) and \((x,y')\not\in E(G)\). Then the rotation of \((x,y)\) about \(x\), denoted by \(r= (y,x,y')\) is the operation of removing \((x,y)\) and inserting \((x,y')\) as an edge. The resulting graph is denoted by \(G(r)\). A graph \(G\) can be rotated into a graph \(H\) if there is a
Ralph J. Faudree +4 more
openaire +2 more sources
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source