Results 71 to 80 of about 278,151 (262)

Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential

open access: yesFEBS Letters, EarlyView.
Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta   +3 more
wiley   +1 more source

The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers

open access: yesMolecular Oncology, EarlyView.
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce   +11 more
wiley   +1 more source

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

Mixed graph edge coloring

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanna Furmanczyk   +3 more
openaire   +5 more sources

Fastest Mixing Markov Chain on a Graph [PDF]

open access: yesSIAM Review, 2004
The connected graph \(G=(V,E)\) with vertex set \(V=\{1,\dots,n\}\) and edge set \(E \subseteq V \times V\) is considered. It is assumed that \(G\) is a symmetric graph with self-loops, i.e. \((i,j) \in E\) iff \((j,i) \in E\) and \((i,i) \in E\) for all \(i\).
Stephen P. Boyd   +2 more
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

Improved Approximation for Orienting Mixed Graphs [PDF]

open access: yesAlgorithmica, 2012
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed source-target path.
Iftah Gamzu, Moti Medina
openaire   +4 more sources

CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3

open access: yesMolecular Oncology, EarlyView.
PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh   +12 more
wiley   +1 more source

On Mixed Metric Dimension of Some Path Related Graphs

open access: yesIEEE Access, 2020
A vertex $k\in V_{G}$ determined two elements (vertices or edges) $\ell,m \in V_{G}\cup E_{G}$ , if $d_{G}(k,\ell)\neq d_{G}(k,m)$ . A set $R_ {\text {m}}$ of vertices in a graph $G$ is a mixed metric generator for $G$ , if two distinct elements
Hassan Raza, Ying Ji, Shaojian Qu
doaj   +1 more source

On Chromatic Number of Colored Mixed Graphs [PDF]

open access: yes, 2017
An $(m,n)$-colored mixed graph $G$ is a graph with its arcs having one of the $m$ different colors and edges having one of the $n$ different colors. A homomorphism $f$ of an $(m,n)$-colored mixed graph $G$ to an $(m,n)$-colored mixed graph $H$ is a vertex mapping such that if $uv$ is an arc (edge) of color $c$ in $G$, then $f(u)f(v)$ is an arc (edge ...
Sandip Das 0001   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy