Results 61 to 70 of about 28,541 (252)
Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations [PDF]
The concept of a hierarchical design has played an important role in various areas of computer science and engineering, including software engineering, CAD, among others. Graphs with hierarchical structures, which are capable of describing large-scale regular structures in a succinct manner, have naturally become an interesting and important modeling ...
Ho-Lin Chen, Hsu-Chun Yen
openaire +1 more source
We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs [PDF]
The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms.
Giuseppe Di Battista, Fabrizio Frati
doaj +1 more source
RNA profiling of circulating extracellular vesicles (EVs) from blood samples of men undergoing prostate biopsy identifies transcripts associated with clinically significant prostate cancer. Integrative analysis with public tumor datasets links EV‐derived gene signatures to tumor stage and progression‐free survival, highlighting CASP3, XRCC2, and RIT1 ...
Stefan Werner +14 more
wiley +1 more source
There is strong evidence that focussing on the goal of an action improves performance relative to focussing on the concrete motor behaviours. The current study tests whether blind action guided by imagery relies on the same foci of attention.
Bassem Khalaf
doaj +3 more sources
A Census of Graph-Drawing Algorithms Based on Generalized Transversal Structures
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with faces of degree 3
Olivier Bernardi +2 more
doaj +1 more source
We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) $3$-connected maps.
Luca Castelli Aleardi +2 more
doaj +1 more source
Area-efficient algorithms for straight-line tree drawings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chan-Su Shin +2 more
openaire +2 more sources
Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves [PDF]
We study how to draw a 2-outerplane graph on two concentric circles, so that the internal (resp. external) vertices lie on the internal (resp. external) circle.
DI GIACOMO, Emilio, DIDIMO, WALTER
openaire +3 more sources
Many patients with urothelial cancer do not benefit from treatment with pembrolizumab, while at risk of severe side effects. Changes in the levels of circulating tumor DNA early during treatment, measured by a simple and affordable assay that can be easily implemented in the clinic, can be used as a prognostic tool to identify these patients.
Youssra Salhi +14 more
wiley +1 more source

