A layout algorithm for undirected compound graphs

Ugur Dogrusoz, Erhan Giral, Ahmet Cetintas, Ali Civril, Emek Demir

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions.

Original languageEnglish (US)
Pages (from-to)980-994
Number of pages15
JournalInformation Sciences
Volume179
Issue number7
DOIs
StatePublished - Mar 15 2009
Externally publishedYes

Fingerprint

Layout
Pathway
Graph in graph theory
Arbitrary
Vertex of a graph
Execution Time
Topology
Restriction
Geometry
Graph
Experimental Results
Drawing
Node

Keywords

  • Bioinformatics
  • Compound graphs
  • Force-directed graph layout
  • Graph drawing
  • Information visualization

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management

Cite this

A layout algorithm for undirected compound graphs. / Dogrusoz, Ugur; Giral, Erhan; Cetintas, Ahmet; Civril, Ali; Demir, Emek.

In: Information Sciences, Vol. 179, No. 7, 15.03.2009, p. 980-994.

Research output: Contribution to journalArticle

Dogrusoz, U, Giral, E, Cetintas, A, Civril, A & Demir, E 2009, 'A layout algorithm for undirected compound graphs', Information Sciences, vol. 179, no. 7, pp. 980-994. https://doi.org/10.1016/j.ins.2008.11.017
Dogrusoz, Ugur ; Giral, Erhan ; Cetintas, Ahmet ; Civril, Ali ; Demir, Emek. / A layout algorithm for undirected compound graphs. In: Information Sciences. 2009 ; Vol. 179, No. 7. pp. 980-994.
@article{a358e52bee204b32aab77b3377d83d12,
title = "A layout algorithm for undirected compound graphs",
abstract = "We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions.",
keywords = "Bioinformatics, Compound graphs, Force-directed graph layout, Graph drawing, Information visualization",
author = "Ugur Dogrusoz and Erhan Giral and Ahmet Cetintas and Ali Civril and Emek Demir",
year = "2009",
month = "3",
day = "15",
doi = "10.1016/j.ins.2008.11.017",
language = "English (US)",
volume = "179",
pages = "980--994",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "7",

}

TY - JOUR

T1 - A layout algorithm for undirected compound graphs

AU - Dogrusoz, Ugur

AU - Giral, Erhan

AU - Cetintas, Ahmet

AU - Civril, Ali

AU - Demir, Emek

PY - 2009/3/15

Y1 - 2009/3/15

N2 - We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions.

AB - We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions.

KW - Bioinformatics

KW - Compound graphs

KW - Force-directed graph layout

KW - Graph drawing

KW - Information visualization

UR - http://www.scopus.com/inward/record.url?scp=58249113123&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58249113123&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2008.11.017

DO - 10.1016/j.ins.2008.11.017

M3 - Article

AN - SCOPUS:58249113123

VL - 179

SP - 980

EP - 994

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 7

ER -