Results 41 to 50 of about 186,890 (225)

On The Packing k-Coloring of Edge Corona Product

open access: yes, 2019
All graph in this paper is connected and simple graph. Let du,v be a distance between any vertex u and v in graph G V,E . A function c :VG1, 2,, k is called a packing k-coloring if every two vertices of color i are at least distance i 1. G
KRISTIANA, Arika Indah   +3 more
core  

Loss of proton‐sensing TDAG8 increases tumor progression in mouse models of colon cancer

open access: yesMolecular 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

$S$-Packing Coloring of Cubic Halin Graphs [PDF]

open access: yes
Given a non-decreasing sequence $S = (s_{1}, s_{2}, \ldots , s_{k})$ of positive integers, an $S$-packing coloring of a graph $G$ is a partition of the vertex set of $G$ into $k$ subsets $\{V_{1}, V_{2}, \ldots , V_{k}\}$ such that for each $1 \leq i ...
Togni, Olivier, Tarhini, Batoul
core  

Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]

open access: yes, 2009
Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka   +3 more
core   +1 more source

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

open access: yesMolecular 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

In vitro and in silico modelling of ROS1‐positive non‐small cell lung cancer reveals fusion‐dependent tyrosine kinase inhibitor responses

open access: yesMolecular 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

S-packing colouring and its variations

open access: yes, 2020
Tato práce se zabývá oblastí S-pakovacího barvení grafu. Zaměřuje se na obecné S-pakovací barvení a jeho některé speciální varianty, konkrétně na pakovací barvení a distanční barvení.
Kamenická, Karolína
core  

Epigenetic silencing of the liver‐specific lncRNA LUNAR promotes liver cancer progression via NOTCH activation

open access: yesMolecular Oncology, EarlyView.
LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang   +9 more
wiley   +1 more source

CEACAM1 participation in breast cancer progression

open access: yesMolecular 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

Coloring problems in graph theory: k-packings and (p,q)-colorings [PDF]

open access: yes
A graph coloring is a map $\varphi$ from the vertices (or edges) of a graph $G$ to a set of colors. In Chapters 1 and 2, we provide preliminary information about graph theory and graph colorings and offer motivation behind the work.
McRoberts, Christian
core   +1 more source

Home - About - Disclaimer - Privacy