TopNet: a tool for comparing biological sub-networks, correlating protein properties with topological statistics

Biological networks are a topic of great current interest, particularly with the publication of a number of large genome-wide interaction datasets. They are globally characterized by a variety of graph-theoretic statistics, such as the degree distribution, clustering coefficient, characteristic path length and diameter. Moreover, real protein networks are quite complex and can often be divided into many sub-networks through systematic selection of different nodes and edges. For instance, proteins can be sub-divided by expression level, length, amino-acid composition, solubility, secondary structure and function. A challenging research question is to compare the topologies of sub- networks, looking for global differences associated with different types of proteins. TopNet is an automated web tool designed to address this question, calculating and comparing topological characteristics for different sub-networks derived from any given protein network. It provides reasonable solutions to the calculation of network statistics for sub-networks embedded within a larger network and gives simplified views of a sub-network of interest, allowing one to navigate through it. After constructing TopNet, we applied it to the interaction networks and protein classes currently available for yeast. We were able to find a number of potential biological correlations. In particular, we found that soluble proteins had more interactions than membrane proteins. Moreover, amongst soluble proteins, those that were highly expressed, had many polar amino acids, and had many alpha helices, tended to have the most interaction partners. Interestingly, TopNet also turned up some systematic biases in the current yeast interaction network: on average, proteins with a known functional classification had many more interaction partners than those without. This phenomenon may reflect the incompleteness of the experimentally determined yeast interaction network.     

Recent advances in charting protein-protein interaction: mass spectrometry-based approaches

Cellular functions are the result of the coordinated action of groups of proteins interacting in molecular assemblies or pathways. The systematic and unbiased charting of protein-protein networks in a variety of organisms has become an important challenge in systems biology. These protein-protein interaction networks contribute comprehensive cartographies of key pathways or biological processes relevant to health or disease by providing a molecular frame for the interpretation of genetic links. At a structural level protein-protein networks enabled the identification of the sequences, motifs and structural folds involved in the process of molecular recognition. A rapidly growing choice of technologies is available for the global charting of protein-protein interactions. In this review, we focus on recent developments in a suite of methods that enable the purification of protein complexes under native conditions and, in conjunction with protein mass spectrometry, identification of their constituents.     

Interactome Mapping: Using Protein Microarray Technology to Reconstruct Diverse Protein Networks

A major focus of systems biology is to characterize interactions between cellular components, in order to develop an accurate picture of the intricate networks within biological systems. Over the past decade, protein microarrays have greatly contributed to advances in proteomics and are becoming an important platform for systems biology. Protein microarrays are highly flexible, ranging from large-scale proteome microarrays to smaller customizable microarrays, making the technology amenable for detection of a broad spectrum of biochemical properties of proteins. In this article, we will focus on the numerous studies that have utilized protein microarrays to reconstruct biological networks including protein-DNA interactions, posttranslational protein modifications (PTMs), lectin-glycan recognition, pathogen-host interactions and hierarchical signaling cascades. The diversity in applications allows for integration of interaction data from numerous molecular classes and cellular states, providing insight into the structure of complex biological systems. We will also discuss emerging applications and future directions of protein microarray technology in the global frontier.     

Global Network Analysis of Lipid-Raft-Related Proteins Reveals Their Centrality in the Network and Their Roles in Multiple Biological Processes

Lipid rafts are specialized cholesterol-enriched microdomains in the cell membrane. They have been known as a platform for protein-protein interactions and to take part in multiple biological processes. Nevertheless, how lipid rafts influence protein properties at the proteomic level is still an open question for researchers using traditional biochemical approaches. Here, by annotating the lipid raft localization of proteins in human protein-protein interaction networks, we performed a systematic analysis of the function of proteins related to lipid rafts. Our results demonstrated that lipid raft proteins and their interactions were critical for the structure and stability of the whole network, and that the interactions between them were significantly enriched. Furthermore, for each protein in the network, we calculated its “lipid raft dependency (LRD),” which indicates how close it is topologically associated with lipid rafts, and we then uncovered the connection between LRD and protein functions. Proteins with high LRD tended to be essential for mammalian development, and malfunction of these proteins was inclined to cause human diseases. Coordinated with their neighbors, high-LRD proteins participated in multiple biological processes and targeted many pathways in diseases pathogenesis. High-LRD proteins were also found to have tissue specificity of expression. In summary, our network-based analysis denotes that lipid raft proteins have higher centrality in the network, and that lipid-raft-related proteins have multiple functions and are probably concerned with many biological processes in disease development.     

