Results 111 to 120 of about 2,919,635 (295)

Oncogenic DMTF1β promotes cancer cell motility by regulating autophagy through ULK1 stabilization

open access: yesMolecular Oncology, EarlyView.
In the current study, we demonstrate that the oncogene DMTF1β regulates ULK1 stability by reducing its proteasomal degradation in cancer cells. This stabilization enables ULK1 to induce autophagy, which in turn facilitates cancer cell migration. Consequently, reduced DMTF1β levels lead to decreased autophagy and impaired cancer cell migration.
Jun Xu   +13 more
wiley   +1 more source

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

On Strongly Regular Graphs and the Friendship Theorem

open access: yesMathematics
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ-function of strongly regular graphs, recently derived by
Igal Sason
doaj   +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

Directed strongly walk-regular graphs

open access: yes, 2018
We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly ℓ -walk-regular with ℓ>1 if the number of walks of length ℓ from a vertex to another vertex depends only on whether the first vertex is the same as ...
Omidi, G.R., van Dam, Edwin R.
core   +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

Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra. [PDF]

open access: yes
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core  

Random strongly regular graphs?

open access: yes, 2003
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6).
Cameron, Peter J.   +2 more
core   +1 more source

Preoperative circulating tumor cells integrated with imaging analysis for prognostic evaluation in head and neck squamous cell carcinoma

open access: yesMolecular Oncology, EarlyView.
Detecting circulating tumor cells (CTCs) in blood before surgery may help predict outcomes in patients with head and neck squamous cell carcinoma (HNSCC). Here, we show when combined with tumor size and lymph node involvement from routine imaging, CTC status identifies high‐risk patients with poorer survival—offering a simple, minimally invasive tool ...
Susanne Flach   +9 more
wiley   +1 more source

Strongly regular tri-Cayley graphs

open access: yes, 2013
A graph is called tri-Cayley if it admits a semiregular subgroup of automorphisms having three orbits of equal length. In this paper, the structure of strongly regular tri-Cayley graphs is investigated.
Miklavič, Štefko   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy