Results 111 to 120 of about 641,529 (298)
Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma
Molecular Oncology, EarlyView.Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski +10 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
Loss of proton‐sensing TDAG8 increases tumor progression in mouse models of colon cancer
Molecular Oncology, EarlyView.Loss of the pH‐sensing receptor TDAG8 accelerates colorectal cancer progression in mice. Animals lacking TDAG8 expression had increased tumor growth, DNA damage, and recruitment of tumor‐associated immune cells, including macrophages, neutrophils, and monocytes.
Ermanno Malagola +11 more
wiley +1 more source
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 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
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
Edge-Coloring and f-Coloring for Various Classes of Graphs [PDF]
, 1999 In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a positive integer assigned to v.
Xiao Zhou, Takao Nishizeki
core
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Molecular Oncology, EarlyView.Interferon type 1 (IFN‐1) production and signaling is associated with the acquisition of therapy resistance, following chronic DNA damage, via Interferon‐related DNA damage resistance signature (IRDS) gene expression. An alternative, DNA damage‐independent role of sustained IFN‐1 mediated resistance was identified and characterized by the emergence of ...
Ashlyn Conant +11 more
wiley +1 more source
Faster Edge Coloring by Partition Sieving [PDF]
In the Edge Coloring problem, we are given an undirected graph G with n vertices and m edges, and are tasked with finding the smallest positive integer k so that the edges of G can be assigned k colors in such a way that no two edges incident to the same
Koana, Tomohiro, Akmal, Shyan
core +1 more source
Zhejiang Daxue xuebao. Lixue ban, 2017 A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj +1 more source