Results 91 to 100 of about 2,773,301 (295)
Molecular 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
Regular number of Middle graph of a graph [PDF]
, 2016 For any (p ,q) graph G, the middle graph of a graph G, is denoted by M(G), is a graph whose vertex set is V(G)?E(G), and two vertices are adjacent if they are adjacent edges of G or one is a vertex and other is an edge incident with it.
, M. H. Muddebihal, Abdul Gaffar
core +1 more source
Molecular Oncology, EarlyView.The proposed mechanism of action for the CDK12/13 inhibitor and cyclin K degrader, CT7439. CDK12/13 inhibition interrupts transcription elongation, leading to increased DNA damage that results in cell death. This agent is a potentially novel treatment option for patients with colorectal cancer. Created in BioRender. Cyclin‐dependent kinase (CDK) 12 and
Wylie K. Watlington +10 more
wiley +1 more source
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
Total Italian Domination: Structural Results on Middle Graphs of Standard Families
Wasit Journal for Pure SciencesIf we have graph , an Italian dominating function (IDF) is defined as a mapping satisfying the condition, if for any vertex must be have neighbor there is no fewer than 1 vertex to be or no fewer than 2 vertices where The weight of a (IDF) is ...
Maryam ALTABATABAII
doaj +1 more source
Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph
, 2010 The energy of a graph G is defined as the sum of the singular values of its adjacency matrix and the Laplacian energy of G is defined as the sum of the distance between Laplacian eigenvalues and average degree of G.
Zhongzhu Liu
core
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
Networks as a Privileged Way to Develop Mesoscopic Level Approaches in Systems Biology
Systems, 2014 The methodologies advocated in computational biology are in many cases proper system-level approaches. These methodologies are variously connected to the notion of “mesosystem” and thus on the focus on relational structures that are at the basis of ...
Alessandro Giuliani
doaj +1 more source
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
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