Results 121 to 130 of about 652,005 (320)

Contracting Graphs to Split Graphs and Threshold Graphs

open access: yes, 2013
14 pages, 4 ...
Cai, Leizhen, Guo, Chengwei
openaire   +2 more sources

LINC01116, a hypoxia‐lncRNA marker of pathological lymphangiogenesis and poor prognosis in lung adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
The LINC01116 long noncoding RNA is induced by hypoxia and associated with poor prognosis and high recurrence rates in two cohorts of lung adenocarcinoma patients. Here, we demonstrate that besides its expression in cancer cells, LINC01116 is markedly expressed in lymphatic endothelial cells of the tumor stroma in which it participates in hypoxia ...
Marine Gautier‐Isola   +12 more
wiley   +1 more source

Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs

open access: yesComplexity, 2019
The matching energy ME(G) of a graph G was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial m(G,x).
Xiaolin Chen, Huishu Lian
doaj   +1 more source

Split graphs and block representations

open access: yesDiscrete Mathematics
23 pages, 7 Figures, 2 ...
Karen L. Collins   +2 more
openaire   +3 more sources

ATF4‐mediated stress response as a therapeutic vulnerability in chordoma

open access: yesMolecular Oncology, EarlyView.
We screened 5 chordoma cell lines against 100+ inhibitors of epigenetic and metabolic pathways and kinases and identified halofuginone, a tRNA synthetase inhibitor. Mechanistically halofuginone induces an integrated stress response, with eIF2alpha phosphorylation, activation of ATF4 and its target genes CHOP, ASNS, INHBE leading to cell death ...
Lucia Cottone   +11 more
wiley   +1 more source

On two variants of split graphs: 2-unipolar graph and k-probe-split graph

open access: yesRAIRO - Operations Research
A graph is called split if its vertex set can be partitioned into a stable set and a clique. In this article, we studied two variants of split graphs. A graph G is polar if its vertex set can be partitioned into two sets A and B such that G[A] is a complete multipartite graph and G[B] is a disjoint union of complete graphs.
Luciano N. Grippo, Verónica A. Moyano
openaire   +2 more sources

Developing evidence‐based, cost‐effective P4 cancer medicine for driving innovation in prevention, therapeutics, patient care and reducing healthcare inequalities

open access: yesMolecular Oncology, EarlyView.
The cancer problem is increasing globally with projections up to the year 2050 showing unfavourable outcomes in terms of incidence and cancer‐related deaths. The main challenges are prevention, improved therapeutics resulting in increased cure rates and enhanced health‐related quality of life.
Ulrik Ringborg   +43 more
wiley   +1 more source

LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro

open access: yesMolecular Oncology, EarlyView.
Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix   +13 more
wiley   +1 more source

On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs

open access: bronze, 2020
Nina Pardal   +3 more
openalex   +1 more source

Home - About - Disclaimer - Privacy