Results 61 to 70 of about 96,525 (309)
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
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
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
Abstract Abstract A graph G , is λ-regular-stable if it has at least a maximum independent set I , such that for ∀ v ∈ V(G)\I , the number of vertices in NG(V) , ⨆ I , is constant, and equal to λ. Here we give some results for this class of graphs.
Barbosa, R., Cardoso, D.M.
openaire +2 more sources
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +1 more source
End-Completely-Regular and End-Inverse Lexicographic Products of Graphs
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X) is completely regular (resp., inverse). In this paper, we will show that if X[Y] is End-completely-regular (resp., End-inverse), then both X and Y are ...
Hailong Hou, Rui Gu
doaj +1 more source
On Locating-Dominating Set of Regular Graphs
Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈
Anuwar Kadir Abdul Gafur +1 more
doaj +1 more source
Distance-Regular Graphs and Halved Graphs
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 +2 more sources
Factorizing regular graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On induced matchings as star complements in regular graphs [PDF]
We determine all the finite regular graphs which have an induced matching or a cocktail party graph as a star ...
Rowlinson, Peter
core +1 more source
Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic +5 more
wiley +1 more source

