{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:51:39Z","timestamp":1753887099091,"version":"3.41.2"},"reference-count":36,"publisher":"Walter de Gruyter GmbH","issue":"3","license":[{"start":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T00:00:00Z","timestamp":1560470400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB-TRR 161"],"award-info":[{"award-number":["SFB-TRR 161"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Biological networks can be large and complex, often consisting of different sub-networks or parts. Separation of networks into parts, network partitioning and layouts of overview and sub-graphs are of importance for understandable visualisations of those networks. This article presents <jats:italic>NetPartVis<\/jats:italic> to visualise non-overlapping clusters or partitions of graphs in the Vanted framework based on a method for laying out overview graph and several sub-graphs (partitions) in a coordinated, mental-map preserving way.<\/jats:p>","DOI":"10.1515\/jib-2019-0026","type":"journal-article","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T09:14:27Z","timestamp":1560503667000},"source":"Crossref","is-referenced-by-count":3,"title":["Mental-Map Preserving Visualisation of Partitioned Networks in Vanted"],"prefix":"10.1515","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2134-1686","authenticated-orcid":false,"given":"Dimitar","family":"Garkov","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science , University of Konstanz , 78464 Konstanz , Germany"}]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science , University of Konstanz , 78464 Konstanz , Germany"}]},{"given":"Christian","family":"Klukas","sequence":"additional","affiliation":[{"name":"Digitalization of Research and Development, BASF SE , 67056 Ludwigshafen am Rhein , Germany"}]},{"given":"Falk","family":"Schreiber","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science , University of Konstanz , 78464 Konstanz , Germany"},{"name":"Faculty of Information Technology, Monash University , Clayton, Victoria 3800 , Australia"}]}],"member":"374","published-online":{"date-parts":[[2019,6,14]]},"reference":[{"key":"2023033120074897421_j_jib-2019-0026_ref_001_w2aab3b7b6b1b6b1ab1b4b1Aa","doi-asserted-by":"crossref","unstructured":"Kanehisa M, Goto S, Hattori M, Aoki-Kinoshita KF, Itoh M, Kawashima S, et al. From genomics to chemical genomics: new developments in KEGG. Nucleic Acids Res 2006;34:D354\u20137.1638188510.1093\/nar\/gkj102","DOI":"10.1093\/nar\/gkj102"},{"key":"2023033120074897421_j_jib-2019-0026_ref_002_w2aab3b7b6b1b6b1ab1b4b2Aa","unstructured":"Le Nov\u00e8re N, Hucka M, Mi H, Moodie S, Schreiber F, Sorokin A, et al. The systems biology graphical notation. Nat Biotechnol 2009;27:735\u201341.1966818310.1038\/nbt.1558"},{"key":"2023033120074897421_j_jib-2019-0026_ref_003_w2aab3b7b6b1b6b1ab1b4b3Aa","doi-asserted-by":"crossref","unstructured":"Czauderna T, Klukas C, Schreiber F. Editing, validating, and translating of SBGN maps. Bioinformatics 2010;26:2340\u20131.10.1093\/bioinformatics\/btq40720628075","DOI":"10.1093\/bioinformatics\/btq407"},{"key":"2023033120074897421_j_jib-2019-0026_ref_004_w2aab3b7b6b1b6b1ab1b4b4Aa","doi-asserted-by":"crossref","unstructured":"Czauderna T, Wybrow M, Marriott K, Schreiber F. Conversion of kegg metabolic pathways to sbgn maps including automatic layout. BMC Bioinformatics 2013;14:250.2395313210.1186\/1471-2105-14-250","DOI":"10.1186\/1471-2105-14-250"},{"key":"2023033120074897421_j_jib-2019-0026_ref_005_w2aab3b7b6b1b6b1ab1b4b5Aa","unstructured":"Bachmaier C, Brandes U, Schreiber F. Biological networks. In: Handbook of graph drawing and visualization. Boca Raton: Taylor & Francis, 2014:621\u2013651."},{"key":"2023033120074897421_j_jib-2019-0026_ref_006_w2aab3b7b6b1b6b1ab1b4b6Aa","unstructured":"Di Battista G, Eades P, Tamassia R, et al. Graph drawing: Algorithms for the visualization of graphs. New Jersey: Prentice Hall; 1999."},{"key":"2023033120074897421_j_jib-2019-0026_ref_007_w2aab3b7b6b1b6b1ab1b4b7Aa","doi-asserted-by":"crossref","unstructured":"Kohlbacher O, Schreiber F, Ward MO. Multivariate networks in the life sciences. In: Multivariate network visualization. Cham: Springer, 2014:61\u201373.","DOI":"10.1007\/978-3-319-06793-3_4"},{"key":"2023033120074897421_j_jib-2019-0026_ref_008_w2aab3b7b6b1b6b1ab1b4b8Aa","doi-asserted-by":"crossref","unstructured":"Schreiber F, Dwyer T, Marriott K, Wybrow M. A generic algorithm for layout of biological networks. BMC Bioinformatics 2009;10:375.10.1186\/1471-2105-10-37519909528","DOI":"10.1186\/1471-2105-10-375"},{"key":"2023033120074897421_j_jib-2019-0026_ref_009_w2aab3b7b6b1b6b1ab1b4b9Aa","doi-asserted-by":"crossref","unstructured":"Brandes U, Erlebach T. Network analysis: Methodological foundations. volume 3418 of LNCS. Berlin, Heidelberg: Springer, 2005.","DOI":"10.1007\/b106453"},{"key":"2023033120074897421_j_jib-2019-0026_ref_010_w2aab3b7b6b1b6b1ab1b4c10Aa","unstructured":"Junker BH, Schreiber F. Analysis of biological networks. Wiley series on bioinformatics, computational techniques and engineering. New Jersey: Wiley, 2008."},{"key":"2023033120074897421_j_jib-2019-0026_ref_011_w2aab3b7b6b1b6b1ab1b4c11Aa","doi-asserted-by":"crossref","unstructured":"Eades P, Feng QW. Multilevel visualization of clustered graphs. In: Proceedings Graph Drawing, LNCS. volume 1190, Berlin, Heidelberg: Springer Verlag, 1996;101\u2013112 1190.","DOI":"10.1007\/3-540-62495-3_41"},{"key":"2023033120074897421_j_jib-2019-0026_ref_012_w2aab3b7b6b1b6b1ab1b4c12Aa","unstructured":"Buchsbaum AL, Westbrook JR. Maintaining Hierarchical Graph Views. 11th ACM-SIAM Symposium on Discrete Algorithms; 2000."},{"key":"2023033120074897421_j_jib-2019-0026_ref_013_w2aab3b7b6b1b6b1ab1b4c13Aa","doi-asserted-by":"crossref","unstructured":"Schreiber F, Kerren A, B\u00f6rner K, Hagen H, Zeckzer D. Heterogeneous networks on multiple levels. In: Multi-variate network visualization. Cham: Springer, LNCS 8380, 2017:175\u2013206.","DOI":"10.1007\/978-3-319-06793-3_9"},{"key":"2023033120074897421_j_jib-2019-0026_ref_014_w2aab3b7b6b1b6b1ab1b4c14Aa","doi-asserted-by":"crossref","unstructured":"Quigley A, Eades P. Fade: Graph drawing, clustering, and visual abstraction. In: Graph Drawing 2000, volume 1984 of LNCS. Berlin, Heidelberg: Springer, 2000:197\u2013210.","DOI":"10.1007\/3-540-44541-2_19"},{"key":"2023033120074897421_j_jib-2019-0026_ref_015_w2aab3b7b6b1b6b1ab1b4c15Aa","doi-asserted-by":"crossref","unstructured":"Wang X, Miyamoto I. Generating customized layouts. In: Brandenburg FJ, ed. Graph Drawing. Berlin Heidelberg: Springer, 1996:504\u2013515.","DOI":"10.1007\/BFb0021835"},{"key":"2023033120074897421_j_jib-2019-0026_ref_016_w2aab3b7b6b1b6b1ab1b4c16Aa","doi-asserted-by":"crossref","unstructured":"Eades P, Feng Q-W, Nagamochi H. Drawing clustered graphs on an orthogonal grid. J Graph Algorithms Appl 1997;3:3\u201329.","DOI":"10.7155\/jgaa.00016"},{"key":"2023033120074897421_j_jib-2019-0026_ref_017_w2aab3b7b6b1b6b1ab1b4c17Aa","doi-asserted-by":"crossref","unstructured":"Sugiyama K, Misue K. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans Syst Man Cybern Syst 1991;21:876\u201392.10.1109\/21.108304","DOI":"10.1109\/21.108304"},{"key":"2023033120074897421_j_jib-2019-0026_ref_018_w2aab3b7b6b1b6b1ab1b4c18Aa","doi-asserted-by":"crossref","unstructured":"Feng Q-W, Cohen R F, Eades P. How to draw a planar clustered graph. In: Du D-Z, ed. Proceedings International Conference on Computing and Combinatorics (COCOON\u201995), volume 959 of LNCS. Berlin, Heidelberg: Springer Verlag, 1995:21\u201330.","DOI":"10.1007\/BFb0030816"},{"key":"2023033120074897421_j_jib-2019-0026_ref_019_w2aab3b7b6b1b6b1ab1b4c19Aa","doi-asserted-by":"crossref","unstructured":"Chimani M, Gutwenger C, Jansen M, et al. Computing maximum c-planar subgraphs. In: Tollis IG, Patrignani M, eds. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009:114\u2013120.","DOI":"10.1007\/978-3-642-00219-9_12"},{"key":"2023033120074897421_j_jib-2019-0026_ref_020_w2aab3b7b6b1b6b1ab1b4c20Aa","doi-asserted-by":"crossref","unstructured":"Di Battista G, Didimo W, Marcandalli A. Planarization of clustered graphs. In: Mutzel P, J\u00fcnger M, Leipert S, eds. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002:60\u201374.","DOI":"10.1007\/3-540-45848-4_5"},{"key":"2023033120074897421_j_jib-2019-0026_ref_021_w2aab3b7b6b1b6b1ab1b4c21Aa","doi-asserted-by":"crossref","unstructured":"Cortese PF, Patrignani M. Clustered planarity = flat clustered planarity. In: Biedl T, Kerren A, eds. Graph Drawing and Network Visualization. Cham: Springer International Publishing, 2018:23\u201338.","DOI":"10.1007\/978-3-030-04414-5_2"},{"key":"2023033120074897421_j_jib-2019-0026_ref_022_w2aab3b7b6b1b6b1ab1b4c22Aa","doi-asserted-by":"crossref","unstructured":"Chimani M, Di Battista G, Frati F, Klein K. Advances on testing c-planarity of embedded flat clustered graphs. Int J Found Comput Sci 2019;30:197\u2013230.10.1142\/S0129054119500011","DOI":"10.1142\/S0129054119500011"},{"key":"2023033120074897421_j_jib-2019-0026_ref_023_w2aab3b7b6b1b6b1ab1b4c23Aa","doi-asserted-by":"crossref","unstructured":"Dogrusoz U, Giral E, Cetintas A, et al. A compound graph layout algorithm for biological pathways. In: Pach J, ed. Proceedings International Symposium on Graph Drawing (GD\u201904), LNCS, 2004:442\u2013447.","DOI":"10.1007\/978-3-540-31843-9_45"},{"key":"2023033120074897421_j_jib-2019-0026_ref_024_w2aab3b7b6b1b6b1ab1b4c24Aa","unstructured":"Brandes U, Dwyer T, Schreiber F. Visual triangulation of network-based phylogenetic trees. In: Deussen O, Hansen C, Keim D, Saupe D, eds. Proceedings Joint Eurographics \u2013 IEEE TCVG Symposium on Visualization (VisSym\u201904). Eurographics Association, 2004:75\u201384."},{"key":"2023033120074897421_j_jib-2019-0026_ref_025_w2aab3b7b6b1b6b1ab1b4c25Aa","doi-asserted-by":"crossref","unstructured":"Misue K, Eades P, Lai W, Sugiyama K. Layout adjustment and the mental map. J Visual Lang Comput 1995;6:183\u2013210.10.1006\/jvlc.1995.1010","DOI":"10.1006\/jvlc.1995.1010"},{"key":"2023033120074897421_j_jib-2019-0026_ref_026_w2aab3b7b6b1b6b1ab1b4c26Aa","doi-asserted-by":"crossref","unstructured":"Junker BH, Klukas C, Schreiber F. VANTED: A system for advanced data analysis and visualization in the context of biological networks. BMC Bioinformatics. 2006;7:109.16519817","DOI":"10.1186\/1471-2105-7-109"},{"key":"2023033120074897421_j_jib-2019-0026_ref_027_w2aab3b7b6b1b6b1ab1b4c27Aa","doi-asserted-by":"crossref","unstructured":"Gr\u00e4\u00dfler J, Kosch\u00fctzki D, Schreiber F. Centilib: comprehensive analysis and exploration of network centralities. Bioinformatics 2012;28:1178\u20139.2239094010.1093\/bioinformatics\/bts106","DOI":"10.1093\/bioinformatics\/bts106"},{"key":"2023033120074897421_j_jib-2019-0026_ref_028_w2aab3b7b6b1b6b1ab1b4c28Aa","doi-asserted-by":"crossref","unstructured":"Rohn H, Hartmann A, Junker A, Junker BH, Schreiber F. Fluxmap: a vanted add-on for the visual exploration of flux distributions in biological networks. BMC Systems Biology 2012;6:33.1\u20139.","DOI":"10.1186\/1752-0509-6-33"},{"key":"2023033120074897421_j_jib-2019-0026_ref_029_w2aab3b7b6b1b6b1ab1b4c29Aa","doi-asserted-by":"crossref","unstructured":"Moodie SL, Le Nov\u00e8re N, Demir E, Mi H, Vill\u00e9ger A. Systems biology graphical notation: Process description language level 1 version 1.3. J Integr Bioinform 2015;12:263.26528561","DOI":"10.1515\/jib-2015-263"},{"key":"2023033120074897421_j_jib-2019-0026_ref_030_w2aab3b7b6b1b6b1ab1b4c30Aa","doi-asserted-by":"crossref","unstructured":"Sorokin AA, Le Nov\u00e8re N, Luna A, Czauderna T, Demir E, Haw R, et al. Systems biology graphical notation: Entity relationship language level 1 version 2. J Integr Bioinform 2015;12:264.26528562","DOI":"10.1515\/jib-2015-264"},{"key":"2023033120074897421_j_jib-2019-0026_ref_031_w2aab3b7b6b1b6b1ab1b4c31Aa","doi-asserted-by":"crossref","unstructured":"Mi H, Schreiber F, Moodie S, Czauderna T, Demir E, Haw R, et al. Systems biology graphical notation: activity flow language level 1 version 1.2. J Integr Bioinform 2015;12:e265.","DOI":"10.1515\/jib-2015-265"},{"key":"2023033120074897421_j_jib-2019-0026_ref_032_w2aab3b7b6b1b6b1ab1b4c32Aa","doi-asserted-by":"crossref","unstructured":"Junker A, Rohn H, Czauderna T, Klukas C, Hartmann A, Schreiber F. Creating interactive, web-based and data-enriched maps using the systems biology graphical notation. Nat Protoc 2012;7:579\u201393.10.1038\/nprot.2012.00222383037","DOI":"10.1038\/nprot.2012.002"},{"key":"2023033120074897421_j_jib-2019-0026_ref_033_w2aab3b7b6b1b6b1ab1b4c33Aa","doi-asserted-by":"crossref","unstructured":"Rohn H, Junker A, Hartmann A, Grafahrend-Belau E, Treutler H, Klapperst\u00fcck M, et al. VANTED v2: A framework for systems biology applications. BMC Systems Biology 2012;6:139.23140568","DOI":"10.1186\/1752-0509-6-139"},{"key":"2023033120074897421_j_jib-2019-0026_ref_034_w2aab3b7b6b1b6b1ab1b4c34Aa","unstructured":"Himsolt M. GML: A portable graph file format. Technical report, University of Passau, 1996."},{"key":"2023033120074897421_j_jib-2019-0026_ref_035_w2aab3b7b6b1b6b1ab1b4c35Aa","unstructured":"Brandes U, Eiglsperger M, Lerner J, et al. Graph markup language (GraphML). In: Tamassia R, ed. Handbook of graph drawing visualization, discrete mathematics and its applications. Boca Raton: CRC Press, 2013:517\u2013541."},{"key":"2023033120074897421_j_jib-2019-0026_ref_036_w2aab3b7b6b1b6b1ab1b4c36Aa","doi-asserted-by":"crossref","unstructured":"Van Iersel MP, Vill\u00e9ger AC, Czauderna T, Boyd SE, Bergmann FT, Luna A, et al. Software support for sbgn maps: Sbgn-ml and libsbgn. Bioinformatics 2012;28:2016\u201321.2258117610.1093\/bioinformatics\/bts270","DOI":"10.1093\/bioinformatics\/bts270"}],"container-title":["Journal of Integrative Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jib\/16\/3\/article-20190026.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2019-0026\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2019-0026\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T08:29:49Z","timestamp":1680337789000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2019-0026\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,14]]},"references-count":36,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,7,13]]},"published-print":{"date-parts":[[2019,9,25]]}},"alternative-id":["10.1515\/jib-2019-0026"],"URL":"https:\/\/doi.org\/10.1515\/jib-2019-0026","relation":{},"ISSN":["1613-4516"],"issn-type":[{"type":"electronic","value":"1613-4516"}],"subject":[],"published":{"date-parts":[[2019,6,14]]},"article-number":"20190026"}}