Results 61 to 70 of about 2,072,739 (293)
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 minimum size of maximal IC-plane graphs
A graph is IC-planar if it admits a drawing with at most one crossing per edge so that each vertex is incident to at most one crossing edge, and an IC-plane graph means such a drawing of an IC-planar graph.
Rui Xu
doaj +1 more source
Drawing Graphs as Spanners [PDF]
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
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
A Java software for drawing graphs [PDF]
In this study the software for drawing graphs, which is run as a Java application, was described. It can be freely downloaded and run on Windows platforms. The software can be used to draw directed, undirected, cyclic and acyclic graphs.
WenJun Zhang
doaj
Bar 1-Visibility Drawings of 1-Planar Graphs
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
Planar Induced Subgraphs of Sparse Graphs [PDF]
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
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
More Compact Orthogonal Drawings by Allowing Additional Bends †
Compacting orthogonal drawings is a challenging task. Usually, algorithms try to compute drawings with small area or total edge length while preserving the underlying orthogonal shape. We suggest a moderate relaxation of the orthogonal compaction problem,
Michael Jünger +2 more
doaj +1 more source
Fuzzy Implementation of Automatic Teaching of Hand-drawn Line Graph [PDF]
For the existing related works cannot be applied to automatic teaching of hand-drawn graph with high freedom degree,this paper proposes an automatic teaching method for fuzzy evaluation of line drawing quality based on open-loop and closed-loop line ...
CHEN Tongqian,DAI Yong,YUAN Dibo
doaj +1 more source

