Biological systems are characterised by complex, interwoven processes which comprise thousands of elements such as different genes, transcripts, proteins and metabolites. There are different representations of these processes, for example, textual descriptions or mathematical equation systems. Often biological systems are also represented as networks or graphs, see Figure 1. More details regarding the representation of biological networks as graphs, typical layout methods for different biological networks as well as generic layout methods can be found in articles such as , , , .
Biological networks can be separated or partitioned in different ways. For example, there exists a large collection of network analysis algorithms including many graph clustering methods , , partly also for the computation of non-overlapping clusters (partitions). It is also possible to separate the highly interconnected processes into different process classes, such as gene regulatory processes, protein interaction and metabolic processes among several other processes. Independent of the base for partitioning, the result are several non-overlapping clusters in the graph, as well as an overview graph where each node represents a cluster of the graph. This can be formalised as follows:
A (non-overlapping) clustered graph C = (G, GO ) consists of a base graph G and an overview graph GO , such that the nodes of GO represent the clusters of G, each node of G belongs to exactly one cluster, and there is an edge between nodes in GO if there are edges between nodes in the respective clusters in G, see Figure 2. Note that there are several definitions of clustered graphs, for example, a tree-based definition given by Eades defines a clustered graph C = (G, T) as consisting of a base graph G and a rooted tree T, such that the leaves of T are exactly the nodes of G . Let G = (VG , EG ) be the base graph. The hierarchy is defined by the tree T = (VT , ET ), with the leaves L(T) = VG . A view is defined as a subset of VT that induces a partition of VG . In the remainder of this article we will use the simple definition C = (G, GO ) with an overview graph. Here we also do not want to distinguish between clustered and heterogeneous graphs  and therefore consider heterogeneous graphs also clustered graphs where, for example, each cluster contains a specific graph type (graph types can be undirected graphs, directed graphs or graphs with specific node types such as to represent metabolic networks, to name a few examples).
Graphs are a mathematical concept for expressing structural relationships between elements of a certain system. An adequate layout of a graph helps to visually recognise its substructures. Layout and visualisation of clustered graphs (including graph structures such a planar clustered graphs and compound graphs) have been a research area in graph drawing for more than 30 years. Early work includes multi-level visualisation of clustered graphs , clustering and visual abstraction , structured layouts that separate zones for sub-graphs , orthogonal grid drawings of clustered graphs , drawing of compound graphs  and convex drawings of planar clustered graphs . While there have been approaches to apply the planarisation concept to clustered graphs in order to minimise crossings , , the complexity of the general decision problem is still unknown , and current solutions for sub-classes of clustered graphs are far from practical application . There also exist specific approaches for clustered biological networks such as the layout of biological compound graphs . To some extent visualisation solutions which compare several graphs and build a comparison tree  can also be seen as layouts of clustered graphs.
Mental-map preserving layouts, introduced by Misue et al. , play an important role for the understanding of layout changes. The mental map of a graph is the abstract representation of this graph in the user’s brain which is then used to quickly navigate through the graph visualisation when changes occur. Here we will use the term mental-map preserving for coordinated views where the layout of the overview graph is easily visible in the spatial relations of the different clusters – the mental map regarding the overview graph is preserved.
Vanted  is an open source framework for the analysis and visualisation of biological networks and related experimental data. An Add-on mechanism allows for simple extension of the Vanted core, and several extensions exist, for instance, to compute network centralities  and to visualise fluxes in networks . Vanted supports the visualisation of all kinds of biological networks and supports graphical standards for biological networks, in particular SBGN PD , SBGN ER  and SBGN AF . A typical workflow in Vanted is presented in  – in this workflow metabolic maps in the SBGN standard are constructed, enriched with different kinds of ∗omics data and exported to clickable websites. Other workflows can be found in .
The visualisation and exploration of networks is an important part of the Vanted workflow, therefore suitable methods to support these tasks are needed. Here we present NetPartVis, a method for layout and explorative visualisation of clustered graphs in Vanted which enables users to lay out an overview graph and the comprising sub-graphs (partitions) in a coordinated, mental-map preserving way. Due to the broad usability of such visualisations we decided to add NetPartVis to the main functionality of Vanted (core), therefore no additional loading of an Add-on is necessary.
2 NetPartVis – Layout and Visualisation of Clustered Graphs in Vanted
2.1 Construction of Graphs
Let G be the source (base) graph, GO the overview graph (initially empty) and G 1, … , Gk a set of graphs representing the clusters 1, …, k. Each node of G contains an ID (integer) from 1, …, k, representing the cluster this node belongs to.
The method for mental-map preserving visualisation of partitioned networks is based on the following data property: The source graph contains nodes that all have cluster IDs assigned. An overview graph and clustered sub-graphs are created from the source graph as follows:
For each distinct cluster ID that is assigned to at least one node in the source graph G, a new node representing a cluster is created in the overview graph GO .
For each edge in the source graph G, a new edge connecting nodes in GO is created, if and only if the cluster IDs of the source and target nodes of that edge in G are different. To avoid duplicated connections of nodes in the overview graph GO , in case of an existing edge no new edge is created, but a dedicated edge attribute, edgecount, is increased by one. Thereby the information on the number of connections between clusters in the source graph G remains available in the overview graph GO .
The sub-graphs G 1, … , Gk are then defined as follows: For i = 1, …, k graph Gi contains all nodes with ID i and all edges, whose end nodes have cluster ID i.
To assign cluster IDs to nodes and edges in the source graph G, users are offered several options in Vanted. Users can
Enter a cluster ID for the current selection of graph elements;
Copy cluster IDs from the labels of the selected graph elements;
Let cluster IDs be determined from connected sub-graphs;
Sort graph elements into different clusters each with a distinct cluster ID, based on a given attribute, such as size, colour and position among others.
To make different clusters better distinguishable in the source graph G and in the overview graph GO , nodes are colour-coded. Additionally, clusters can have their surrounding background also colour-coded. This can be particularly useful for very large clustered graphs. By changing the colour of the clusters, the colour of the corresponding nodes in the source and overview graphs, and the colour of the cluster backgrounds in the source graph, are modified, respectively. See Figure 3 for an example.
2.2 Layout of Graphs
To account for the size of the clusters and the connections between different clusters, the nodes and edges of the overview graph GO are modified:
For all nodes of GO holds: The size of a node ni in the overview graph is determined as described in the layout process below.
The thickness of an edge in GO is used to visualise the number of connections between clusters in the source graph G and for each edge of GO yields: The thickness of an edge is determined by its dedicated edge attribute edgecount.
The layout process consists of the following steps, illustrated in Figure 4:
Layout sub-graphs G 1, … , Gk : Any layout method available can be used, alternatively the existing layouts can be kept unmodified to preserve the layout of the clustered sub-graphs. The result of this step is that each sub-graph is laid out. Finally for each graph G 1, … , Gk the size of the bounding box is computed, and the size of the nodes n 1, … , nk of GO is set to the size of the bounding box of the respective graph.
Layout overview graph GO : Any layout method available can be used. As the size of the nodes in GO represents the bounding box of the clustered sub-graphs, it is advisable that the layout takes node size into account or that the distance between nodes is large enough such that nodes do not overlap.
The positions of the nodes n 1, … , nk of GO are used to layout G. The coordinates of nodes in G are based on the position of the nodes in GO and an offset based on the layout of the graphs G 1, … , Gk . For node n with cluster ID i the position is given by the position of ni of GO plus the position of n in Gi .
Thanks to the framework implementation of Vanted, NetPartVis provides additional features to work with and analyse graphs, such as to select and modify nodes which belong to a given cluster or set of clusters. All discussed methods are available in Vanted (http://www.vanted.org).
We presented a method for visualising complex large graphs by graph partitioning and laying out an overview graph and several sub-graphs (partitions) in a coordinated, mental-map preserving way. NetPartVis is part of the Vanted system for the analysis and visualisation of experimental data in the context of biological networks. However, Vanted is also a general graph editor which can be used for graphs or networks from many other domains. Networks can be imported using several standards, such as GML , GraphML , SBGN-ML  and others, and be exported in the respective format, or alternatively as images and clickable web pages. Thus, the presented method, as well as its implementation is of broad use for network visualisation and exploration.
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–7. PubMedCrossrefGoogle Scholar
Czauderna T, Wybrow M, Marriott K, Schreiber F. Conversion of kegg metabolic pathways to sbgn maps including automatic layout. BMC Bioinformatics 2013;14:250. PubMedCrossrefWeb of ScienceGoogle Scholar
Bachmaier C, Brandes U, Schreiber F. Biological networks. In: Handbook of graph drawing and visualization. Boca Raton: Taylor & Francis, 2014:621–651. Google Scholar
Di Battista G, Eades P, Tamassia R, et al. Graph drawing: Algorithms for the visualization of graphs. New Jersey: Prentice Hall; 1999. Google Scholar
Kohlbacher O, Schreiber F, Ward MO. Multivariate networks in the life sciences. In: Multivariate network visualization. Cham: Springer, 2014:61–73. Google Scholar
Brandes U, Erlebach T. Network analysis: Methodological foundations. volume 3418 of LNCS. Berlin, Heidelberg: Springer, 2005. Google Scholar
Junker BH, Schreiber F. Analysis of biological networks. Wiley series on bioinformatics, computational techniques and engineering. New Jersey: Wiley, 2008. Google Scholar
Eades P, Feng QW. Multilevel visualization of clustered graphs. In: Proceedings Graph Drawing, LNCS. volume 1190, Berlin, Heidelberg: Springer Verlag, 1996;101–112 1190. Google Scholar
Buchsbaum AL, Westbrook JR. Maintaining Hierarchical Graph Views. 11th ACM-SIAM Symposium on Discrete Algorithms; 2000. Google Scholar
Schreiber F, Kerren A, Börner K, Hagen H, Zeckzer D. Heterogeneous networks on multiple levels. In: Multi-variate network visualization. Cham: Springer, LNCS 8380, 2017:175–206. Google Scholar
Quigley A, Eades P. Fade: Graph drawing, clustering, and visual abstraction. In: Graph Drawing 2000, volume 1984 of LNCS. Berlin, Heidelberg: Springer, 2000:197–210. Google Scholar
Wang X, Miyamoto I. Generating customized layouts. In: Brandenburg FJ, ed. Graph Drawing. Berlin Heidelberg: Springer, 1996:504–515. Google Scholar
Eades P, Feng Q-W, Nagamochi H. Drawing clustered graphs on an orthogonal grid. J Graph Algorithms Appl 1997;3:3–29. Google Scholar
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’95), volume 959 of LNCS. Berlin, Heidelberg: Springer Verlag, 1995:21–30. Google Scholar
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–120. Google Scholar
Di Battista G, Didimo W, Marcandalli A. Planarization of clustered graphs. In: Mutzel P, Jünger M, Leipert S, eds. Graph Drawing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002:60–74. Google Scholar
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–38. Google Scholar
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’04), LNCS, 2004:442–447. Google Scholar
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 – IEEE TCVG Symposium on Visualization (VisSym’04). Eurographics Association, 2004:75–84. Google Scholar
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–9. Web of ScienceGoogle Scholar
Sorokin AA, Le Novère 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. PubMedGoogle Scholar
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. Google Scholar
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–93. CrossrefPubMedGoogle Scholar
Rohn H, Junker A, Hartmann A, Grafahrend-Belau E, Treutler H, Klapperstück M, et al. VANTED v2: A framework for systems biology applications. BMC Systems Biology 2012;6:139. Web of SciencePubMedGoogle Scholar
Himsolt M. GML: A portable graph file format. Technical report, University of Passau, 1996. Google Scholar
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–541. Google Scholar
Van Iersel MP, Villéger AC, Czauderna T, Boyd SE, Bergmann FT, Luna A, et al. Software support for sbgn maps: Sbgn-ml and libsbgn. Bioinformatics 2012;28:2016–21. Web of SciencePubMedCrossrefGoogle Scholar
About the article
Published Online: 2019-06-14
Funding Source: Deutsche Forschungsgemeinschaft
Award identifier / Grant number: SFB-TRR 161
Deutsche Forschungsgemeinschaft (Funder Id: http://dx.doi.org/10.13039/501100001659, SFB-TRR 161).
Conflict of interest statement: Authors state no conflict of interest. All authors have read the journal’s publication ethics and publication malpractice statement available at the journal’s website and hereby confirm that they comply with all its parts applicable to the present scientific work.
Citation Information: Journal of Integrative Bioinformatics, Volume 16, Issue 3, 20190026, ISSN (Online) 1613-4516, DOI: https://doi.org/10.1515/jib-2019-0026.
© 2019, Dimitar Garkov et al., published by Walter de Gruyter GmbH, Berlin/Boston. This work is licensed under the Creative Commons Attribution 4.0 Public License. BY 4.0