Results 51 to 60 of about 1,282,116 (277)

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

open access: yesMolecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice   +16 more
wiley   +1 more source

PARP inhibition and pharmacological ascorbate demonstrate synergy in castration‐resistant prostate cancer

open access: yesMolecular Oncology, EarlyView.
Pharmacologic ascorbate (vitamin C) increases ROS, disrupts cellular metabolism, and induces DNA damage in CRPC cells. These effects sensitize tumors to PARP inhibition, producing synergistic growth suppression with olaparib in vitro and significantly delayed tumor progression in vivo. Pyruvate rescue confirms ROS‐dependent activity.
Nicolas Gordon   +13 more
wiley   +1 more source

Comparative Study of Prism Octahedron Network via Eccentric Invariants

open access: yesJournal of Chemistry, 2023
Topological indices are empirical features of graphs that characterize the topology of the graph and, for the most part, are graph independent. An important branch of graph theory is chemical graph theory.
Haidar Ali   +5 more
doaj   +1 more source

Generalized inverses in graph theory

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
–In this article, some interesting applications of generalized inverses in the graph theory are revisited. Interesting properties of generalized inverses are employed to make the proof of several known results simpler, and several techniques such as ...
Umashankara Kelathaya   +2 more
doaj   +1 more source

Formalizing Mathematical Knowledge as a Biform Theory Graph: A Case Study

open access: yes, 2017
A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory graph is a network
BE Aydemir   +12 more
core   +1 more source

SAMPLING THEORY FOR GRAPH SIGNALS ON PRODUCT GRAPHS [PDF]

open access: yes2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2018
Accepted to GlobalSIP ...
Rohan Varma, Jelena Kovacevic
openaire   +2 more sources

Circular RNA expression landscapes in myelodysplastic neoplasms: Associations with mutational signatures and disease progression

open access: yesMolecular Oncology, EarlyView.
In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge   +17 more
wiley   +1 more source

Identification of serum protein biomarkers for pre‐cancerous lesions associated with pancreatic ductal adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns   +10 more
wiley   +1 more source

Graph theoretic aspects of music theory [PDF]

open access: yes, 2001
The cycle on twelve points is a well-known representation of the twelve pitch classes of the traditional scale. We treat a more general situation where the number of pitch classes can be different from twelve and where, moreover, other measures of ...
Althuis, T.A., Göbel, F.
core   +2 more sources

A method in graph theory

open access: yesDiscrete Mathematics, 1976
AbstractA unified approach to a variety of graph-theoretic problems is introduced. The k-closure Ck(G) of a simple graph G of order n is the graph obtained from G by recursively joining pairs of nonadjacent vertices with degree-sum at least k. It is shown that, for many properties P, one can find a suitable value of k (depending on P and n) such that ...
J. Adrian Bondy, Vasek Chvátal
openaire   +2 more sources

Home - About - Disclaimer - Privacy