Results 71 to 80 of about 142,988 (312)

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular 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

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

open access: yesMolecular 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

Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer

open access: yesMolecular Oncology, EarlyView.
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

Omega Index of Line and Total Graphs

open access: yesJournal of Mathematics, 2021
A derived graph is a graph obtained from a given graph according to some predetermined rules. Two of the most frequently used derived graphs are the line graph and the total graph.
Musa Demirci   +3 more
doaj   +1 more source

The graph isomorphism problem on geometric graphs [PDF]

open access: yes, 2013
The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it's time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm
Ryuhei Uehara, Uehara, Ryuhei
core   +1 more source

Dual PI3K/AKT and CDK4/6 inhibition reveals selective sensitivity in an SHH medulloblastoma stem cell model

open access: yesMolecular Oncology, EarlyView.
Targeted therapy was evaluated in SHH medulloblastoma using neuroepithelial stem cell (NES) and tumor‐derived NES‐like (tNES) models in 2D monolayers and 3D spheroids. PI3K, AKT, and CDK4/6 inhibitors had minimal effects in NES but markedly reduced viability and growth and induced apoptosis in tNES cells, revealing distinct therapeutic vulnerabilities.
Monika Lukoseviciute   +4 more
wiley   +1 more source

A Concise Study of Some Superhypergraph classes [PDF]

open access: yesNeutrosophic Sets and Systems
In graph theory, the hypergraph extends the traditional graph structure by allowing edges to connect multiple vertices, and this concept is further broadened by the superhypergraph.
Florentin Smarandache, Takaaki Fujita
doaj   +1 more source

Classes of perfect graphs

open access: yesDiscrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Establishment of a humanized patient‐derived xenograft mouse model of high‐grade serous ovarian cancer for preclinical evaluation of combination immunotherapy

open access: yesMolecular 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

Containment Graphs, Posets, and Related Classes of Graphs [PDF]

open access: yesAnnals of the New York Academy of Sciences, 1989
In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let $Z$ be a family of nonempty sets. We call a (simple, finite) graph G = (V, E) a $Z$-containment graph provided one can assign to each vertex $v_i \in V $ a set $S_i \in Z$ such that $v_i v_j \in E$ if and only if $S_i ...
Martin Charles Golumbic   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy