Results 141 to 150 of about 1,239,128 (324)

TOMM20 as a driver of cancer aggressiveness via oxidative phosphorylation, maintenance of a reduced state, and resistance to apoptosis

open access: yesMolecular Oncology, EarlyView.
TOMM20 increases cancer aggressiveness by maintaining a reduced state with increased NADH and NADPH levels, oxidative phosphorylation (OXPHOS), and apoptosis resistance while reducing reactive oxygen species (ROS) levels. Conversely, CRISPR‐Cas9 knockdown of TOMM20 alters these cancer‐aggressive traits.
Ranakul Islam   +9 more
wiley   +1 more source

On the Isomorphism Problem of Cayley Graphs of Graph Products [PDF]

open access: yesarXiv
We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
arxiv  

Are Yao Graph and Theta Graph Void Free? [PDF]

open access: yesarXiv, 2013
Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks. However, it can fail if network topologies (usually modeled by geometric graphs) contain voids. Since Yao Graph and Theta Graph are two types of geometric graphs exploited to construct wireless network topologies, this paper studies whether these two types of graphs ...
arxiv  

Targeting the MDM2‐MDM4 interaction interface reveals an otherwise therapeutically active wild‐type p53 in colorectal cancer

open access: yesMolecular Oncology, EarlyView.
This study investigates an alternative approach to reactivating the oncosuppressor p53 in cancer. A short peptide targeting the association of the two p53 inhibitors, MDM2 and MDM4, induces an otherwise therapeutically active p53 with unique features that promote cell death and potentially reduce toxicity towards proliferating nontumor cells.
Sonia Valentini   +10 more
wiley   +1 more source

Cycle Intersection Graphs and Minimum Decycling Sets of Even Graphs [PDF]

open access: yesarXiv, 2018
We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be significantly better when an even graph admits a cycle decomposition in which any two cycles intersect in at most one ...
arxiv  

Thermal proteome profiling and proteome analysis using high‐definition mass spectrometry demonstrate modulation of cholesterol biosynthesis by next‐generation galeterone analog VNPP433‐3β in castration‐resistant prostate cancer

open access: yesMolecular Oncology, EarlyView.
Elevated level of cholesterol is positively correlated to prostate cancer development and disease severity. Cholesterol‐lowering drugs, such as statins, are demonstrated to inhibit prostate cancer. VNPP433‐3β interrupts multiple signaling and metabolic pathways, including cholesterol biosynthesis, AR‐mediated transcription of several oncogenes, mRNA 5′
Retheesh S. Thankan   +10 more
wiley   +1 more source

An interdisciplinary model of context morphology

open access: yesMatLit, 2016
Using an abstract graph model we describe a hypothetical transformation of a literary entity through the active connections in the graph. First, we weakly define a set of transformations (“morphology”) over a particular entity as a series of the recent ...
Pál, Dániel Levente, Daróczy, Bálint
doaj   +1 more source

Random Graphs [PDF]

open access: bronze, 1959
E. N. Gilbert
openalex   +1 more source

Home - About - Disclaimer - Privacy