Results 111 to 120 of about 978,529 (303)
Pharmacological chromatin remodeling enhances response to estrogen therapy in ER+ breast cancer
Estrogen therapy elicits clinical benefit in ~ 30% of patients with endocrine‐resistant estrogen receptor (ER)‐positive breast cancer. Based on findings that ER transcriptional activation underlies response to estrogen therapy, we tested the effects of epigenetic dysregulation via pharmacological inhibition of histone deacetylases (HDACi).
Anneka L. Johnson Thomas +16 more
wiley +1 more source
Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem [PDF]
An edge q-coloring of a graph G is a coloring of its edges such that every vertex sees at most q colors on the edges incident on it. The size of an edge q-coloring is the total number of colors used in the coloring. Given a graph G and a positive integer
Panolan, Fahad +4 more
core +1 more source
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
Strong Edge-Coloring Of Planar Graphs
A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +1 more source
Fast edge colorings with fixed number of colors to minimize imbalance
We study the following optimization problem: the input is a multigraph G=(V,E) and an integer parameter g. A feasible solution consists of a (not necessarily proper) coloring of E with colors 1, 2, …, g.
Gruia Calinescu, Michael Pelsmajer
doaj +1 more source
Parameterized Complexity of Maximum Edge Coloring in Graphs [PDF]
The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring.
Goyal, Prachi
core
This study identifies somatostatin receptor 4 (Sstr4) as a critical tumor suppressor against skin and head/neck cancers (HNSCC, cSCC, and BCC). The loss of Sstr4 removes a check on cell growth, causing hyperactivation of the MAPK‐ERK signaling pathway (↑).
Ali Taqvi +6 more
wiley +1 more source
Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture
Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture provides an overview of the current state of the science ...
Scheide, Diego +3 more
core
On facial unique-maximum (edge-)coloring [PDF]
A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face α the maximal color appears exactly once on the vertices of α.
Riste Škrekovski +7 more
core +1 more source
This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source

