Results 91 to 100 of about 978,459 (257)
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Recent progress on strong edge-coloring of graphs
, 2019 A strong edge-coloring of a graph G = (V,E) is a partition of its edge set E into induced matchings.
Deng, Kecai, Yu, Gexin, Zhou, Xiangqian
core +1 more source
Edge-DP-Coloring of Graphs [PDF]
, 2023 A proper coloring of a graph $G$ is an assignment of colors to all vertices in $G$ so that adjacent vertices receive different colors. In this thesis, we will introduce a generalization of a coloring problem known as DP-coloring.
Minjung Kang
core
Molecular Oncology, EarlyView.Drug resistance limits treatment success in a subset of lung cancers driven by ROS1 gene alterations. Using patient‐derived cells and computer simulations, we studied three key mutations and how they affect five targeted drugs. The mutations reduced drug effectiveness in different ways by altering protein structure and behavior.
Farhan Ul Haq +8 more
wiley +1 more source
CEACAM1 participation in breast cancer progression
Molecular Oncology, EarlyView.In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +1 more source
Fast edge colorings with fixed number of colors to minimize imbalance
Journal of Graph Algorithms and Applications, 2008 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
Edge Coloring Of Cactus Graphs With Given Spectrums
, 2021 An edge-coloring of a graph G is a coloring of the graph edges with integers such that the colors of the edges incident to any vertex of G are distinct. For an edge coloring α and a vertex v the set of all the colors of the incident edges of v is called ...
Sahakyan, A. K. (Albert)
core
Pharmacological chromatin remodeling enhances response to estrogen therapy in ER+ breast cancer
Molecular Oncology, EarlyView.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
On harmonious coloring of hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA harmonious coloring of a $k$-uniform hypergraph $H$ is a vertex coloring such that no two vertices in the same edge have the same color, and each $k$-element subset of colors appears on at most one edge. The harmonious number $h(H)$ is the least number
Sebastian Czerwiński
doaj +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