Doğrusöz, UğurGiral, ErhanÇetintaş, AhmetÇivril, AliDemir, Emek2016-02-082016-02-082004-09-100302-9743http://hdl.handle.net/11693/27422Date of Conference: 29 September - 2 October 2004Conference name: 12th International Symposium on Graph Drawing, GD 2004We 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.EnglishComputer scienceConstraint theoryDrawing (graphics)Graph theoryArbitrary nestingBiological pathwaysCompartimental constraintsCompound graph layout algorithmsAlgorithmsConference Paper10.1007/978-3-540-31843-9_4510.1007/b105810