SpectralNET--an application for spectral graph analysis and visualization

A protein network descriptor server and its use in studying protein, disease, metabolic and drug targeted networks

The genetic, proteomic, disease and pharmacological studies have generated rich data in protein interaction, disease regulation and drug activities useful for systems-level study of the biological, disease and drug therapeutic processes. These studies are facilitated by the established and the emerging computational methods. More recently, the network descriptors developed in other disciplines have become more increasingly used for studying the protein-protein, gene regulation, metabolic, disease networks. There is an inadequate coverage of these useful network features in the public web servers. We therefore introduced upto 313 literature-reported network descriptors in PROFEAT web server, for describing the topological, connectivity and complexity characteristics of undirected unweighted (uniform binding constants and molecular levels), undirected edge-weighted (varying binding constants), undirected node-weighted (varying molecular levels), undirected edge-node-weighted (varying binding constants and molecular levels) and directed unweighted (oriented process) networks. The usefulness of the PROFEAT computed network descriptors is illustrated by their literature-reported applications in studying the protein-protein, gene regulatory, gene co-expression, protein-drug and metabolic networks. PROFEAT is accessible free of charge at http://bidd2.nus.edu.sg/cgi-bin/profeat2016/main.cgi.

PROFEAT Update: A Protein Features Web Server with Added Facility to Compute Network Descriptors for Studying Omics-Derived Networks

The studies of biological, disease, and pharmacological networks are facilitated by the systems-level investigations using computational tools. In particular, the network descriptors developed in other disciplines have found increasing applications in the study of the protein, gene regulatory, metabolic, disease, and drug-targeted networks. Facilities are provided by the public web servers for computing network descriptors, but many descriptors are not covered, including those used or useful for biological studies. We upgraded the PROFEAT web server http://bidd2.nus.edu.sg/cgi-bin/profeat2016/main.cgi for computing up to 329 network descriptors and protein-protein interaction descriptors. PROFEAT network descriptors comprehensively describe the topological and connectivity characteristics of unweighted (uniform binding constants and molecular levels), edge-weighted (varying binding constants), node-weighted (varying molecular levels), edge-node-weighted (varying binding constants and molecular levels), and directed (oriented processes) networks. The usefulness of the network descriptors is illustrated by the literature-reported studies of the biological networks derived from the genome, interactome, transcriptome, metabolome, and diseasome profiles.

VennPainter: A Tool for the Comparison and Identification of Candidate Genes Based on Venn Diagrams

VennPainter is a program for depicting unique and shared sets of genes lists and generating Venn diagrams, by using the Qt C++ framework. The software produces Classic Venn, Edwards’ Venn and Nested Venn diagrams and allows for eight sets in a graph mode and 31 sets in data processing mode only. In comparison, previous programs produce Classic Venn and Edwards’ Venn diagrams and allow for a maximum of six sets. The software incorporates user-friendly features and works in Windows, Linux and Mac OS. Its graphical interface does not require a user to have programing skills. Users can modify diagram content for up to eight datasets because of the Scalable Vector Graphics output. VennPainter can provide output results in vertical, horizontal and matrix formats, which facilitates sharing datasets as required for further identification of candidate genes. Users can obtain gene lists from shared sets by clicking the numbers on the diagram. Thus, VennPainter is an easy-to-use, highly efficient, cross-platform and powerful program that provides a more comprehensive tool for identifying candidate genes and visualizing the relationships among genes or gene families in comparative analysis.

Visualizing genome and systems biology: technologies, tools, implementation techniques and trends, past, present and future

"Α picture is worth a thousand words." This widely used adage sums up in a few words the notion that a successful visual representation of a concept should enable easy and rapid absorption of large amounts of information. Although, in general, the notion of capturing complex ideas using images is very appealing, would 1000 words be enough to describe the unknown in a research field such as the life sciences? Life sciences is one of the biggest generators of enormous datasets, mainly as a result of recent and rapid technological advances; their complexity can make these datasets incomprehensible without effective visualization methods. Here we discuss the past, present and future of genomic and systems biology visualization. We briefly comment on many visualization and analysis tools and the purposes that they serve. We focus on the latest libraries and programming languages that enable more effective, efficient and faster approaches for visualizing biological concepts, and also comment on the future human-computer interaction trends that would enable for enhancing visualization further.

The KUPNetViz: a biological network viewer for multiple -omics datasets in kidney diseases

Background

