Results 61 to 70 of about 424,972 (258)
Choosing Colors for Geometric Graphs via Color Space Embeddings
, 2006 Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored: assigning ...
Dillencourt, Michael B. +2 more
core +1 more source
Optimization of mine ventilation network feature graph.
PLoS ONE, 2020 A ventilation network feature graph can directly and quantitatively represent the features of a ventilation network. To ensure the stability of airflow in a mine and improve ventilation system analysis, we propose a new algorithm to draw ventilation ...
Jinzhang Jia +5 more
doaj +1 more source
FEBS Open Bio, EarlyView.Light activation of the photoswitchable cannabinoid ligand azo‐HU308 triggers Ca2+ influx in pancreatic β‐cells through TRPC channels, independent of CB2 cannabinoid receptors. This reveals a non‐GPCR pathway for cannabinoid modulation of β‐cell Ca2+ dynamics and establishes azo‐HU308 as an optical tool to study cannabinoid signaling through TRP ...
Alexander E. G. Viray, James A. Frank
wiley +1 more source
Monotone Grid Drawings of Planar Graphs
, 2013 A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction.
E.M. Arkin +6 more
core +1 more source
Online Dynamic Graph Drawing [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2008 This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and ...
Yaniv, Frishman, Ayellet, Tal
openaire +2 more sources
Discrete Mathematics & Theoretical Computer Science, 2005 An edge in a drawing of a graph is called $\textit{even}$ if it intersects every other edge of the graph an even number of times. Pach and Tóth proved that a graph can always be redrawn such that its even edges are not involved in any intersections.
Michael J. Pelsmajer +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava +3 more
wiley +1 more source
Achieving Good Angular Resolution in 3D Arc Diagrams [PDF]
, 2013 We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3D arc diagrams, even for cases when the arcs must project to a given 2D ...
A. Cimikowski +17 more
core +2 more sources
AN EFFICIENT GRAPH VISUALISATION FRAMEWORK FOR REFACTORERL
Studia Universitatis Babes-Bolyai: Series Informatica, 2018 Graph visualisation is a well-known and researched field of graphical informatics. Several good algorithms were developed and reviewed by our days. However, most of the graph drawing tools mainly focus on static drawing generation.
Mátyás KOMÁROMI +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source