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 language | English (US) |
|---|---|
| Pages (from-to) | 442-447 |
| Number of pages | 6 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3383 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | 12th International Symposium on Graph Drawing, GD 2004 - New York, NY, United States Duration: Sep 29 2004 → Oct 2 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science