Protein interaction networks of Saccharomyces cerevisiae, Caenorhabditis elegans and Drosophila melanogaster: large-scale organization and robustness

High-throughput screens have begun to reveal protein interaction networks in several organisms. To understand the general properties of these protein interaction networks, a systematic analysis of topological structure and robustness was performed on the protein interaction networks of Saccharomyces cerevisiae, Caenorhabditis elegans and Drosophila melanogaster. It shows that the three protein interaction networks have a scale-free and high-degree clustering nature as the consequence of their hierarchical organization. It also shows that they have the small-world property with similar diameter at 4-5. Evaluation of the consequences of random removal of both proteins and interactions from the protein interaction networks suggests their high degree of robustness. Simulation of a protein's removal shows that the protein interaction network's error tolerance is accompanied by attack vulnerability. These fundamental analyses of the networks might serve as a starting point for further exploring complex biological networks and the coming research of "systems biology".     

Protein complexes discovery based on protein-protein interaction data via a regularized sparse generative network model

Detecting protein complexes from protein interaction networks is one major task in the postgenome era. Previous developed computational algorithms identifying complexes mainly focus on graph partition or dense region finding. Most of these traditional algorithms cannot discover overlapping complexes which really exist in the protein-protein interaction (PPI) networks. Even if some density-based methods have been developed to identify overlapping complexes, they are not able to discover complexes that include peripheral proteins. In this study, motivated by recent successful application of generative network model to describe the generation process of PPI networks and to detect communities from social networks, we develop a regularized sparse generative network model (RSGNM), by adding another process that generates propensities using exponential distribution and incorporating Laplacian regularizer into an existing generative network model, for protein complexes identification. By assuming that the propensities are generated using exponential distribution, the estimators of propensities will be sparse, which not only has good biological interpretation but also helps to control the overlapping rate among detected complexes. And the Laplacian regularizer will lead to the estimators of propensities more smooth on interaction networks. Experimental results on three yeast PPI networks show that RSGNM outperforms six previous competing algorithms in terms of the quality of detected complexes. In addition, RSGNM is able to detect overlapping complexes and complexes including peripheral proteins simultaneously. These results give new insights about the importance of generative network models in protein complexes identification.     

Influence of Protein Abundance on High-Throughput Protein-Protein Interaction Detection

Experimental protein-protein interaction (PPI) networks are increasingly being exploited in diverse ways for biological discovery. Accordingly, it is vital to discern their underlying natures by identifying and classifying the various types of deterministic (specific) and probabilistic (nonspecific) interactions detected. To this end, we have analyzed PPI networks determined using a range of high-throughput experimental techniques with the aim of systematically quantifying any biases that arise from the varying cellular abundances of the proteins. We confirm that PPI networks determined using affinity purification methods for yeast and Eschericia coli incorporate a correlation between protein degree, or number of interactions, and cellular abundance. The observed correlations are small but statistically significant and occur in both unprocessed (raw) and processed (high-confidence) data sets. In contrast, the yeast two-hybrid system yields networks that contain no such relationship. While previously commented based on mRNA abundance, our more extensive analysis based on protein abundance confirms a systematic difference between PPI networks determined from the two technologies. We additionally demonstrate that the centrality-lethality rule, which implies that higher-degree proteins are more likely to be essential, may be misleading, as protein abundance measurements identify essential proteins to be more prevalent than nonessential proteins. In fact, we generally find that when there is a degree/abundance correlation, the degree distributions of nonessential and essential proteins are also disparate. Conversely, when there is no degree/abundance correlation, the degree distributions of nonessential and essential proteins are not different. However, we show that essentiality manifests itself as a biological property in all of the yeast PPI networks investigated here via enrichments of interactions between essential proteins. These findings provide valuable insights into the underlying natures of the various high-throughput technologies utilized to detect PPIs and should lead to more effective strategies for the inference and analysis of high-quality PPI data sets.     

