- Open Access
- Open Peer Review
This article has Open Peer Review reports available.
A survey of visualization tools for biological network analysis
© Pavlopoulos et al; licensee BioMed Central Ltd. 2008
Received: 25 June 2008
Accepted: 28 November 2008
Published: 28 November 2008
Bioinformatics has evolved and expanded continuously over the past four decades and has grown into a very important bridging discipline in life science research. The quantities of data obtained by new high-throughput technologies, including micro or Chip-Chip arrays, and large-scale "OMICS"-approaches, such as genomics, proteomics and transcriptomics, are vast and biological data repositories are growing exponentially in size. Furthermore, every minute scientific knowledge increases by thousands pages and to read the new scientific material produced in 24 hours a researcher would take several years. To follow the scientific output produced regarding a single disease, such as breast cancer, a scientist would have to scan more than a hundred different journals and read a few dozens papers per day.
The underlying data sets show a growing complexity and dynamics and are produced by numerous heterogeneous application areas. The integration of heterogeneous types of data is therefore gaining in importance. Currently different biological types of data, such as sequences, protein structures and families, proteomics data, ontologies, gene expression and other experimental data are stored in distinct databases. Existing databases or data collection can be very specialized and often they store the information using specific data formats. Many of them also contain overlapping but not exactly matching information with other databases, which introduces another hurdle to combine the information. In order to gain insights into the complexity and dynamics of biological systems, the information stored in these data repositories needs to be linked and combined in efficient ways. To address these issues, data integration became a main issue in the past years .
The challenge lies very often in the analysis of a huge amount of data to extract meaningful information and use them to answer some of the fundamental biological questions. Given the heterogeneity and the sheer amount of data it is a challenge to detect the relevant information and to provide a way to communicate the findings of the researcher in an efficient and appropriate way.
The human brain has evolved remarkable visual processing capabilities to analyze patterns and images. Thus, an interactive visual representation of information together with data analysis techniques is often the method of choice to simplify the interpretation of data. A wide variety of tools was developed over the past years that map data on 2D graphs to visualize biological interactions or relationships between bio-entities.
Graphs, as specified by graph theory, represent biological interactions in the form of extensive networks consisting of vertices, denoting nodes of individual bio-entities, and edges, describing connections between vertices. In the simplest example two vertices are linked by only one relationship, but connections can express different types of relationships between two elements, such as an evolutionary relationship, the existence of a shared protein domain, the fact that they belong to the same protein family or that two genes that are co-expressed in an experiment. Biological systems are complex and interwoven and in most cases single-line connections are insufficient to capture the whole range of information contained in a network, because components are often linked by more than one type of relationship. Two proteins might be connected because they act as part of the same protein complex, show similarities in their functional annotation, co-occur under certain conditions or are known to be evolutionary related. In such cases visualization tools based on multi-edged networks offer the possibility to link two vertices by multiple edges, every edge having a different meaning and information value.
In this review we describe tools which try to simplify the analysis and interpretation of biological data by transforming the raw data into logically structured and visually tangible representations. The goal of all of them is to find patterns and structures that remain hidden in the raw unstructured datasets.
Since the wealth of existing visualization tools makes an exhaustive collection and in-depth discussion of all available software tools impossible, we present a selection of several network viewers, which are broadly applicable. Our survey covers tools invented mainly over the past five years and discusses some of their advantages and shortcomings in order to aid researchers in choosing the most suitable visualization tool for their studies. Finally, we will highlight crucial gaps in the landscape of data visualization, discuss how existing tools could be improved to fill these gaps and lay out the perspectives and goals for the next generation of visualization tools.
A survey of network visualization tools
In the following section we discuss several widely used network visualization tools that have been developed over the past years. The presented tools are selected so as to cover the range of different functionalities and features crucial for data analysis and visualization. While the discussed tools are all broadly applicable, we will highlight their respective strengths and weaknesses if any, and comment on their specific features. Tools for analyzing protein-protein interactions, pathways, gene networks, heterogeneous networks or tools for studying evolutionary relationships between proteins have a very different scope and require a separate and much more detailed analysis which goes beyond the scope this review. Instead we try to provide a broad overview that can help guide users, especially those that are novices to the field of data visualization, towards the most appropriate tool for their research question and type of data.
Criteria for the assessment of visualization tools include power, efficiency and quality of network visualizations produced, the compatibility with other tools and data sources, the analytical functionalities offered (with specific focus on pattern recognition, data integration and comparison), limitations in terms of data quantity, broad applicability and user-friendliness. Following the detailed evaluation with respect to these criteria, a one sentence summary highlights the particular strengths of each tool.
Medusa is a Java application and available as an applet. It is an open source product under the GPL license.
Based on the Fruchterman-Reingold  algorithm, Medusa provides 2D representations of networks of medium size, up to a few hundred nodes and edges. It is less suited for the visualization of big datasets. Medusa uses non directed, multi-edge connections, which allows the simultaneous representation of more than one connection between two bioentities. Additional nodes can be fixed in order to facilitate pattern recognition and spring embedded layout algorithms help the relaxation of the network. Medusa supports weighted graphs and represents the significance and importance of a connection by varying line thickness.
Medusa has its own text file format that is not compatible with other visualization tools or integrated with other data sources. The input file format allows the user to annotate each node or connection.
Medusa is highly interactive. It allows the selection and analysis of subsets of nodes. A text search, which supports regular expressions, can be applied to find nodes. The status of a network can be saved and reloaded at any time but medusa is currently not connected to any data source.
The tool was developed mainly to show multi-edge connections where each line represents different concepts of information. Medusa is optimized for protein-protein interaction data as taken from STRING  or protein-chemical and chemical-chemical interactions as taken from STITCH .
Cytoscape is a standalone Java application. It is an open source project under LGPL license.
Cytoscape mainly provides 2D representations and is suitable for large-scale network analysis with hundredth thousands of nodes and edges. It can support directed, undirected and weighted graphs and comes with powerful visual styles that allow the user to change the properties of nodes or edges. The tool provides a variety of layout algorithms including cyclic and spring-embedded layouts. Furthermore, expression data can be mapped as node color, label, border thickness, or border color.
Cytoscape comes with various data parsers or filters that make it compatible with other tools. The file formats that are supported to save or load the graphs are SIF, GML, XGMML, BioPAX, PSI-MI, SBML, OBO. Cytoscape also allows the user to import mRNA expression profiles, gene functional annotations from the Gene Ontology (GO) and KEGG. Users can also directly import GO Terms and annotations from OBO and Gene Association files.
It is highly interactive and the user can zoom in or out and browse the network. The status of the network as well as the edge or node properties can be saved and reloaded. In addition, Cytoscape comes with a network manager to easily organize multiple networks. The user can have many different panels that hold the status of the network at different time points which makes it an efficient tool to compare networks between each other. It also comes with efficient network filtering capabilities. Users can select subsets of nodes and/or interactions and search for active subnetworks or pathway modules. It incorporates statistical analysis of the network and it makes it easy to cluster or detect highly interconnected regions.
Cytoscape main purpose is the visualization of molecular interaction networks and their integration with gene expression profiles and other data. It also allows the user to manipulate and compare multiple networks. Many plug-ins created by users are available and allow more specialized analysis of networks and molecular profiles.
BioLayout Express3D 
BioLayout Express3D is written in Java 1.5 and it uses the JOGL system for OpenGL rendering. It is released under the GNU Public License (GPL). A medium or higher range graphics card is necessary to run the software.
BioLayout Express3D is a tool for layout, visualization and clustering of large scale networks in both 3D and 2D. It supports both unweighted and weighted graphs together with edge annotation of pairwise relationships. It mainly employs the Fruchterman-Rheingold layout algorithm for 2D and 3D graph positioning and display of the network. A variety of colour schemes render the network more informative and clusters can be easier visualized. Since BioLayout Express3D uses a graphics renderer it is limited in the size of networks it can process.
It comes with a very simple input file format requiring the user to only provide a list of connections. The tool is compatible with Cytoscape and it supports layout, expression, yEd GraphML and sif file formats. It is currently not connected with data sources but in the next versions SBML support will make it compatible with various currently available databases.
BioLayout Express3D is highly interactive and the user can switch between 2D and 3D representations. Users can move around the current view, zoom in/out, rotate or move the network. In the latest version, the Markov Clustering algorithm (MCL) has become an integral part of BioLayout Express3D for clustering analysis. In this way data are automatically separated in distinct groups labeled by different color schemes.
BioLayout Express 3D offers different analytical approaches to microarray data analysis.
Osprey is a standalone application running under a wide range of platforms. It can be licensed for non commercial use and but source code is currently not available.
Osprey provides 2D representations of directed, undirected and weighted networks. It is not efficient for large scale network analysis but it provides various layout options and ways to arrange nodes in various geometric distributions. The layouts range from the relax algorithm over a simple circular layout to a more advanced Dual Spoked Ring layout that displays up to 1500 – 2000 nodes in a easily manageable format. The user can change the size and the colours of most Osprey objects such as edges, nodes, labels, and arrow heads.
Data can be loaded into the tool either using different text formats or by connecting directly to several databases, such as the BioGRID  or GRID (General Repository of Interaction Datasets) database. In addition to its own Osprey file format the tool can also load Custom Gene Network and Gene List formats, making Osprey compatible with other tool relying on the same file formats. Osprey networks can be saved in SVG, PNG and JPG format.
The tool provides several features for functional assessment and comparative analysis of different networks together with network and connectivity filters and dataset superimposing. Osprey also has the ability to cluster genes by GO Processes. Network filters can extract biological information that is supplied to Osprey either by the user or by instructions inside the GRID dataset. Connectivity filters identify nodes based on their connectivity levels. These are Minimum, Iterative Minimum and Depth. Finally, Osprey includes basic functions such as selecting and moving individual nodes or groups of nodes or removing nodes and edges.
With its various filtering capabilities, Osprey is a powerful tool for network manipulation. The ability to incorporate new interactions into an already existing network might be considered the tool's biggest asset.
ProViz is a standalone open source application under the GPL license.
It comes with both 2D and pseudo-3D display support to render data. It can manipulate single graphs in large-scale datasets with millions of nodes or connections. Leveraging the Tulip  drawing package, it generates appealing 3D visualizations. ProViz predominantly relies on the GEM  force based graph layout algorithm which facilitates the identification of key points in a network of interactions. In addition the tool also offers a circular and a hierarchical layout, which improve the detection of metabolic pathways or gene regulation networks in large datasets. ProViz is ideal to gain a first overview of networks because it allows fast navigation through graphs.
Graphs are saved and loaded in Tulip, PSI-MI  and IntAct  formats. Networks can also be exported in PNG format. ProViz addresses queries directly to the IntAct database even though it comes with support of some standard file formats, established in systems biology, like PSI-MI (see below).
Subgraphs that are produced by selection, filtering or clustering methods and can be automatically organized into views. With ProViz it is possible to annotate each node and each edge with comments or merge different datasets into a single graph. Users can also enrich the networks by querying available online databases. ProViz uses a controlled vocabulary on bio-molecules and interactions, described in XML format.
ProViz has its strength in the area of protein – protein interaction networks and their analysis using arbitrary properties, like for example annotations or taxonomic identifier. Its plug-in architecture allows a diversification of function according to the user's needs.
Ondex is a standalone freely available open source application.
Ondex provides 2D representations of directed, undirected and weighted networks. It can handle large scale networks of hundred thousands of nodes and edges. It also supports bidirectional connections, which are represented as curves. Moreover, different types of data are separated by placing them in different disks-circles interconnected between each other.
Data may be imported through a number of 'parsers' for public-domain and other databases, such as TRANSFAC [18–20], TRANSPATH [21, 22], CHEBI , Gene Ontology , KEGG [25–27], Drastic , Enzyme Nomenclature-ExPASy , Pathway Tools , Pathway Genomes (PGDBs), Plant Ontology, and Medical Subject Headings Vocabulary – MeSH . Graph objects can be exported to Cell Illustrator and XML formats. To reload or feed into other applications graph objects may be saved as ONDEX XML or an XGMML form.
Ondex integrates various filters that selectively add or remove connected nodes from the display according to user selectable rules of connectivity type like distance, level or equivalence. A SubTreeFilter can extract a tree-like sub-graph from a given node. Furthermore, the tool comes with a KnockOutFilter which can be used to determine the most important nodes at any given level. Data for integration is modeled as a suitable framework of concepts (such as gene, pathway, and protein) and relations (such as 'belongs_to', 'is_a') describe the mapping between them. In addition, a powerful filter is available to import microarray expression level data to globally analyze the relations between the different genes being expressed.
Ondex main strength is the ability to combine heterogeneous data types into one network. It is suitable for text mining, sequence and data integration analysis.
PATIKA (P athway A nalysis T ools for I ntegration and K nowledge A cquisition) is a web based non-open source application publicly available for non-commercial use. It has its own license.
It provides 2D representations of single or directed graphs. There are no limitations regarding the size of the graphs. It offers a very intuitive and widely accepted representation for cellular processes using directed graphs where nodes correspond to molecules and edges correspond to interactions between them. Even though the implemented variety of layout algorithms is rather limited, PATIKA is able to support bipartite graph of states and transitions. It represents different types of edges: product edges, where the source and target nodes of a product edge define the transition and a product of this transition, activator edges, where the source and target nodes of an activator edge define the activating state and the transition that is activated by this state, inhibitor edges where the source and target nodes of an activator edge define the inhibiting state and the transition that is inhibited by this state and substrate edges where the target and source nodes of a substrate edge define the transition and a substrate of this transition, respectively.
PATIKA integrates data from several sources, including Entrez Gene , UniProt , PubChem , GO , IntAct , HPRD , and Reactome [38, 39]. Users can query and access data using PATIKA's webquery interface, and save their results in XML format or export them as common picture formats. BioPAX and SBML exporters can be used as part of Patikas Web service.
The user can connect to the server and query the database to construct the desired pathway. Pathways are created on the fly, and drawn automatically. The user can manipulate a pathway through operations such as add new state or remove an existing transition, edit its contents such as the description of a state or transition or change the graphical view of a pathway component.
PATIKA is a tool for data integration and pathway analysis. It is an integrated software environment designed to provide researchers a complete solution for modeling and analyzing cellular processes. It is one of the few tools that allows to visualize transitions efficiently.
PIVOT is a Java application, free for academics. It comes with its own license agreement.
It projects everything in 2D and it uses single non directed lines to show relationships between bioentities. It is not limited to the size of data it can present. Overall the variety of incorporated layout algorithms is limited, but PIVOT employs specific layout algorithms for visualizing families.
Configured to work with proteins from four different species (human, yeast, drosophila and mouse), present functional annotations, identification of homologs from the four species, and links to external web information pages. The protein data are stored in an MS-Access file, easily modifiable by the users to enter their own data.
PIVOT can expand the network to display all proteins up to a specified distance, detect the shortest path of interactions or unfold the relationships among "distant" proteins, which respond similarly under a experiment's conditions. It can highlight dense areas of the map and use a window to visualize a subarea of a big networks. It is rich in features that help the users navigate and interpret the interactions map, as well as graph-theory algorithms for easily connecting remote proteins to the displayed map.
PIVOT is best suited for visualizing protein-protein interactions and identifying relationships between them, for example homologs.
Pajek is a standalone application. It is not an open source application but it is free for non-commercial use. It runs under Windows OS only.
It offers 2D representations and pseudo3d representations and supports single, directed and weighted graphs. Pajek is suitable for large scale networks with thousands or even million of nodes and vertices. It comes with a great variety of layout options like circular layout using partitions, circular layout using permutation or circular layout using random coordinates layout algorithms. Direct forcing and energy free layout algorithms , such as the Kimura-Kawai  and Fruchterman-Reingold  with free or fixed points are also included. It can also separate data into layers, which allows the display of hierarchical relationships. Pajek's ability to visualize multi-relational networks, networks between two disjoint sets of vertices and temporal networks make it one of the few tools that can handle dynamic graphs and reveal how networks change over time.
It comes with its own input file format, which is not compatible with commonly used XML formats. Neither is Pajek connected with any biological data sources. The status of the network can be saved any time and it allows export of information in EPS, SVG, X3D and VRML formats.
The tool is highly interactive and it incorporates many clustering methods, of which many are not very widely used however. It supports abstraction by (recursive) decomposition of a large network into several smaller networks and it implements a selection of efficient subquadratic algorithms for analysis of large networks. Pajek can detect clusters (components, neighborhoods of 'important' vertices, cores, etc.) in a network, extract vertices that belong to the same clusters and show them separately, shrink vertices in clusters or show relations among clusters.
Pajek's main strength is the variety of layout algorithms which greatly facilitate exploration and pattern identification within networks.
The field of data visualization currently faces three major challenges: ever increasing quantity of data to be visualized and analyzed, integration of heterogeneous data and the representation of multiple connections between nodes with heterogeneous biological meanings.
As the survey shows, each visualization tool has specific features and thus the tools vary in how they address the outlined challenges. When heterogeneity of data is the major challenge, integrative tools like Ondex, Pivot or Medusa offer possible solutions. When the sheer mass, but less the heterogeneity, poses a problem, tools with high resolution and good scaling functionalities, like Cytoscape or BioLayoutExpress3D are well equipped to help overcome these limitations. When working with systems biology data, that is highly interconnected and often linked by multiple biological relationships, Medusa and other tools featuring multi-edged networks are the most suitable. Pajek on the other hand is ideal for pattern recognition and to study the properties, such as density, centrality and frequency of nodes, of simple networks with single connections. For biological questions with a comparative focus Osprey is advisable.
Partly, more specialized tools are VisLink , KnowledgeEditor , Java editor for biological pathways , Pathway Studio , GenePath , PathScout , MAPMAN , MetaShark , CnPlot , CLANS , GSCope , BicOverlapper , Celestial3D , MetaNetter, HyperGraph, VANTED , Arena3D, SpectralNET , TouchGraph Google Browser, VisLink , SpectralNET , CnPlot . Before this new generation of visualization tools became available Otter , Plankton , GraphViz, Tulip, Negopy, KrackPlot , and MultiNet , have been the tools of choice.
Standard network file formats
One of the issues that most of the visualization tools have to address first is the complexity of the input data. Currently most of the network graph viewers come with their own input file formats to load and store the networks. This makes it difficult to use various tools for the same dataset since the user has to reformat the dataset every time according to the specific tool. This can be a strong limitation in cases where one would like to take advantage of the complementary strengths of different tools. We found that the missing interoperability between tools is one crucial bottleneck in exploring the variety of available methods.
Moving towards data integration, a number of common file formats and standard languages to store biological information have been introduced. Datasets that are stored in a standardized format can easily be incorporated into a visualization tool that supports the same format without requiring reprogramming nor understanding of the file format itself. Computer science has identified Extensible Markup Language (XML) as an appropriate format for data visualization because it is readable by both, computers and humans. XML stores information in the form of hierarchical tree structures, which allows fast and efficient searching by humans as well as machines. One other main factor why XML is in many cases a very suitable format is the platform-independent text-based format, which supports Unicode and is based on international standards. A further advantage of XML is the forward and backward compatibility which are easy to maintain. Of course one of the drawbacks of XML schemas is that the inherent redundancy may affect application efficiency due to higher storage, transmission and processing costs.
In the following section we discuss the most widely used file formats and standard languages in bioinformatics and chemoinformatics. Many open-source XML-based languages, most notably BioPAX, SBML and PSI-MI, rely on a leveled approaches, meaning that they contain various levels of complexity and specificity. It is a choice of the user to specify the level required to represent the information in their dataset.
This "pathway language" is a collaborative effort to create a computer readable data exchange format for biological data. The language was developed to allow distribution, sharing and exchange of information between pathway databases in a standard format by using a specific controlled vocabulary for tagging. BioPAX is based on an ontology of concepts with attributes, which allows to make a more explicit use of the relations between concepts compared to other standards. It is most suitable for the description of protein-protein interactions, genetic interactions, gene regulatory, metabolic and signaling pathways. BioPAX is being developed in a series of levels incorporating different features in each round. The current version has the focus on metabolic networks and molecular interaction networks, were the next development level is trying to implement gene and DNA interactions, signal transduction and genetic interactions. BioPAX is the most expressive language and is based on a rich hierarchy, which as a trade-off can result in a high degree of computational complexity. Being a comparatively new language BioPAX is not yet supported by the majority of tools presented here.
The acronym SBML stands for Systems Biology Markup Language and is a machine-readable format for describing qualitative and quantitative models of biochemical networks. The current version of SBML focuses on models for the analysis and simulation of basic biochemical networks. The next release will additionally incorporate the concept of model composition, the description of molecule complexes, layout information and spatial characteristics of the models. Many libraries and tools are available for parsing and editing SBML texts. Furthermore, several converters exist to convert SMBL into BioPAX and vice versa. Having started of as a language to describe biochemical reactions, SBML is now widely accepted and supported by over 100 different software systems worldwide, including systems for modeling and simulation, drawing and visualization tools and databases such as KEGG and BioCyc .
PSI-MI stands for Proteomics Standards Initiative Interaction and is a machine readable format intended for the exchange, comparison and verification of proteomics data. There are many tools available for viewing and converting PSI-MI data. The main focus is the definition of molecular interactions such as protein-protein interactions, rather than the description of complete cellular models.
CML [69, 70] is the acronym for Chemical Markup Language and is a language mainly developed to describe chemical concepts and information about molecules, reactions, spectra and analytical data, computational chemistry, chemical crystallography and materials.
Cell Markup Language  is an XML-like machine-readable language mainly developed for the exchange of computer-based mathematical models. CellML was originally developed for biological applications, but later proved to be applicable also to other disciplines. It can incorporate mathematical metadata by leveraging existing languages, including MathML  and RDF [73, 74]. CellML can hold information about data models, mathematic formulas and equations as well as metadata.
The Resource Description Framework, RDF [73, 74], is a language for the representation of information about resources on the World Wide Web. Since the World Wide Web moves towards semantic web structures, RDF was designed as a machine-readable XML-like language that describes networks. RDF tags employ a controlled RDF vocabulary. The idea behind RDF is the identification of Uniform Resource Identifiers (URIs) and the description of resources in terms of simple properties and property values.
BioPAX, SMBL and PSI MI are the three languages most applicable to biological data . Out of them BioPAX has the richest hierarchy due to the advanced tagging vocabulary and has the most general approach. It spans a broad range of biological data including genetic interactions, interaction networks, small molecules as well as regulatory and metabolic pathways. PSI-MI is ideal to handle experimental data like molecular interactions and interaction networks. SBML, on the other hand, is better suited for the description of relationships and is mostly used in simulations. It is the language of choice when it comes to rate formulas and biochemical reactions. A more detailed, comparative evaluation of these most common three file formats can be found in a recent study .
Nowadays, biological projects and experiments become more complex and bigger in scope and data that are produced are magnitudes higher than in the past. The increasing use of high-throughput technologies multiplies the amount of data generated per experiments and rapidly increases the sizes of the databases. In the analysis step we can identify the visualization of data as an already major bottleneck. The pure amount of data and their heterogeneity pose a challenge for efficient visualization tools. The main goal of the visualization tools should be the intuitive representation of data to provide an efficient interpretation and to allow a hypothesis driven planning of the next experiment.
In order to improve the scaling for big datasets most layout algorithms follow a heuristic approach instead of an exhaustive implementation. Despite the wealth of existing algorithms, the layout problem still remains one of the crucial bottlenecks in network visualization. Faster and more efficient algorithms are needed to bring especially large-scale networks into a form that can be easily understood and interpreted by the human brain. One way to circumvent the problem is parallelization of layout, clustering and graph theory algorithms that they can handle large networks. One solution could be the implementation of web services or libraries that outsource most of the computational effort and calculations to distant, powerful machines that can run many parallel jobs would greatly speed up the process of visualization and reduce the computational load on local computers. Another solution would be the way that these layout algorithms are written to be written in such a way that they can take advantage of the multi-core CPU or GPU technologies.
In addition, the extension of layout algorithms to encompass a third dimension would be one central step towards a new generation of visualization tools. This becomes more important in cases like pathway or heterogeneous data sets visualization. The extra dimension would allow a clearer structure and less cluttered views and could strongly facilitate a better navigation within the network. The extension of layout algorithms into three dimensions could thus render the representation of large-scale networks much more efficient, because 3D space minimizes the chance of crossover between two edges.
The third dimension would also offer an opportunity to fill a crucial gap in network data visualization; that is the representation of time. Currently, most network tools do not attempt to visualize time series data  and thus only produce a static snapshot of all the interactions happening in dynamic systems. Introducing the parameter time as an extra dimension into network visualization tools would thus achieve a more complete picture of complex and highly dynamic biological systems. Being able to investigate the dynamics of a system could provide breakthroughs in fields such as pathway analysis or the observation of interaction at different cell cycle time points.
The rapid growth of data calls for the incorporation of powerful filters into visualization tools. Filters that reduce the noise in a dataset and restrict the user's attention to a core set of nodes of a particular interest could greatly improve visualization. Similarly, more efficient and interactive graphical user interfaces (GUIs) would allow the user to visualize and explore relevant sub networks or limited areas of a whole network without having to sieve through vast data masses. To increase the performance of visualization tools further, efficient handling and allocation of memory is essential. This can be achieved by loading only the necessary parts of the graph into memory. In this way, the amount of data and the taxonomies that can be visualized can be rapidly increased. Of course, Graphical Process Units (GPUs) hardware performance increases over time, something that allows visualization tools to employ more resource demanding algorithms like those handling advanced graphics calculations.
The future generation of visualization tools should aim to reduce the gap between analysis and visualization. Most existing visualization tools only incorporate a limited number of data analysis functionalities, making it necessary to constantly switch between different applications. The user has to be aware of the variety of tools that are suitable to analyze his data and must switch between them. Information and data sharing between different tools has become a much simpler task due to standard file formats, which should be supported by newly developed visualization tools. Standard formats that are applicable to many different data types will be key features for the growing need to integrate heterogeneous data into a network. A true marriage of analysis and visualization, however, cannot be achieved merely by the support of multiple, standard file formats. Instead, future visualization applications should directly include several of the analytical functionalities that are available in the presented tools.
Ideally, the next generation of visualization tools should be able to present very heterogeneous data coming from databases, experiments and text-mining applications. They need to be able to visualize multi-edged networks, incorporate widely used clustering techniques, pattern recognition algorithms and statistical analysis methods. While technology evolves the visualization tools could explore the wider use of autostereoscopic 3D displays, which allow seeing three-dimensional images without the need of special glasses. A visualization tool designed to integrate most of the aforementioned functionalities would greatly simplify large-scale research in molecular biology and would significantly cut down time and effort spent on data processing and analysis.
In summary and to provide some concrete solutions to visualization tool challenges we suggest the following:
Visualization should be able to load and save data using worldwide standard file formats.
Incorporation of appropriate statistical analysis of the networks.
Algorithms that allow comparative analysis of different networks.
Implementation of libraries and services that allow layout algorithms to run in distant powerful computers.
Efficient layout algorithms that are able to use multi-core CPU technology.
Algorithms that implement rendering and graphical calculations in GPU.
Expansion of layout algorithms into 3D space especially for the visualization of pathway or heterogeneous data.
Visualization of the network behavior and its changes over time. Such animations are currently possible using Flash technologies.
- Lenzerini M: Data Integration: A Theoretical Perspective. PODS 2002. 2002, 243-246.Google Scholar
- Hooper SD, Bork P: Medusa: a simple tool for interaction graph analysis. Bioinformatics. 2005, 21 (24): 4432-4433. 10.1093/bioinformatics/bti696.View ArticlePubMedGoogle Scholar
- Fruchterman TMJ, Reingold EM: Graph Drawing by Force-Directed Placement. Software, Practice and Experience. 1991, 21: 1129-1164. 10.1002/spe.4380211102.View ArticleGoogle Scholar
- von Mering C, Jensen LJ, Kuhn M, Chaffron S, Doerks T, Krüger B, Snel B, Bork P: STRING 7-recent developments in the integration and prediction of protein interactions. Nucleic Acids Res. 2006, 35 (D358-62):Google Scholar
- Kuhn M, von Mering C, Campillos M, Jensen LJ, Bork P: STITCH: interaction networks of chemicals and proteins. Nucleic Acids Res. 2008, D684-688. 36 DatabaseGoogle Scholar
- Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, Ramage D, Amin N, Schwikowski B, Ideker T: Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 2003, 13 (11): 2498-2504. 10.1101/gr.1239303.View ArticlePubMedPubMed CentralGoogle Scholar
- Freeman TC, Goldovsky L, Brosch M, van Dongen S, Maziere P, Grocock RJ, Freilich S, Thornton J, Enright AJ: Construction, visualisation, and clustering of transcription networks from microarray expression data. PLoS computational biology. 2007, 3 (10): 2032-2042. 10.1371/journal.pcbi.0030206.View ArticlePubMedGoogle Scholar
- Breitkreutz : Osprey: a network visualization system. Genome Biol. 2003, 4 (3): R22-10.1186/gb-2003-4-3-r22.View ArticlePubMedPubMed CentralGoogle Scholar
- The BioGrid.Google Scholar
- Iragne F, Nikolski M, Mathieu B, Auber D, Sherman D: ProViz: protein interaction visualization and exploration. Bioinformatics. 2005, 21 (2): 272-274. 10.1093/bioinformatics/bth494.View ArticlePubMedGoogle Scholar
- Auber D: Tulip: A huge graph visualisation framework. Mathematics and Visualization. 2003, 105-126.Google Scholar
- Frick A, Ludwig A, Mehldan H: A fast adaptive layout algorithm for undirected graphs. Proceedings of Workshop on Graph Drawing 94, LNCS. 1994, 389-403. 894Google Scholar
- Hermjakob H, Montecchi-Palazzi L, Bader G, Wojcik J, Salwinski L, Ceol A, Moore S, Orchard S, Sarkans U, von Mering C, Roechert B, Poux S, Jung E, Mersch H, Kersey P, Lappe M, Li Y, Zeng R, Rana D, Nikolski M, Husi H, Brun C, Shanker K, Grant SG, Sander C, Bork P, Zhu W, Pandey A, Brazma A, Jacq B, Vidal M, Sherman D, Legrain P, Cesareni G, Xenarios I, Eisenberg D, Steipe B, Hogue C, Apweiler R: The HUPO PSI's molecular interaction format – a community standard for the representation of protein interaction data. Nat Biotechnol. 2004, 22 (2): 177-183. 10.1038/nbt926.View ArticlePubMedGoogle Scholar
- Hermjakob H, Montecchi-Palazzi L, Lewington C, Mudali S, Kerrien S, Orchard S, Vingron M, Roechert B, Roepstorff P, Valencia A, Margalit H, Armstrong J, Bairoch A, Cesareni G, Sherman D, Apweiler R: IntAct: an open source molecular interaction database. Nucleic Acids Res. 2004, D452-455. 10.1093/nar/gkh052. 32 DatabaseGoogle Scholar
- Köhler J, Rawlings C, Verrier P, Mitchell R, Skusa A, Rüegg A, Philippi S: Linking experimental results, biological networks and sequence analysis methods using Ontologies and Generalized Data Structures. In Silico Biol. 2004, 5 (1): 33-44. (Ontology and Genome, Manuscript number in online journal: 0005.)Google Scholar
- Köhler JBJ, Taubert Jan, Specht Michael, Skusa Andre, Rüegg Alexander, Rawlings Chris, Verrier Paul, Philipp Stephan: Graph-based analysis and visualization of experimental results with ONDEX. Bioinformatics. 2006, 22 (11): 1383-1390. 10.1093/bioinformatics/btl081.View ArticlePubMedGoogle Scholar
- Skusa A, Rüegg A, Köhler J: Extraction of biological networks from scientific literature. Briefings in Bioinformatics. 2005, 6 (3):Google Scholar
- Matys V, Fricke E, Geffers R, Gossling E, Haubrock M, Hehl R, Hornischer K, Karas D, Kel AE, Kel-Margoulis OV, Kloos DU, Land S, Lewicki-Potapov B, Michael H, Munch R, Reuter I, Rotert S, Saxel H, Scheer M, Thiele S, Wingender E: TRANSFAC: transcriptional regulation, from patterns to profiles. Nucleic Acids Res. 2003, 31 (1): 374-378. 10.1093/nar/gkg108.View ArticlePubMedPubMed CentralGoogle Scholar
- Wingender E, Chen X, Hehl R, Karas H, Liebich I, Matys V, Meinhardt T, Pruss M, Reuter I, Schacherer F: TRANSFAC: an integrated system for gene expression regulation. Nucleic Acids Res. 2000, 28 (1): 316-319. 10.1093/nar/28.1.316.View ArticlePubMedPubMed CentralGoogle Scholar
- Wingender E, Dietze P, Karas H, Knuppel R: TRANSFAC: a database on transcription factors and their DNA binding sites. Nucleic Acids Res. 1996, 24 (1): 238-241. 10.1093/nar/24.1.238.View ArticlePubMedPubMed CentralGoogle Scholar
- Krull M, Voss N, Choi C, Pistor S, Potapov A, Wingender E: TRANSPATH: an integrated database on signal transduction and a tool for array analysis. Nucleic Acids Res. 2003, 31 (1): 97-100. 10.1093/nar/gkg089.View ArticlePubMedPubMed CentralGoogle Scholar
- Krull M, Pistor S, Voss N, Kel A, Reuter I, Kronenberg D, Michael H, Schwarzer K, Potapov A, Choi C, Kel-Margoulis O, Wingender E: TRANSPATH: an information resource for storing and visualizing signaling pathways and their pathological aberrations. Nucleic Acids Res. 2006, D546-551. 10.1093/nar/gkj107. 34 DatabaseGoogle Scholar
- Degtyarenko K, de Matos P, Ennis M, Hastings J, Zbinden M, McNaught A, Alcantara R, Darsow M, Guedj M, Ashburner M: ChEBI: a database and ontology for chemical entities of biological interest. Nucleic Acids Res. 2008, D344-350. 36 DatabaseGoogle Scholar
- Ashburner M, Ball CA, Blake JA, Botstein D, Butler H, Cherry JM, Davis AP, Dolinski K, Dwight SS, Eppig JT, Harris MA, Hill DP, Issel-Tarver L, Kasarskis A, Lewis S, Matese JC, Richardson JE, Ringwald M, Rubin GM, Sherlock G: Gene ontology: tool for the unification of biology. The Gene Ontology Consortium. Nat Genet. 2000, 25 (1): 25-29. 10.1038/75556.View ArticlePubMedPubMed CentralGoogle Scholar
- Kanehisa M, Goto S: KEGG: kyoto encyclopedia of genes and genomes. Nucleic Acids Res. 2000, 28 (1): 27-30. 10.1093/nar/28.1.27.View ArticlePubMedPubMed CentralGoogle Scholar
- Ogata H, Goto S, Sato K, Fujibuchi W, Bono H, Kanehisa M: KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Res. 1999, 27 (1): 29-34. 10.1093/nar/27.1.29.View ArticlePubMedPubMed CentralGoogle Scholar
- Kanehisa M, Goto S, Kawashima S, Okuno Y, Hattori M: The KEGG resource for deciphering the genome. Nucleic Acids Res. 2004, D277-280. 10.1093/nar/gkh063. 32 DatabaseGoogle Scholar
- Button DK, Gartland KM, Ball LD, Natanson L, Gartland JS, Lyon GD: DRASTIC – INSIGHTS: querying information in a plant gene expression database. Nucleic Acids Res. 2006, D712-716. 10.1093/nar/gkj136. 34 DatabaseGoogle Scholar
- Bairoch A: The ENZYME database in 2000. Nucleic Acids Res. 2000, 28 (1): 304-305. 10.1093/nar/28.1.304.View ArticlePubMedPubMed CentralGoogle Scholar
- Karp PD, Paley S, Romero P: The Pathway Tools software. Bioinformatics. 2002, 18 (Suppl 1): S225-232.View ArticlePubMedGoogle Scholar
- Bruskiewich , Coe E-HJ-P, McCouch S, Polacco M, Stein L, Vincent L, Ware D: The Plant Ontology™ Consortium and Plant Ontologies. Comparative and Functional Genomics. 2002, 3 (2): 137-142. 10.1002/cfg.158.View ArticleGoogle Scholar
- Shojania KG, Olmsted RN: Searching the health care literature efficiently: from clinical decision-making to continuing education. Am J Infect Control. 2002, 30 (3): 187-195. 10.1067/mic.2002.120801.View ArticlePubMedGoogle Scholar
- Demir OB E, Dogrusoz U, Gursoy A, Nisanci G, Cetin-Atalay R, Ozturk M: PATIKA: An Integrated Visual Environment for Collaborative Construction and Analysis of Cellular Pathways. Bioinformatics. 2002, 18: 996-1003. 10.1093/bioinformatics/18.7.996.View ArticleGoogle Scholar
- Maglott D, Ostell Jim, Pruitt Kim, Tatusova T: Entrez Gene: gene-centered information at NCBI. Nucleic Acids Res. 2005, 33: D54-D58. 10.1093/nar/gki031.View ArticlePubMedGoogle Scholar
- Consortium. U: The Universal Protein Resource (UniProt). Nucleic Acids Res. 2007, 36: D190-D195. 10.1093/nar/gkm895.View ArticleGoogle Scholar
- Wheeler DL, Chappey C, Lash AE, Leipe DD, Madden TL, Schuler GD, Tatusova TA, Rapp BA: Database resources of the National Center for Biotechnology Information. Nucleic Acids Res. 2000, 28 (1): 10-14. 10.1093/nar/28.1.10.View ArticlePubMedPubMed CentralGoogle Scholar
- Peri JDJN, Amanchy TK R, Jonnalagadda CK, Surendranath V, Niranjan V, Muthusamy B, Gandhi TK, Gronborg M, Ibarrola N, Deshpande N, Shanker K, Shivashankar HN, Rashmi BP, Ramya MA, Zhao Z, Chandrika KN, Padma N, Harsha HC, Yatish AJ, Kavitha MP, Menezes M, Choudhury DR, Suresh S, Ghosh N, Saravana R, Chandran S, Krishna S, Joy M, Anand SK, Madavan V, Joseph A, Wong GW, Schiemann WP, Constantinescu SN, Huang L, Khosravi-Far R, Steen H, Tewari M, Ghaffari S, Blobe GC, Dang CV, Garcia JG, Pevsner J, Jensen ON, Roepstorff P, Deshpande KS, Chinnaiyan AM, Hamosh A, Chakravarti A, Pandey A: Development of human protein reference database as an initial platform for approaching systems biology in humans. Genome Res. 2003, 31 (10): 2363-2371. 10.1101/gr.1680803.View ArticleGoogle Scholar
- Vastrik I, D'Eustachio P, Schmidt E, Joshi-Tope G, Gopinath G, Croft D, de Bono B, Gillespie M, Jassal B, Lewis S, Matthews L, Wu G, Birney E, Stein L: Reactome: a knowledge base of biologic pathways and processes. Genome Biol. 2007, 8 (3): R39-10.1186/gb-2007-8-3-r39.View ArticlePubMedPubMed CentralGoogle Scholar
- Joshi-Tope G, Gillespie M, Vastrik I, D'Eustachio P, Schmidt E, de Bono B, Jassal B, Gopinath GR, Wu GR, Matthews L, Lewis S, Birney E, Stein L: Reactome: a knowledgebase of biological pathways. Nucleic Acids Res. 2005, D428-432. 33 DatabaseGoogle Scholar
- Nir Orlev RS, Yosef Shiloh: PIVOT: protein interactions visualization tool. Bioinformatics. 2003Google Scholar
- Batagelj V, Mrvar A: Pajek – Program for Large Network Analysis. Connections. 1998, 21: 47-57.Google Scholar
- Suderman M, Hallett M: Tools for visually exploring biological networks. Bioinformatics. 2007, 23 (20): 2651-2659. 10.1093/bioinformatics/btm401.View ArticlePubMedGoogle Scholar
- Kamada T, Kawai S: An algorithm for drawing general undirected graphs. Information Processing Letters. 1989, 31: 7-15. 10.1016/0020-0190(89)90102-6.View ArticleGoogle Scholar
- Collins C, Carpendale S: VisLink: revealing relationships amongst visualizations. IEEE Trans Vis Comput Graph. 2007, 13 (6): 1192-1199. 10.1109/TVCG.2007.70521.View ArticlePubMedGoogle Scholar
- Toyoda T, Konagaya A: KnowledgeEditor: a new tool for interactive modeling and analyzing biological pathways based on microarray data. Bioinformatics. 2003, 19 (3): 433-434. 10.1093/bioinformatics/btf874.View ArticlePubMedGoogle Scholar
- Trost E, Hackl H, Maurer M, Trajanoski Z: Java editor for biological pathways. Bioinformatics. 2003, 19 (6): 786-787. 10.1093/bioinformatics/btg052.View ArticlePubMedGoogle Scholar
- Nikitin A, Egorov S, Daraselia N, Mazo I: Pathway studio – the analysis and navigation of molecular networks. Bioinformatics. 2003, 19 (16): 2155-2157. 10.1093/bioinformatics/btg290.View ArticlePubMedGoogle Scholar
- Zupan B, Demsar J, Bratko I, Juvan P, Halter JA, Kuspa A, Shaulsky G: GenePath: a system for automated construction of genetic networks from mutant data. Bioinformatics. 2003, 19 (3): 383-389. 10.1093/bioinformatics/btf871.View ArticlePubMedGoogle Scholar
- Minch EM, de Rinaldis MS: pathSCOUT TM: exploration and analysis of biochemical pathways. Bioinformatics. 2003, 19 (3): 431-432. 10.1093/bioinformatics/btf880.View ArticlePubMedGoogle Scholar
- Thimm O, Blasing O, Gibon Y, Nagel A, Meyer S, Kruger P, Selbig J, Muller LA, Rhee SY, Stitt M: MAPMAN: a user-driven tool to display genomics data sets onto diagrams of metabolic pathways and other biological processes. Plant J. 2004, 37 (6): 914-939. 10.1111/j.1365-313X.2004.02016.x.View ArticlePubMedGoogle Scholar
- Hyland C, Pinney JW, McConkey GA, Westhead DR: metaSHARK: a WWW platform for interactive exploration of metabolic networks. Nucleic Acids Res. 2006, W725-728. 10.1093/nar/gkl196. 34 Web ServerGoogle Scholar
- Batada NN: CNplot: visualizing pre-clustered networks. Bioinformatics. 2004, 20 (9): 1455-1456. 10.1093/bioinformatics/bth080.View ArticlePubMedGoogle Scholar
- Frickey T, Lupas A: CLANS: a Java application for visualizing protein families based on pairwise similarity. Bioinformatics. 2004, 20 (18): 3702-3704. 10.1093/bioinformatics/bth444.View ArticlePubMedGoogle Scholar
- Toyoda T, Mochizuki Y, Konagaya A: GSCope: a clipped fisheye viewer effective for highly complicated biomolecular network graphs. Bioinformatics. 2003, 19 (3): 437-438. 10.1093/bioinformatics/btg001.View ArticlePubMedGoogle Scholar
- Santamaria R, Theron R, Quintales L: BicOverlapper: a tool for bicluster visualization. Bioinformatics. 2008, 24 (9): 1212-1213. 10.1093/bioinformatics/btn076.View ArticlePubMedGoogle Scholar
- Loh AM, Wiltshire S, Emery J, Carter KW, Palmer LJ: Celestial3D: a novel method for 3D visualization of familial data. Bioinformatics. 2008, 24 (9): 1210-1211. 10.1093/bioinformatics/btn091.View ArticlePubMedGoogle Scholar
- Jourdan F, Breitling R, Barrett MP, Gilbert D: MetaNetter: inference and visualization of high-resolution metabolomic networks. Bioinformatics. 2008, 24 (1): 143-145. 10.1093/bioinformatics/btm536.View ArticlePubMedGoogle Scholar
- 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-10.1186/1471-2105-7-109.View ArticlePubMedPubMed CentralGoogle Scholar
- Forman JJ, Clemons PA, Schreiber SL, Haggarty SJ: SpectralNET – an application for spectral graph analysis and visualization. BMC Bioinformatics. 2005, 6: 260-10.1186/1471-2105-6-260.View ArticlePubMedPubMed CentralGoogle Scholar
- Huffaker BNE, Claffy K: Otter: A general-purpose network visualization tool. International Networking Conference (INET). 1999Google Scholar
- Becker SGE Richard, Wilks Allan: IEEE Transactions on Visualization and Computer Graphics. 1995, 1 (1): 16-21. 10.1109/2945.468391.View ArticleGoogle Scholar
- Kim JI, Palmore JA: Personal networks and the adoption of family planning in rural Korea. Ingu Pogon Nonjip. 1984, 4 (2): 125-145.PubMedGoogle Scholar
- Krackhardt DaJBaCM: KrackPlot 3.0: An Improved Network Drawing Program. Connections. 1994, 17: 53-55.Google Scholar
- Seary AaWR: Network Analysis with MultiNet.". International Network for Social Network Analysis. 2002Google Scholar
- BioPAX Working group: BioPAX-biological pathways exchange language. Version 10 Documentation. 2004Google Scholar
- Finney A, Hucka M: Systems biology markup language: Level 2 and beyond. Biochem Soc Trans. 2003, 31 (Pt 6): 1472-1473. 10.1042/BST0311472.View ArticlePubMedGoogle Scholar
- Hucka M, Finney A, Sauro HM, Bolouri H, Doyle JC, Kitano H, Arkin AP, Bornstein BJ, Bray D, Cornish-Bowden A, Cuellar AA, Dronov S, Gilles ED, Ginkel M, Gor V, Goryanin II, Hedley WJ, Hodgman TC, Hofmeyr JH, Hunter PJ, Juty NS, Kasberger JL, Kremling A, Kummer U, Le Novere N, Loew LM, Lucio D, Mendes P, Minch E, Mjolsness ED, Nakayama Y, Nelson MR, Nielsen PF, Sakurada T, Schaff JC, Shapiro BE, Shimizu TS, Spence HD, Stelling J, Takahashi K, Tomita M, Wagner J, Wang J: The systems biology markup language (SBML): a medium for representation and exchange of biochemical network models. Bioinformatics. 2003, 19 (4): 524-531. 10.1093/bioinformatics/btg015.View ArticlePubMedGoogle Scholar
- Keseler IM, Collado-Vides J, Gama-Castro S, Ingraham J, Paley S, Paulsen IT, Peralta-Gil M, Karp PD: EcoCyc: a comprehensive database resource for Escherichia coli. Nucleic Acids Res. 2005, D334-337. 33 DatabaseGoogle Scholar
- Murray RP, S RH: Chemical Markup, XML, and the Worldwide Web. 1. Basic Principles. Chem Inf Comput Sci. 1999, 39: 928-942.View ArticleGoogle Scholar
- Murray-Rust P, Rzepa HS, Wright M: Development of Chemical Markup Language (CML) as a System for Handling Complex Chemical Content. New J Chem. 2001, 618-634. 10.1039/b008780g.Google Scholar
- Lloyd CM, Halstead MD, Nielsen PF: CellML: its future, present and past. Prog Biophys Mol Biol. 2004, 85 (2–3): 433-450. 10.1016/j.pbiomolbio.2004.01.004.View ArticlePubMedGoogle Scholar
- Ausbrooks R, Stephen Buswell DC, Stphane Dalmas, Stan Devitt, Angel , Diaz MF, Roger Hunter, Patrick Ion, Michael Kohlhase, Robert Miner, Nico , Poppelier BS, Neil Soiffer, Robert Sutor, Stephen Watt: Mathematical Markup Language (MathML) version 2.0 (second edition). W3c recommendation, World Wide Web Consortium. 2003Google Scholar
- Lassila O, Swick R: Resource Description Framework (RDF) Model and Syntax Specification. The World Wide Web Consortium (W3C) MIT, INRIA. 1999Google Scholar
- RDF vocabulary description language 1.0: RDF Schema. [http://www.w3.org/tr/2002/wd-rdf-schema-20020430/]
- Brazma A, Krestyaninova M, Sarkans U: Standards for systems biology. Nat Rev Genet. 2006, 7 (8): 593-605. 10.1038/nrg1922.View ArticlePubMedGoogle Scholar
- Stromback L, Lambrix P: Representations of molecular pathways: an evaluation of SBML, PSI MI and BioPAX. Bioinformatics. 2005, 21 (24): 4401-4407. 10.1093/bioinformatics/bti718.View ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.