Results 101 to 110 of about 2,525,419 (350)
Shotgun Assembly of Labeled Graphs
IEEE Transactions on Network Science and Engineering, 2019 Ver3: 23 pages, matches published version but with a corrected proof of Theorem 4.5 (result unchanged); Ver2: 22 pages; Ver1: 21 ...
Mossel, E, Ross, N
openaire +3 more sources
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
Labeling angles of planar graphs
Discrete Mathematics, 1988 By a well-known theorem of Heawood, 3-edge-coloring bridgeless planar cubic graphs is equivalent to labeling vertices with \(+1\) or -1 so that the sum around any face is 0(mod 3). The authors introduce the notion of ``angle-labeling'' and prove results analogous to Heawood's for bridgeless planar graphs with vertices of degree 2 or 3; the angles and ...
Loupekine, Feodor, Watkins, John J.
openaire +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
Opuscula Mathematica, 2009 We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\). This notion generalizes the \(\alpha\)-labeling introduced in 1967 by A. Rosa.
openaire +1 more source
Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells
Molecular Oncology, EarlyView.Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son +13 more
wiley +1 more source
Enumeration of labelled chain graphs and labelled essential directed acyclic graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Molecular Oncology, EarlyView.We developed a cost‐effective methylation‐specific droplet digital PCR multiplex assay containing tissue‐conserved and tumor‐specific methylation markers. The assay can detect circulating tumor DNA with high accuracy in patients with localized and metastatic colorectal cancer.
Luisa Matos do Canto +8 more
wiley +1 more source
Molecular Oncology, EarlyView.Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source