Identification of the ligands of protein interaction domains through a functional approach

The identification of protein-protein interaction networks has often given important information about the functions of specific proteins and on the cross-talk among metabolic and regulatory pathways. The availability of entire genome sequences has rendered feasible the systematic screening of collections of proteins, often of unknown function, aimed to find the cognate ligands. Once identified by genetic and/or biochemical approaches, the interaction between two proteins should be validated in the physiologic environment. Herein we describe an experimental strategy to screen collections of protein-protein interaction domains to find and validate candidate interactors. The approach is based on the assumption that the overexpression in cultured cells of protein-protein interaction domains, isolated from the context of the whole protein, could titrate the endogenous ligand and, in turn, exert a dominant negative effect. The identification of the ligand could provide us with a tool to check the relevance of the interaction because the contemporary overexpression of the isolated domain and of its ligand could rescue the dominant negative phenotype. We explored this approach by analyzing the possible dominant negative effects on the cell cycle progression of a collection of phosphotyrosine binding (PTB) domains of human proteins. Of 47 PTB domains, we found that the overexpression of 10 of them significantly interfered with the cell cycle progression of NIH3T3 cells. Four of them were used as baits to identify the cognate interactors. Among these proteins, CARM1, interacting with the PTB domain of RabGAP1, and EF1alpha, interacting with RGS12, were able to rescue the block of the cell cycle induced by the isolated PTB domain of the partner protein, thus confirming in vivo the relevance of the interaction. These results suggest that the described approach can be used for the systematic screening of the ligands of various protein-protein interaction domains also by using different biological assays.     

Protein interaction networks in medicine and disease

The physical interaction of proteins is subject to intense investigation that has revealed that proteins are assembled into large densely connected networks. In this review, we will examine how signaling pathways can be combined to form higher order protein interaction networks. By using network graph theory, these interaction networks can be further analyzed for global organization, which has revealed unique aspects of the relationships between protein networks and complex biological phenotypes. Moreover, several studies have shown that the structure and dynamics of protein networks are disturbed in complex diseases such as cancer progression. These relationships suggest a novel paradigm for treatment of complex multigenic disease where the protein interaction network is the target of therapy more so than individual molecules within the network.     

Mapping protein-protein interactions by mass spectrometry

Mass spectrometry is currently at the forefront of technologies for mapping protein-protein interactions, as it is a highly sensitive technique that enables the rapid identification of proteins from a variety of biological samples. When used in combination with affinity purification and/or chemical cross-linking, whole or targeted protein interaction networks can be elucidated. Several methods have recently been introduced that display increased specificity and a reduced occurrence of false-positives. In the future, information gained from human protein interaction studies could lead to the discovery of novel pathway associations and therapeutic targets.     

A reliability measure of protein–protein interactions and a reliability measure-based search engine

Many methods developed for estimating the reliability of protein–protein interactions are based on the topology of protein–protein interaction networks. This paper describes a new reliability measure for protein–protein interactions, which does not rely on the topology of protein interaction networks, but expresses biological information on functional roles, sub-cellular localisations and protein classes as a scoring schema. The new measure is useful for filtering many spurious interactions, as well as for estimating the reliability of protein interaction data. In particular, the reliability measure can be used to search protein–protein interactions with the desired reliability in databases. The reliability-based search engine is available at http://yeast.hpid.org. We believe this is the first search engine for interacting proteins, which is made available to public. The search engine and the reliability measure of protein interactions should provide useful information for determining proteins to focus on.     

The effects of network neighbours on protein evolution

