A compound graph layout algorithm for biological pathways

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

Research output: Contribution to journalConference article

24 Scopus citations

Abstract

We present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented within PATIKA, a pathway analysis tool for drawing complicated biological pathways with compartimental constraints and arbitrary nesting relations to represent molecular complexes and pathway abstractions. Experimental results show that execution times and quality of the produced drawings with respect to commonly accepted layout criteria and pathway drawing conventions are quite satisfactory.

Original languageEnglish (US)
Pages (from-to)442-447
Number of pages6
JournalLecture Notes in Computer Science
Volume3383
StatePublished - 2004
Event12th International Symposium on Graph Drawing, GD 2004 - New York, NY, United States
Duration: Sep 29 2004Oct 2 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A compound graph layout algorithm for biological pathways'. Together they form a unique fingerprint.

  • Cite this

    Dogrusoz, U., Giral, E., Cetintas, A., Civril, A., & Demir, E. (2004). A compound graph layout algorithm for biological pathways. Lecture Notes in Computer Science, 3383, 442-447.