Constant technological advances have allowed scientists in biology to migrate from conventional single-omics to multi-omics experimental approaches, challenging bioinformatics to bridge this multi-tiered information. Ongoing research in renal biology is no exception. The results of large-scale and/or high throughput experiments, presenting a wealth of information on kidney disease are scattered across the web. To tackle this problem, we recently presented the KUPKB, a multi-omics data repository for renal diseases.

Results

In this article, we describe KUPNetViz, a biological graph exploration tool allowing the exploration of KUPKB data through the visualization of biomolecule interactions. KUPNetViz enables the integration of multi-layered experimental data over different species, renal locations and renal diseases to protein-protein interaction networks and allows association with biological functions, biochemical pathways and other functional elements such as miRNAs. KUPNetViz focuses on the simplicity of its usage and the clarity of resulting networks by reducing and/or automating advanced functionalities present in other biological network visualization packages. In addition, it allows the extrapolation of biomolecule interactions across different species, leading to the formulations of new plausible hypotheses, adequate experiment design and to the suggestion of novel biological mechanisms. We demonstrate the value of KUPNetViz by two usage examples: the integration of calreticulin as a key player in a larger interaction network in renal graft rejection and the novel observation of the strong association of interleukin-6 with polycystic kidney disease.

Conclusions

The KUPNetViz is an interactive and flexible biological network visualization and exploration tool. It provides renal biologists with biological network snapshots of the complex integrated data of the KUPKB allowing the formulation of new hypotheses in a user friendly manner.

Multivariate synchrony modules identified through multiple subject community detection in functional brain networks

The functional connectivity of the human brain may be described by modeling interactions among its neural assemblies as a graph composed of vertices and edges. It has recently been shown that functional brain networks belong to a class of scale-free complex networks for which graphs have helped define an association between function and topology. These networks have been shown to possess a heterogenous structure composed of clusters, dense regions of strongly associated nodes, which represent multivariate relationships among nodes. Network clustering algorithms classify the nodes based on a similarity measure representing the bivariate relationships and similar to unsupervised learning is performed without a priori information. In this paper, we propose a method for partitioning a set of networks representing different subjects and reveal a community structure common to multiple subjects. We apply this community identifying algorithm to functional brain networks during a cognitive control task, in particular the error-related negativity (ERN), to evaluate how the brain organizes itself during error-monitoring.

Manifold learning in protein interactomes

Many studies and applications in the post-genomic era have been devoted to analyze complex biological systems by computational inference methods. We propose to apply manifold learning methods to protein-protein interaction networks (PPIN). Despite their popularity in data-intensive applications, these methods have received limited attention in the context of biological networks. We show that there is both utility and unexplored potential in adopting manifold learning for network inference purposes. In particular, the following advantages are highlighted: (a) fusion with diagnostic statistical tools designed to assign significance to protein interactions based on pre-selected topological features; (b) dissection into components of the interactome in order to elucidate global and local connectivity organization; (c) relevance of embedding the interactome in reduced dimensions for biological validation purposes. We have compared the performances of three well-known techniques--kernel-PCA, RADICAL ICA, and ISOMAP--relatively to their power of mapping the interactome onto new coordinate dimensions where important associations among proteins can be detected, and then back projected such that the corresponding sub-interactomes are reconstructed. This recovery has been done selectively, by using significant information according to a robust statistical procedure, and then standard biological annotation has been provided to validate the results. We expect that a byproduct of using subspace analysis by the proposed techniques is a possible calibration of interactome modularity studies. Supplementary Material is available online at www.libertonlinec.com.

SCPS: a fast implementation of a spectral method for detecting protein families on a genome-wide scale

Background

An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed for this task which are "local" in the sense that they assign a protein to a cluster based only on the distances between that protein and the other proteins in the set. It was shown recently that global methods such as spectral clustering have better performance on a wide variety of datasets. However, currently available implementations of spectral clustering methods mostly consist of a few loosely coupled Matlab scripts that assume a fair amount of familiarity with Matlab programming and hence they are inaccessible for large parts of the research community.

Results

SCPS (Spectral Clustering of Protein Sequences) is an efficient and user-friendly implementation of a spectral method for inferring protein families. The method uses only pairwise sequence similarities, and is therefore practical when only sequence information is available. SCPS was tested on difficult sets of proteins whose relationships were extracted from the SCOP database, and its results were extensively compared with those obtained using other popular protein clustering algorithms such as TribeMCL, hierarchical clustering and connected component analysis. We show that SCPS is able to identify many of the family/superfamily relationships correctly and that the quality of the obtained clusters as indicated by their F-scores is consistently better than all the other methods we compared it with. We also demonstrate the scalability of SCPS by clustering the entire SCOP database (14,183 sequences) and the complete genome of the yeast Saccharomyces cerevisiae (6,690 sequences).