Interacting proteins may often experience similar selection pressures. Thus, we may expect that neighbouring proteins in biological interaction networks evolve at similar rates. This has been previously shown for protein-protein interaction networks. Similarly, we find correlated rates of evolution of neighbours in networks based on co-expression, metabolism, and synthetic lethal genetic interactions. While the correlations are statistically significant, their magnitude is small, with network effects explaining only between 2% and 7% of the variation. The strongest known predictor of the rate of protein evolution remains expression level. We confirmed the previous observation that similar expression levels of neighbours indeed explain their similar evolution rates in protein-protein networks, and showed that the same is true for metabolic networks. In co-expression and synthetic lethal genetic interaction networks, however, neighbouring genes still show somewhat similar evolutionary rates even after simultaneously controlling for expression level, gene essentiality and gene length. Thus, similar expression levels and related functions (as inferred from co-expression and synthetic lethal interactions) seem to explain correlated evolutionary rates of network neighbours across all currently available types of biological networks.     

Making the right connections: biological networks in the light of evolution

Our understanding of how evolution acts on biological networks remains patchy, as is our knowledge of how that action is best identified, modelled and understood. Starting with network structure and the evolution of protein–protein interaction networks, we briefly survey the ways in which network evolution is being addressed in the fields of systems biology, development and ecology. The approaches highlighted demonstrate a movement away from a focus on network topology towards a more integrated view, placing biological properties centre‐stage. We argue that there remains great potential in a closer synergy between evolutionary biology and biological network analysis, although that may require the development of novel approaches and even different analogies for biological networks themselves.     

Exploring overlapping functional units with various structure in protein interaction networks

Revealing functional units in protein-protein interaction (PPI) networks are important for understanding cellular functional organization. Current algorithms for identifying functional units mainly focus on cohesive protein complexes which have more internal interactions than external interactions. Most of these approaches do not handle overlaps among complexes since they usually allow a protein to belong to only one complex. Moreover, recent studies have shown that other non-cohesive structural functional units beyond complexes also exist in PPI networks. Thus previous algorithms that just focus on non-overlapping cohesive complexes are not able to present the biological reality fully. Here, we develop a new regularized sparse random graph model (RSRGM) to explore overlapping and various structural functional units in PPI networks. RSRGM is principally dominated by two model parameters. One is used to define the functional units as groups of proteins that have similar patterns of connections to others, which allows RSRGM to detect non-cohesive structural functional units. The other one is used to represent the degree of proteins belonging to the units, which supports a protein belonging to more than one revealed unit. We also propose a regularizer to control the smoothness between the estimators of these two parameters. Experimental results on four S. cerevisiae PPI networks show that the performance of RSRGM on detecting cohesive complexes and overlapping complexes is superior to that of previous competing algorithms. Moreover, RSRGM has the ability to discover biological significant functional units besides complexes.     

Fine-Scale Dissection of Functional Protein Network Organization by Statistical Network Analysis

Revealing organizational principles of biological networks is an important goal of systems biology. In this study, we sought to analyze the dynamic organizational principles within the protein interaction network by studying the characteristics of individual neighborhoods of proteins within the network based on their gene expression as well as protein-protein interaction patterns. By clustering proteins into distinct groups based on their neighborhood gene expression characteristics, we identify several significant trends in the dynamic organization of the protein interaction network. We show that proteins with distinct neighborhood gene expression characteristics are positioned in specific localities in the protein interaction network thereby playing specific roles in the dynamic network connectivity. Remarkably, our analysis reveals a neighborhood characteristic that corresponds to the most centrally located group of proteins within the network. Further, we show that the connectivity pattern displayed by this group is consistent with the notion of “rich club connectivity” in complex networks. Importantly, our findings are largely reproducible in networks constructed using independent and different datasets.     

Prediction of protein-protein interactions: unifying evolution and structure at protein interfaces

The vast majority of the chores in the living cell involve protein-protein interactions. Providing details of protein interactions at the residue level and incorporating them into protein interaction networks are crucial toward the elucidation of a dynamic picture of cells. Despite the rapid increase in the number of structurally known protein complexes, we are still far away from a complete network. Given experimental limitations, computational modeling of protein interactions is a prerequisite to proceed on the way to complete structural networks. In this work, we focus on the question 'how do proteins interact?' rather than 'which proteins interact?' and we review structure-based protein-protein interaction prediction approaches. As a sample approach for modeling protein interactions, PRISM is detailed which combines structural similarity and evolutionary conservation in protein interfaces to infer structures of complexes in the protein interaction network. This will ultimately help us to understand the role of protein interfaces in predicting bound conformations.     

