A compound graph layout algorithm for biological pathways
Lecture Notes in Computer Science
442 - 447
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27422
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. © Springer-Verlag Berlin Heidelberg 2004.
- Conference Paper 2294