Özet

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.

Anahtar Kelimeler

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

Science Direct

Atıf Sayıları
Web of Science	71
Scopus	82
Google Scholar	155

A layout algorithm for undirected compound graphs

Paylaş