Results 41 to 50 of about 424,972 (258)
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
On the Maximum Crossing Number
, 2017 Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J.
E Steinitz +18 more
core +1 more source
Planar Induced Subgraphs of Sparse Graphs [PDF]
, 2014 We show that every graph has an induced pseudoforest of at least $n-m/4.5$ vertices, an induced partial 2-tree of at least $n-m/5$ vertices, and an induced planar subgraph of at least $n-m/5.2174$ vertices. These results are constructive, implying linear-
A. Lubotzky +6 more
core +1 more source
Drawing Graphs as Spanners [PDF]
Discrete & Computational Geometry, 2020 We study the problem of embedding graphs in the plane as good geometric spanners. That is, for a graph $G$, the goal is to construct a straight-line drawing $ $ of $G$ in the plane such that, for any two vertices $u$ and $v$ of $G$, the ratio between the minimum length of any path from $u$ to $v$ and the Euclidean distance between $u$ and $v$ is small.
Aichholzer, Oswin +6 more
openaire +4 more sources
Frequent Graph Discovery: Application to Line Drawing Document Images
ELCVIA Electronic Letters on Computer Vision and Image Analysis, 2005 In this paper a sequence of steps is applied to a graph representation of line drawings using concepts from data mining. This process finds frequent subgraphs and then association rules between these subgraphs.
Eugen Barbu +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Following high dose rate brachytherapy (HDR‐BT) for hepatocellular carcinoma (HCC), patients were classified as responders and nonresponders. Post‐therapy serum induced increased BrdU incorporation and Cyclin E expression of Huh7 and HepG2 cells in nonresponders, but decreased levels in responders.
Lukas Salvermoser +14 more
wiley +1 more source
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
Open Computer Science, 2015 We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei +3 more
doaj +1 more source
Molecular Oncology, EarlyView.We developed a cost‐effective methylation‐specific droplet digital PCR multiplex assay containing tissue‐conserved and tumor‐specific methylation markers. The assay can detect circulating tumor DNA with high accuracy in patients with localized and metastatic colorectal cancer.
Luisa Matos do Canto +8 more
wiley +1 more source
Bar 1-Visibility Drawings of 1-Planar Graphs
, 2013 A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean +13 more
core +1 more source
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
AKCE International Journal of Graphs and CombinatoricsA graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj +1 more source