Results 51 to 60 of about 57,181 (227)
Graph Drawing Techniques for Geographic Visualization [PDF]
, 2004 Geovisualizers often need to represent data that consists of items related together. Such data sets can be abstracted to a mathematical structure, the graph.
Rodgers, Peter
core
Molecular Oncology, EarlyView.Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
doaj +1 more source
An Interactive System for Drawing Graphs [PDF]
, 1996 . In spite of great advances in the automatic drawing of medium and large graphs, the tools available for drawing small graphs exquisitely (that is, with the aesthetics commonly found in professional publications and presentations) are still very ...
Kathy Ryall +5 more
core +1 more source
Pointed drawings of planar graphs [PDF]
Computational Geometry, 2012 We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater than π. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic Bézier curves (parabolic arcs), even if the positions
Oswin Aichholzer +3 more
openaire +3 more sources
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Annular and pants thrackles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices.
Grace Misereh, Yuri Nikolayevsky
doaj +1 more source
Rectangular Drawings of Planar Graphs [PDF]
Journal of Algorithms, 2002 Summary: A plane graph is a planar graph with a fixed embedding in the plane. In a rectangular drawing of a plane graph, each vertex is drawn as a point, each edge is drawn as a horizontal or vertical line segment, and each face is drawn as a rectangle.
Md. Saidur Rahman 0001 +2 more
openaire +1 more source
Molecular Oncology, EarlyView.Radiotherapy (RT) response depends on the DNA repair capacity of tumor and host cells. We show that circulating tumor cell (CTC) counts and apoptosis rates before and after RT predict treatment response and outcome, which can be accessed via easily accessible liquid biopsy approaches. Created in BioRender. Wikman, H.
Yvonne Goy +10 more
wiley +1 more source
More Compact Orthogonal Drawings by Allowing Additional Bends †
Information, 2018 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