Results 121 to 130 of about 3,583,809 (318)
Graph enumeration and random graphs
, 2023 In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical ...
openaire +4 more sources
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
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
A root graph that is locally the line graph of the Petersen graph
Discrete Mathematics, 2003 The authors construct a root graph on \(192\) vertices that is locally the line graph of the Petersen graph and they show that this graph is the unique root graph with \(\mu = 2\) that is locally the line graph of the Petersen graph (\(\mu = 2\) means that every two vertices at distance two have precisely two common neighbours).
Andries E. Brouwer +2 more
openaire +3 more sources
Homomorphic Preimages of Geometric Cycles
, 2015 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core
Molecular Oncology, EarlyView.This real‐world study of ROS1+ NSCLC highlights fusion diversity, treatment outcomes with crizotinib and lorlatinib, and in vitro experiments with resistance mechanisms. G2032R drives strong resistance to ROS1‐targeted TKIs, especially lorlatinib. Fusion partner location does not affect overall survival to crizotinib or lorlatinib. Findings support the
Fenneke Zwierenga +8 more
wiley +1 more source
Vehicle Routing Problem Models
Promet (Zagreb), 2004 The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal ...
Tonči Carić +2 more
doaj +1 more source
A simple yet effective baseline for non-attributed graph classification
, 2019 Graphs are complex objects that do not lend themselves easily to typical learning tasks. Recently, a range of approaches based on graph kernels or graph neural networks have been developed for graph classification and for representation learning on ...
Cai, Chen, Wang, Yusu
core
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