Results 51 to 60 of about 260,743 (188)

Clover: a clustering-oriented de novo assembler for Illumina sequences

open access: yesBMC Bioinformatics, 2020
Background Next-generation sequencing technologies revolutionized genomics by producing high-throughput reads at low cost, and this progress has prompted the recent development of de novo assemblers.
Ming-Feng Hsieh   +2 more
doaj   +1 more source

Layout of Graphs with Bounded Tree-Width

open access: yes, 2004
A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its \emph{queue-
Albertson Michael   +10 more
core   +2 more sources

Dual-layer network representation exploiting information characterization [PDF]

open access: yes, 2014
In this paper, a logical dual-layer representation approach is proposed to facilitate the analysis of directed and weighted complex networks. Unlike the single logical layer structure, which was widely used for the directed and weighted flow graph, the ...
Bernardinis, VD   +3 more
core   +1 more source

Distributed Graph Layout for Sensor Networks [PDF]

open access: yesJournal of Graph Algorithms and Applications, 2005
Summary: Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor with a location measurement device, such as GPS. However, low-end systems or indoor systems, which cannot use GPS, must locate themselves based only on crude ...
Gotsman, Craig, Koren, Yehuda
openaire   +2 more sources

Representing Space: A Hybrid Genetic Algorithm for Aesthetic Graph Layout [PDF]

open access: yes, 1998
This paper describes a hybrid Genetic Algorithm (GA) that is used to improve the layout of a graph according to a number of aesthetic criteria.
Hobbs, M.H.W., Rodgers, Peter
core   +1 more source

Octilinear Force-Directed Layout with Mental Map Preservation for Schematic Diagrams [PDF]

open access: yes, 2014
We present an algorithm for automatically laying out metro map style schematics using a force-directed approach, where we use a localized version of the standard spring embedder forces combined with an octilinear magnetic force.
B. Alper   +9 more
core   +1 more source

Circular layout in the Graph Layout toolkit [PDF]

open access: yes, 1997
The Graph Layout Toolkit is a family of portable, automated, graph layout libraries designed for integration into graphical user interface application programs. The Circular Library is one of the four styles currently available with the Graph Layout Toolkit. It produces layouts that emphasize natural group structures inherent in a graph's topology, and
Uğur Doğrusöz   +2 more
openaire   +1 more source

Column-Based Graph Layouts [PDF]

open access: yes, 2013
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width but node-specific height. One way to draw such graphs is to use a layering technique as provided by the Sugiyama framework [10]. However, to avoid drawbacks of the Sugiyama framework we use the layer-free upward crossing minimization algorithm suggested
Betz, Gregor   +4 more
openaire   +1 more source

Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value Stores

open access: yesBig Data Mining and Analytics
Graph databases have gained widespread adoption in various industries and have been utilized in a range of applications, including financial risk assessment, commodity recommendation, and data lineage tracking.
Heng Lin   +6 more
doaj   +1 more source

Telemaco: A Language Oriented Tool for Graph-based Models Layout Optimization

open access: yesJournal of Telecommunications and Information Technology, 2013
Progress of ICT is shifting the paradigm of systems organization towards a distributed approach, in which physical deployment of components influences the evaluation of systems properties. This contribution can be considered as a problem of graph layout
Mauro Iacono, Stefano Marrone
doaj   +1 more source

Home - About - Disclaimer - Privacy