{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:51:21Z","timestamp":1757778681654},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T00:00:00Z","timestamp":1476230400000},"content-version":"vor","delay-in-days":398,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Evolving technology has increased the focus on genomics. The combination of today\u2019s advanced techniques with decades of molecular biology research has yielded huge amounts of pathway data. A standard, named the Systems Biology Graphical Notation (SBGN), was recently introduced to allow scientists to represent biological pathways in an unambiguous, easy-to-understand and efficient manner. Although there are a number of automated layout algorithms for various types of biological networks, currently none specialize on process description (PD) maps as defined by SBGN.<\/jats:p>\n               <jats:p>Results: We propose a new automated layout algorithm for PD maps drawn in SBGN. Our algorithm is based on a force-directed automated layout algorithm called Compound Spring Embedder (CoSE). On top of the existing force scheme, additional heuristics employing new types of forces and movement rules are defined to address SBGN-specific rules. Our algorithm is the only automatic layout algorithm that properly addresses all SBGN rules for drawing PD maps, including placement of substrates and products of process nodes on opposite sides, compact tiling of members of molecular complexes and extensively making use of nested structures (compound nodes) to properly draw cellular locations and molecular complex structures. As demonstrated experimentally, the algorithm results in significant improvements over use of a generic layout algorithm such as CoSE in addressing SBGN rules on top of commonly accepted graph drawing criteria.<\/jats:p>\n               <jats:p>Availability and implementation: An implementation of our algorithm in Java is available within ChiLay library (https:\/\/github.com\/iVis-at-Bilkent\/chilay).<\/jats:p>\n               <jats:p>Contact: \u00a0ugur@cs.bilkent.edu.tr or dogrusoz@cbio.mskcc.org<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btv516","type":"journal-article","created":{"date-parts":[[2015,9,12]],"date-time":"2015-09-12T00:23:51Z","timestamp":1442017431000},"page":"77-84","source":"Crossref","is-referenced-by-count":7,"title":["An algorithm for automated layout of process description maps drawn in SBGN"],"prefix":"10.1093","volume":"32","author":[{"given":"Begum","family":"Genc","sequence":"first","affiliation":[{"name":"1 The Insight Centre for Data Analytics, University College Cork, Western Road, Cork, Ireland,"},{"name":"2 Computer Engineering Department, Faculty of Engineering, Bilkent University, Ankara 06800, Turkey and"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugur","family":"Dogrusoz","sequence":"additional","affiliation":[{"name":"2 Computer Engineering Department, Faculty of Engineering, Bilkent University, Ankara 06800, Turkey and"},{"name":"3 Sander Lab, Memorial Sloan-Kettering Cancer Center, 417 E68th St., New York, NY 10065, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,9,10]]},"reference":[{"key":"2023020110241027200_btv516-B1","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Battista","year":"1998","edition":"1st edn"},{"key":"2023020110241027200_btv516-B2","doi-asserted-by":"crossref","first-page":"D685","DOI":"10.1093\/nar\/gkq1039","article-title":"Pathway commons, a web resource for biological pathway data","volume":"39","author":"Cerami","year":"2011","journal-title":"Nucleic Acids Res."},{"key":"2023020110241027200_btv516-B3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Visibility graphs. Computational Geometry: Algorithms and Applications","author":"de Berg","year":"2008","edition":"3rd edn"},{"key":"2023020110241027200_btv516-B4","doi-asserted-by":"crossref","first-page":"e1003194","DOI":"10.1371\/journal.pcbi.1003194","article-title":"Paxtools: a library for accessing, analyzing and creating biological pathway data","volume":"9","author":"Demir","year":"2013","journal-title":"PLoS Comput. Biol."},{"key":"2023020110241027200_btv516-B5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0020-0255(02)00183-4","article-title":"Two-dimensional packing algorithms for layout of disconnected graphs","volume":"143","author":"Dogrusoz","year":"2002","journal-title":"Inf. Sci."},{"key":"2023020110241027200_btv516-B6","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.cag.2005.10.015","article-title":"A multi-graph approach to complexity management in interactive graph visualization","volume":"30","author":"Dogrusoz","year":"2006","journal-title":"Comput. Graph."},{"key":"2023020110241027200_btv516-B7","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/38.974516","article-title":"Graph visualization toolkits","volume":"22","author":"Dogrusoz","year":"2002","journal-title":"IEEE Comput. Graph. Appl."},{"key":"2023020110241027200_btv516-B8","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1016\/j.ins.2008.11.017","article-title":"A layout algorithm for undirected compound graphs","volume":"179","author":"Dogrusoz","year":"2009","journal-title":"Inf. Sci."},{"key":"2023020110241027200_btv516-B9","first-page":"378","article-title":"Disconnected graph layout and the polyomino packing approach","volume-title":"Graph Drawing","author":"Freivalds","year":"2001"},{"key":"2023020110241027200_btv516-B10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S1478-5382(03)02370-9","article-title":"CellDesigner: a process diagram editor for gene-regulatory and biochemical networks","volume":"1","author":"Funahashi","year":"2003","journal-title":"BIOSILICO"},{"key":"2023020110241027200_btv516-B11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)","author":"Garey","year":"1979"},{"key":"2023020110241027200_btv516-B12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1186\/1471-2105-7-109","article-title":"VANTED: a system for advanced data analysis and visualization in the context of biological networks","volume":"7","author":"Junker","year":"2006","journal-title":"BMC Bioinformatics"},{"key":"2023020110241027200_btv516-B13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1111\/j.1551-6708.1987.tb00863.x","article-title":"Why a diagram is (sometimes) worth ten thousands words","volume":"11","author":"Larkin","year":"1987","journal-title":"Cogn. Sci."},{"key":"2023020110241027200_btv516-B14","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1038\/nbt.1558","article-title":"The systems biology graphical notation","volume":"27","author":"Le Nov\u00e8re","year":"2009","journal-title":"Nat. Biotechnol."},{"key":"2023020110241027200_btv516-B15","doi-asserted-by":"crossref","first-page":"e0128985","DOI":"10.1371\/journal.pone.0128985","article-title":"SBGNViz: a tool for visualization and complexity management of SBGN process description maps","volume":"10","author":"Sari","year":"2015","journal-title":"PLoS One"},{"key":"2023020110241027200_btv516-B16","doi-asserted-by":"crossref","first-page":"2016","DOI":"10.1093\/bioinformatics\/bts270","article-title":"Software support for SBGN maps: SBGN-ML and LibSBGN","volume":"28","author":"van Iersel","year":"2012","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/32\/1\/77\/49016493\/bioinformatics_32_1_77.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/32\/1\/77\/49016493\/bioinformatics_32_1_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T21:26:05Z","timestamp":1675286765000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/32\/1\/77\/1742665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btv516","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2016,1,1]]},"published":{"date-parts":[[2015,9,10]]}}}