Results 51 to 60 of about 1,430 (216)
Cancer‐associated mutations in endometriosis reframe a benign disease through molecular oncology
Molecular Oncology, EarlyView.This review aims to comprehensively analyse cancer‐associated somatic mutations (CAMs) present in endometriotic lesions, emphasizing their biological roles, spatial distribution and implications for translational applications in medicine. By contextualizing a benign state within a genomic framework, this analysis seeks to establish its value as a ...
Clarissa Mujacic +15 more
wiley +1 more source
Metrics for Single-Edged Graphs over a Fixed Set of Vertices
Mathematical and Computational Applications, 2018 Graphs have powerful representations of all kinds of theoretical or experimental mathematical objects. A technique to measure the distance between graphs has become an important issue.
Ray-Ming Chen
doaj +1 more source
Orientable -distance magic regular graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
On the distance spectra of graphs
Linear Algebra and its Applications, 2016 20 pages, 3 figures v2.
Aalipour, Ghodratollah +10 more
openaire +4 more sources
Molecular 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
On the Wiener index of two families generated by joining a graph to a tree [PDF]
Discrete Mathematics Letters, 2022 Andrey A. Dobrynin
doaj +1 more source
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic.
Fábio Protti, Uéverton S. Souza
doaj +1 more source
On graphs with distance Laplacian eigenvalues of multiplicity n−4
AKCE International Journal of Graphs and Combinatorics, 2023 Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj +1 more source
Information Sciences, 2018 Ministerio de Ciencia e Innovación ECO2013-17766 ...
José Manuel, Gallardo +2 more
openaire +4 more sources
Molecular Oncology, EarlyView.Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source