Results 91 to 100 of about 3,533,009 (320)
Dual targeting of AKT and mTOR using MK2206 and RAD001 reduces tumor burden in an intracardiac colon cancer circulating tumor cell xenotransplantation model. Analysis of AKT isoform‐specific knockdowns in CTC‐MCC‐41 reveals differentially regulated proteins and phospho‐proteins by liquid chromatography coupled mass spectrometry. Circulating tumor cells
Daniel J. Smit+19 more
wiley +1 more source
Quotient graphs for power graphs [PDF]
In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of one of its quotient graphs. Here we apply that procedure to the proper power graph \mathcal{P}_0(G) of a finite group
BUBBOLONI, DANIELA+2 more
openaire +4 more sources
The continuous and rapid growth of highly interconnected datasets, which are both voluminous and complex, calls for the development of adequate processing and analytical techniques.
Bonifati, Angela+2 more
core
An example of graph limits of growing sequences of random graphs
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary distribution ...
Janson, Svante, Severini, Simone
core +3 more sources
Inhibitor of DNA binding‐1 is a key regulator of cancer cell vasculogenic mimicry
Elevated expression of transcriptional regulator inhibitor of DNA binding 1 (ID1) promoted cancer cell‐mediated vasculogenic mimicry (VM) through regulation of pro‐angiogenic and pro‐cancerous genes (e.g. VE‐cadherin (CDH5), TIE2, MMP9, DKK1). Higher ID1 expression also increased metastases to the lung and the liver.
Emma J. Thompson+11 more
wiley +1 more source
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi+3 more
doaj +1 more source
Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, Pier Luigi+1 more
core +1 more source
Alectinib resistance in ALK+ NSCLC depends on treatment sequence and EML4‐ALK variants. Variant 1 exhibited off‐target resistance after first‐line treatment, while variant 3 and later lines favored on‐target mutations. Early resistance involved off‐target alterations, like MET and NF2, while on‐target mutations emerged with prolonged therapy.
Jie Hu+11 more
wiley +1 more source
The graphs cospectral with the pineapple graph
The pineapple graph is obtained by appending q pendant edges to a vertex of a complete graph. We prove that among connected graphs, the pineapple graph is determined by its adjacency spectrum. Moreover, we determine all disconnected graphs which are cospectral with a pineapple graph.
Sezer Sorgun+3 more
openaire +3 more sources