Results 141 to 150 of about 8,369 (289)

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

Independent set dominating sets in bipartite graphs [PDF]

open access: yesOpuscula Mathematica, 2005
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called a set dominating set (shortly sd-set) in \(G\), if for each set \(X ...
Bohdan Zelinka
doaj  

Liquid biopsy‐based diagnostic evaluation of hypermethylated CpG sites for ovarian cancer diagnosis

open access: yesMolecular Oncology, EarlyView.
This schematic outlines the workflow from biomarker identification to duplex MethyLight assay validation for epithelial ovarian cancer diagnosis using cfDNA‐based liquid biopsy. Initial screening of hypermethylated CpG candidates (cg02957270, cg10061138 cg00480298, COL2A1) was performed in tissue using ARMS‐PCR, COBRA, qPCR and image analysis. Selected
Deepa Bisht   +3 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

The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets

open access: yesAnnales Mathematicae Silesianae
The independent domination number i(G) of a graph G is the minimum cardinality of a maximal independent set of G, also called an i(G)-set. The i-graph of G, denoted ℐ (G), is the graph whose vertices correspond to the i(G)-sets, and where two i(G)-sets ...
Brewster R.C.   +2 more
doaj   +1 more source

Epigenetic heterogeneity and plasticity in therapy‐induced tumor states through single‐cell multi‐omics

open access: yesMolecular Oncology, EarlyView.
Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim   +3 more
wiley   +1 more source

The Structure of Tripotent Graph of Certain Commutative Rings

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics
In this paper, we characterize the texture of tripotent graph of the ring, which is associated by tripotent element of a ring such that, for every two distinct vertices; and then, their adjacent if and only if.
Parween O. Ali, Shaymaa Essa
doaj   +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

Independent domination critical and stable graphs upon edge subdivision [PDF]

open access: yes, 2015
A subset D of vertices in a graph G is an independent dominating set if D is a dominating set and an independent set. A graph is independent domination edge subdivision critical if the subdivision of an arbitrary edge increases the independent domination
Sharada, B.
core  

Independent domination versus packing in subcubic graphs [PDF]

open access: yes
In 2011, Henning, Louml;wenstein, and Rautenbach observed that the domination number of a graph is bounded above by the product of the packing number and the maximum degree of the graph.
Cho Eun-Kyung, Kim Minki
core   +1 more source

Home - About - Disclaimer - Privacy