Results 71 to 80 of about 15,625 (297)
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Data in Brief, 2022 Electroencephalography (EEG) offers a unique window into the dynamics of the neuronal symphony that powers our brains. Here, we describe a publicly available dataset of EEG recorded from 111 healthy subjects.
Christoffer Hatlestad-Hall +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
SINR Percolation for Cox Point Processes with Random Powers [PDF]
, 2022 Signal-to-interference plus noise ratio (SINR) percolation is an infinite-range dependent variant of continuum percolation modeling connections in a telecommunication network. Unlike in earlier works, in the present paper the transmitted signal powers of
Tóbiás, András József +2 more
core +1 more source
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products
Entropy, 2023 This paper provides new observations on the Lovász θ-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs.
Igal Sason
doaj +1 more source
Between the enhanced power graph and the commuting graph
Journal of Graph Theory, 2022 AbstractThe purpose of this note is to define a graph whose vertex set is a finite group , whose edge set is contained in that of the commuting graph of and contains the enhanced power graph of . We call this graph the deep commuting graph of . Two elements of are joined in the deep commuting graph if and only if their inverse images in every central ...
Peter J. Cameron, Bojan Kuzma
openaire +4 more sources
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
Molecular Oncology, EarlyView.COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +1 more source
Number of walks and degree powers in a graph [PDF]
, 2006 This letter deals with the relationship between the total number of k-walks in a graph, and the sum of the k-th powers of its vertex degrees. In particular, it is shown that the sum of all k-walks is upper bounded by the sum of the k-th powers of the ...
Garriga Valle, Ernest +1 more
core +2 more sources
Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers
Journal of MathematicsA lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions ...
M. A. AbdAllah +3 more
doaj +1 more source
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source