Results 91 to 100 of about 280,140 (285)
Edge-labeling Graph Neural Network for Few-shot Learning
, 2019 In this paper, we propose a novel edge-labeling graph neural network (EGNN), which adapts a deep neural network on the edge-labeling graph, for few-shot learning.
Kim, Jongmin +3 more
core +1 more source
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 ...
Elchanan Mossel, Nathan Ross
openaire +3 more sources
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 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
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
Molecular Oncology, EarlyView.This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source
AKCE International Journal of Graphs and Combinatorics, 2018 A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho, T. Singh
doaj +2 more sources
Applied Mathematics and Computation, 2019 It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes.
Xiaxia Guan +4 more
openaire +3 more sources
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source
Sigma Partitioning: Complexity and Random Graphs
, 2018 A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors in $P_i$. The
Ahadi, Arash +2 more
core +1 more source
Molecular Oncology, EarlyView.We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source