Results 141 to 150 of about 7,293,468 (349)
Locating-dominating sets and identifying codes in graphs of girth at least 5
, 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
Decrypting cancer's spatial code: from single cells to tissue niches
Molecular Oncology, EarlyView.Spatial transcriptomics maps gene activity across tissues, offering powerful insights into how cancer cells are organised, switch states and interact with their surroundings. This review outlines emerging computational, artificial intelligence (AI) and geospatial approaches to define cell states, uncover tumour niches and integrate spatial data with ...
Cenk Celik +4 more
wiley +1 more source
A Note on Non-Dominating Set Partitions in Graphs
Discussiones 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
Bridging the gap: Multi‐stakeholder perspectives of molecular diagnostics in oncology
Molecular Oncology, EarlyView.Although molecular diagnostics is transforming cancer care, implementing novel technologies remains challenging. This study identifies unmet needs and technology requirements through a two‐step stakeholder involvement. Liquid biopsies for monitoring applications and predictive biomarker testing emerge as key unmet needs. Technology requirements vary by
Jorine Arnouts +8 more
wiley +1 more source
Fixed Parameter Algorithms for Planar Dominating Set and Related Problems [PDF]
, 2000 Jochen Alber +3 more
openalex +1 more source
On Relaxation of Dominant Sets
, 2022 In a graph $G = (V,E)$, a k-ruling set $S$ is one in which all vertices $V$ \ $S$ are at most $k$ distance from $S$. Finding a minimum k-ruling set is intrinsically linked to the minimum dominating set problem and maximal independent set problem, which have been extensively studied in graph theory.
openaire +2 more sources
YAP1::TFE3 mediates endothelial‐to‐mesenchymal plasticity in epithelioid hemangioendothelioma
Molecular Oncology, EarlyView.The YAP1::TFE3 fusion protein drives endothelial‐to‐mesenchymal transition (EndMT) plasticity, resulting in the loss of endothelial characteristics and gain of mesenchymal‐like properties, including resistance to anoikis, increased migratory capacity, and loss of contact growth inhibition in endothelial cells.
Ant Murphy +9 more
wiley +1 more source
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
Molecular Oncology, EarlyView.This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 more
wiley +1 more source
Molecular Oncology, EarlyView.This study highlights the potential of automated enumeration using the ACCEPT software to refine circulating tumor cell (CTC) detection in metastatic colorectal cancer (mCRC). The automated method demonstrates improved accuracy and reduced variability compared to the manual approach.
Michela De Meo +6 more
wiley +1 more source