Greedily building protein networks with confidence

MOTIVATION: With genome sequences complete for human and model organisms, it is essential to understand how individual genes and proteins are organized into biological networks. Much of the organization is revealed by proteomics experiments that now generate torrents of data. Extracting relevant complexes and pathways from high-throughput proteomics data sets has posed a challenge, however, and new methods to identify and extract networks are essential. We focus on the problem of building pathways starting from known proteins of interest. RESULTS: We have developed an efficient, greedy algorithm, SEEDY, that extracts biologically relevant biological networks from protein-protein interaction data, building out from selected seed proteins. The algorithm relies on our previous study establishing statistical confidence levels for interactions generated by two-hybrid screens and inferred from mass spectrometric identification of protein complexes. We demonstrate the ability to extract known yeast complexes from high-throughput protein interaction data with a tunable parameter that governs the trade-off between sensitivity and selectivity. DNA damage repair pathways are presented as a detailed example. We highlight the ability to join heterogeneous data sets, in this case protein-protein interactions and genetic interactions, and the appearance of cross-talk between pathways caused by re-use of shared components. SIGNIFICANCE AND COMPARISON: The significance of the SEEDY algorithm is that it is fast, running time O[(E + V) log V] for V proteins and E interactions, a single adjustable parameter controls the size of the pathways that are generated, and an associated P-value indicates the statistical confidence that the pathways are enriched for proteins with a coherent function. Previous approaches have focused on extracting sub-networks by identifying motifs enriched in known biological networks. SEEDY provides the complementary ability to perform a directed search based on proteins of interest. AVAILABILITY: SEEDY software (Perl source), data tables and confidence score models (R source) are freely available from the author.     

Estimating gene regulatory networks and protein-protein interactions of Saccharomyces cerevisiae from multiple genome-wide data

MOTIVATION: Biological processes in cells are properly performed by gene regulations, signal transductions and interactions between proteins. To understand such molecular networks, we propose a statistical method to estimate gene regulatory networks and protein-protein interaction networks simultaneously from DNA microarray data, protein-protein interaction data and other genome-wide data. RESULTS: We unify Bayesian networks and Markov networks for estimating gene regulatory networks and protein-protein interaction networks according to the reliability of each biological information source. Through the simultaneous construction of gene regulatory networks and protein-protein interaction networks of Saccharomyces cerevisiae cell cycle, we predict the role of several genes whose functions are currently unknown. By using our probabilistic model, we can detect false positives of high-throughput data, such as yeast two-hybrid data. In a genome-wide experiment, we find possible gene regulatory relationships and protein-protein interactions between large protein complexes that underlie complex regulatory mechanisms of biological processes.     

Data mining of cancer vaccine trials: a bird's-eye view

Background

Details of the mechanisms and selection pressures that shape the emergence and development of complex biological systems, such as the human immune system, are poorly understood. A recent definition of a reference set of proteins essential for the human immunome, combined with information about protein interaction networks for these proteins, facilitates evolutionary study of this biological machinery.

Results

Here, we present a detailed study of the development of the immunome protein interaction network during eight evolutionary steps from Bilateria ancestors to human. New nodes show preferential attachment to high degree proteins. The efficiency of the immunome protein interaction network increases during the evolutionary steps, whereas the vulnerability of the network decreases.

Conclusion

Our results shed light on selective forces acting on the emergence of biological networks. It is likely that the high efficiency and low vulnerability are intrinsic properties of many biological networks, which arise from the effects of evolutionary processes yet to be uncovered.     

Combining many interaction networks to predict gene function and analyze gene lists

In this article, we review how interaction networks can be used alone or in combination in an automated fashion to provide insight into gene and protein function. We describe the concept of a "gene-recommender system" that can be applied to any large collection of interaction networks to make predictions about gene or protein function based on a query list of proteins that share a function of interest. We discuss these systems in general and focus on one specific system, GeneMANIA, that has unique features and uses different algorithms from the majority of other systems.