Doğrusöz, UğurGiral, ErhanÇetintaş, AhmetCivril, AliDemir, Emek2016-02-082016-02-082009-03-150020-0255http://hdl.handle.net/11693/22804We 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. © 2008 Elsevier Inc. All rights reserved.EnglishBioinformaticsCompound graphsForce-directed graph layoutGraph drawingInformation visualizationInformation analysisInformation systemsPhotocopyingVisualizationApplication specificsArbitrary nestingBiological pathwaysExecution timesLayout algorithmsLayout schemesMolecular complexesPathway integrationsGraph theoryArticle10.1016/j.ins.2008.11.0171872-6291