Results 91 to 100 of about 3,583,809 (318)
Molecular Oncology, EarlyView.The pan‐HDAC inhibitor belinostat increases the expression of the pro‐apoptotic proteins Bim, Puma, and Noxa and induces apoptosis in ovarian cancer cell lines and patient‐derived tumor organoids when used at high concentrations. Moreover, inhibiting the anti‐apoptotic proteins Bcl‐xL or Mcl‐1 sensitizes these preclinical models to the cytotoxic effect
Cécilia Thomine +10 more
wiley +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
, 2020 The continuous and rapid growth of highly interconnected datasets, which are both voluminous and complex, calls for the development of adequate processing and analytical techniques.
Bonifati, Angela +2 more
core
Molecular Oncology, EarlyView.Non‐thermal plasma treatment of melanoma cells induced epithelial‐mesenchymal transition (EMT) in a dose‐dependent fashion. This report highlights the critical need to further investigate potential adverse effects of non‐thermal plasma for cancer therapy and to optimize treatment parameters for clinical translation. Despite the promising results of non‐
Eline Biscop +10 more
wiley +1 more source
Graphs whose line graphs are ring graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices.
openaire +3 more sources
The Orchard crossing number of an abstract graph
, 2009 We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number.
Abstract Graph, David Garber, Elie Feder
core +2 more sources
Molecular Oncology, EarlyView.Trastuzumab‐deruxtecan, a HER2‐targeting antibody‐drug conjugate, shows promising antitumor activity in head and neck squamous cell carcinoma with low HER2 expression. In vitro and in vivo studies demonstrated dose‐dependent cell death and tumor growth reduction in low HER2‐expressing cell lines, which correlated with drug accumulation measured using a
Abdullah Bin Naveed +8 more
wiley +1 more source
Factors associated with the risk of HIV infection among HIV-exposed infants in Malawi: 2013–2020
BMJ Paediatrics Open, 2022 Janne Estill +6 more
doaj +1 more source
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
Veena Mathad, B. Basavanagoud
openaire +3 more sources
IPC: A Benchmark Data Set for Learning with Graph-Structured Data [PDF]
, 2019 Benchmark data sets are an indispensable ingredient of the evaluation of graph-based machine learning methods. We release a new data set, compiled from International Planning Competitions (IPC), for benchmarking graph classification, regression, and ...
Chen, Jie +4 more
core +1 more source