Conclusions

Besides the spectral method, SCPS also implements connected component analysis and hierarchical clustering, it integrates TribeMCL, it provides different cluster quality tools, it can extract human-readable protein descriptions using GI numbers from NCBI, it interfaces with external tools such as BLAST and Cytoscape, and it can produce publication-quality graphical representations of the clusters obtained, thus constituting a comprehensive and effective tool for practical research in computational biology. Source code and precompiled executables for Windows, Linux and Mac OS X are freely available at http://www.paccanarolab.org/software/scps.

Biomolecular Structure and Modeling: Historical Perspective

physics, chemistry, and biology have been connected by a web of causal explanation organized by induction-based theories that telescope into one another. … Thus, quantum theory underlies atomic physics, which is the foundation of reagent chemistry and its specialized offshoot biochemistry, which interlock with molecular biology — essentially, the chemistry of organic macromolecules — and hence, through successively higher levels of organization, cellular, organismic, and evolutionary biology. … Such is the unifying and highly productive understanding of the world that has evolved in the natural sciences.

Network graph analysis of category fluency testing

BACKGROUND

Category fluency is impaired early in Alzheimer disease (AD). Graph theory is a technique to analyze complex relationships in networks. Features of interest in network analysis include the number of nodes and edges, and variables related to their interconnectedness. Other properties important in network analysis are "small world properties" and "scale-free" properties. The small world property (popularized as the so-called "6 degrees of separation") arises when the majority of connections are local, but a number of connections are to distant nodes. Scale-free networks are characterized by the presence of a few nodes with many connections, and many more nodes with fewer connections.

OBJECTIVE

To determine if category fluency data can be analyzed using graph theory. To compare normal elderly, mild cognitive impairment (MCI) and AD network graphs, and characterize changes seen with increasing cognitive impairment.

METHODS

Category fluency results ("animals" recorded over 60 s) from normals (n=38), MCI (n=33), and AD (n=40) completing uniform data set evaluations were converted to network graphs of all unique cooccurring neighbors, and compared for network variables.

RESULTS

For Normal, MCI and AD, mean clustering coefficients were 0.21, 0.22, 0.30; characteristic path lengths were 3.27, 3.17, and 2.65; small world properties decreased with increasing cognitive impairment, and all graphs showed scale-free properties. Rank correlations of the 25 commonest items ranged from 0.75 to 0.83. Filtering of low-degree nodes in normal and MCI graphs resulted in properties similar to the AD network graph.

CONCLUSIONS

Network graph analysis is a promising technique for analyzing changes in category fluency. Our technique results in nonrandom graphs consistent with well-characterized properties for these types of graphs.

A survey of visualization tools for biological network analysis

The analysis and interpretation of relationships between biological molecules, networks and concepts is becoming a major bottleneck in systems biology. Very often the pure amount of data and their heterogeneity provides a challenge for the visualization of the data. There are a wide variety of graph representations available, which most often map the data on 2D graphs to visualize biological interactions. These methods are applicable to a wide range of problems, nevertheless many of them reach a limit in terms of user friendliness when thousands of nodes and connections have to be analyzed and visualized. In this study we are reviewing visualization tools that are currently available for visualization of biological networks mainly invented in the latest past years. We comment on the functionality, the limitations and the specific strengths of these tools, and how these tools could be further developed in the direction of data integration and information sharing.

A mathematical tool for exploring the dynamics of biological networks

We have developed a mathematical approach to the study of dynamical biological networks, based on combining large-scale numerical simulation with nonlinear "dimensionality reduction" methods. Our work was motivated by an interest in the complex organization of the signaling cascade centered on the neuronal phosphoprotein DARPP-32 (dopamine- and cAMP-regulated phosphoprotein of molecular weight 32,000). Our approach has allowed us to detect robust features of the system in the presence of noise. In particular, the global network topology serves to stabilize the net state of DARPP-32 phosphorylation in response to variation of the input levels of the neurotransmitters dopamine and glutamate, despite significant perturbation to the concentrations and levels of activity of a number of intermediate chemical species. Further, our results suggest that the entire topology of the network is needed to impart this stability to one portion of the network at the expense of the rest. This could have significant implications for systems biology, in that large, complex pathways may have properties that are not easily replicated with simple modules.