Results 131 to 140 of about 7,194,939 (348)

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  

Time, the final frontier

open access: yesMolecular Oncology, EarlyView.
This article advocates integrating temporal dynamics into cancer research. Rather than relying on static snapshots, researchers should increasingly consider adopting dynamic methods—such as live imaging, temporal omics, and liquid biopsies—to track how tumors evolve over time.
Gautier Follain   +3 more
wiley   +1 more source

Inhibitor of DNA binding‐1 is a key regulator of cancer cell vasculogenic mimicry

open access: yesMolecular Oncology, EarlyView.
Elevated expression of transcriptional regulator inhibitor of DNA binding 1 (ID1) promoted cancer cell‐mediated vasculogenic mimicry (VM) through regulation of pro‐angiogenic and pro‐cancerous genes (e.g. VE‐cadherin (CDH5), TIE2, MMP9, DKK1). Higher ID1 expression also increased metastases to the lung and the liver.
Emma J. Thompson   +11 more
wiley   +1 more source

MET and NF2 alterations confer primary and early resistance to first‐line alectinib treatment in ALK‐positive non‐small‐cell lung cancer

open access: yesMolecular Oncology, EarlyView.
Alectinib resistance in ALK+ NSCLC depends on treatment sequence and EML4‐ALK variants. Variant 1 exhibited off‐target resistance after first‐line treatment, while variant 3 and later lines favored on‐target mutations. Early resistance involved off‐target alterations, like MET and NF2, while on‐target mutations emerged with prolonged therapy.
Jie Hu   +11 more
wiley   +1 more source

Locating-dominating sets and identifying codes in graphs of girth at least 5

open access: yes, 2015
Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the ...
Balbuena, Camino   +2 more
core  

Chemoresistome mapping in individual breast cancer patients unravels diversity in dynamic transcriptional adaptation

open access: yesMolecular Oncology, EarlyView.
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani   +14 more
wiley   +1 more source

Approximating a Minimum Dominating Set by Purification

open access: yesAlgorithms
A dominating set of a graph is a subset of vertices such that every vertex not in the subset has at least one neighbor within the subset. The corresponding optimization problem is known to be NP-hard.
Ernesto Parra Inza   +3 more
doaj   +1 more source

Fixed Parameter Algorithms for Planar Dominating Set and Related Problems [PDF]

open access: green, 2000
Jochen Alber   +3 more
openalex   +1 more source

Determination of ADP/ATP translocase isoform ratios in malignancy and cellular senescence

open access: yesMolecular Oncology, EarlyView.
The individual functions of three isoforms exchanging ADP and ATP (ADP/ATP translocases; ANTs) on the mitochondrial membrane remain unclear. We developed a method for quantitatively differentiating highly similar human ANT1, ANT2, and ANT3 using parallel reaction monitoring. This method allowed us to assess changes in translocase levels during cellular
Zuzana Liblova   +18 more
wiley   +1 more source

A Note on Non-Dominating Set Partitions in Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G is adjacent to a vertex of S.
Desormeaux Wyatt J.   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy