%0 Journal Article %1 1471-2105-10-375 %A Schreiber, Falk %A Dwyer, Tim %A Marriott, Kim %A Wybrow, Michael %D 2009 %J BMC Bioinformatics %K algorithm graph imported layout network toread %N 1 %P 375 %R 10.1186/1471-2105-10-375 %T A generic algorithm for layout of biological networks %U http://www.biomedcentral.com/1471-2105/10/375 %V 10 %X BACKGROUND:Biological networks are widely used to represent processes in biological systems and to capture interactions and dependencies between biological entities. Their size and complexity is steadily increasing due to the ongoing growth of knowledge in the life sciences. To aid understanding of biological networks several algorithms for laying out and graphically representing networks and network analysis results have been developed. However, current algorithms are specialized to particular layout styles and therefore different algorithms are required for each kind of network and/or style of layout. This increases implementation effort and means that new algorithms must be developed for new layout styles. Furthermore, additional effort is necessary to compose different layout conventions in the same diagram. Also the user cannot usually customize the placement of nodes to tailor the layout to their particular need or task and there is little support for interactive network exploration.RESULTS:We present a novel algorithm to visualize different biological networks and network analysis results in meaningful ways depending on network types and analysis outcome. Our method is based on constrained graph layout and we demonstrate how it can handle the drawing conventions used in biological networks.CONCLUSIONS:The presented algorithm offers the ability to produce many of the fundamental popular drawing styles while allowing the flexibility of constraints to further tailor these layouts.

@article{1471-2105-10-375, abstract = {BACKGROUND:Biological networks are widely used to represent processes in biological systems and to capture interactions and dependencies between biological entities. Their size and complexity is steadily increasing due to the ongoing growth of knowledge in the life sciences. To aid understanding of biological networks several algorithms for laying out and graphically representing networks and network analysis results have been developed. However, current algorithms are specialized to particular layout styles and therefore different algorithms are required for each kind of network and/or style of layout. This increases implementation effort and means that new algorithms must be developed for new layout styles. Furthermore, additional effort is necessary to compose different layout conventions in the same diagram. Also the user cannot usually customize the placement of nodes to tailor the layout to their particular need or task and there is little support for interactive network exploration.RESULTS:We present a novel algorithm to visualize different biological networks and network analysis results in meaningful ways depending on network types and analysis outcome. Our method is based on constrained graph layout and we demonstrate how it can handle the drawing conventions used in biological networks.CONCLUSIONS:The presented algorithm offers the ability to produce many of the fundamental popular drawing styles while allowing the flexibility of constraints to further tailor these layouts.}, added-at = {2009-11-13T10:08:56.000+0100}, author = {Schreiber, Falk and Dwyer, Tim and Marriott, Kim and Wybrow, Michael}, biburl = {https://www.bibsonomy.org/bibtex/2da02743052b1c2b0da9ca83885d82837/wnpxrz}, description = {Abstract | A generic algorithm for layout of biological networks}, doi = {10.1186/1471-2105-10-375}, interhash = {9dc1f8ee7f9dd36289d78a7b7c5ed1b4}, intrahash = {da02743052b1c2b0da9ca83885d82837}, issn = {1471-2105}, journal = {BMC Bioinformatics}, keywords = {algorithm graph imported layout network toread}, number = 1, pages = 375, timestamp = {2009-11-13T10:08:56.000+0100}, title = {A generic algorithm for layout of biological networks}, url = {http://www.biomedcentral.com/1471-2105/10/375}, volume = 10, year = 2009 }