Functional topology in a network of protein interactions

MOTIVATION: The building blocks of biological networks are individual protein-protein interactions (PPIs). The cumulative PPI data set in Saccharomyces cerevisiae now exceeds 78 000. Studying the network of these interactions will provide valuable insight into the inner workings of cells. RESULTS: We performed a systematic graph theory-based analysis of this PPI network to construct computational models for describing and predicting the properties of lethal mutations and proteins participating in genetic interactions, functional groups, protein complexes and signaling pathways. Our analysis suggests that lethal mutations are not only highly connected within the network, but they also satisfy an additional property: their removal causes a disruption in network structure. We also provide evidence for the existence of alternate paths that bypass viable proteins in PPI networks, while such paths do not exist for lethal mutations. In addition, we show that distinct functional classes of proteins have differing network properties. We also demonstrate a way to extract and iteratively predict protein complexes and signaling pathways. We evaluate the power of predictions by comparing them with a random model, and assess accuracy of predictions by analyzing their overlap with MIPS database. CONCLUSIONS: Our models provide a means for understanding the complex wiring underlying cellular function, and enable us to predict essentiality, genetic interaction, function, protein complexes and cellular pathways. This analysis uncovers structure-function relationships observable in a large PPI network.     

Computational identification of protein-protein interactions in rice based on the predicted rice interactome network

Plant protein-protein interaction networks have not been identified by large-scale experiments. In order to better understand the protein interactions in rice, the Predicted Rice Interactome Network (PRIN; http://bis.zju.edu.cn/prin/) presented 76,585 predicted interactions involving 5,049 rice proteins. After mapping genomic features of rice (GO annotation, subcellular localization prediction, and gene expression), we found that a well-annotated and biologically significant network is rich enough to capture many significant functional linkages within higher-order biological systems, such as pathways and biological processes. Furthermore, we took MADS-box domain-containing proteins and circadian rhythm signaling pathways as examples to demonstrate that functional protein complexes and biological pathways could be effectively expanded in our predicted network. The expanded molecular network in PRIN has considerably improved the capability of these analyses to integrate existing knowledge and provide novel insights into the function and coordination of genes and gene networks.     

Peptide libraries: at the crossroads of proteomics and bioinformatics

Peptide libraries offer a valuable means for providing functional information regarding protein-modifying enzymes and protein interaction domains. Library approaches have become increasingly useful as high-throughput strategies for the analysis of large numbers of new proteins identified as a result of genome-sequencing efforts. Recent developments in the field have produced faster methods with broadened applicability. Crucially, new computational and biochemical tools have emerged that facilitate identification of interaction partners and substrates for proteins on the basis of their peptide selectivity profiles. Such combinations of proteomics-scale experimental approaches with bioinformatics tools hold great promise for the elucidation of protein interaction networks and signal transduction pathways in living cells.     

O2 migration pathways are not conserved across proteins of a similar fold

Recent advances in computational biology have made it possible to map the complete network and energy profile of gas migration pathways inside proteins. Although networks of O(2) pathways have already been characterized for a small number of proteins, the general properties and locations of these pathways have not been previously compared between proteins. In this study, maps of the O(2) pathways inside 12 monomeric globins were computed. It is found that, despite the conserved tertiary structure fold of the studied globins, the shape and topology of O(2) pathway networks exhibit a large variability between different globins, except when two globins are nearly identical. The locations of the O(2) pathways are, however, found to be correlated with the location of large hydrophobic residues, and a similar correlation is observed in two unrelated protein families: monomeric globins and copper-containing amine oxidases. The results have implications for the evolution of gas pathways in proteins and for protein engineering applications involving modifications of these pathways.     

Protein coadaptation and the design of novel approaches to identify protein-protein interactions

Proteins rarely function in isolation but they form part of complex networks of interactions with other proteins within or among cells. The importance of a particular protein for cell viability is directly dependent upon the number of interactions where it participates and the function it performs: the larger the number of interactions of a protein the greater its functional importance is for the cell. With the advent of genome sequencing and "omics" technologies it became feasible conducting large-scale searches for protein interacting partners. Unfortunately, the accuracy of such analyses has been underwhelming owing to methodological limitations and to the inherent complexity of protein interactions. In addition to these experimental approaches, many computational methods have been developed to identify protein-protein interactions by assuming that interacting proteins coevolve resulting from the coadaptation dynamics between the amino acids of their interacting faces. We review the main technological advances made in the field of interactomics and discuss the feasibility of computational methods to identify protein-protein interactions based on the estimation of coevolution. As proof-of-concept, we present a classical case study: the interactions of cell surface proteins (receptors) and their ligands. Finally, we take this discussion one step forward to include interactions between organisms and species to understand the generation of biological complexity. Development of technologies for accurate detection of protein-protein interactions may shed light on processes that go from the fine-tuning of pathways and metabolic networks to the emergence of biological complexity.     

Computational Prediction of Protein–Protein Interactions

Recently a number of computational approaches have been developed for the prediction of protein–protein interactions. Complete genome sequencing projects have provided the vast amount of information needed for these analyses. These methods utilize the structural, genomic, and biological context of proteins and genes in complete genomes to predict protein interaction networks and functional linkages between proteins. Given that experimental techniques remain expensive, time-consuming, and labor-intensive, these methods represent an important advance in proteomics. Some of these approaches utilize sequence data alone to predict interactions, while others combine multiple computational and experimental datasets to accurately build protein interaction maps for complete genomes. These methods represent a complementary approach to current high-throughput projects whose aim is to delineate protein interaction maps in complete genomes. We will describe a number of computational protocols for protein interaction prediction based on the structural, genomic, and biological context of proteins in complete genomes, and detail methods for protein interaction network visualization and analysis.     

Structure- and sequence-based function prediction for non-homologous proteins

The structural genomics projects have been accumulating an increasing number of protein structures, many of which remain functionally unknown. In parallel effort to experimental methods, computational methods are expected to make a significant contribution for functional elucidation of such proteins. However, conventional computational methods that transfer functions from homologous proteins do not help much for these uncharacterized protein structures because they do not have apparent structural or sequence similarity with the known proteins. Here, we briefly review two avenues of computational function prediction methods, i.e. structure-based methods and sequence-based methods. The focus is on our recent developments of local structure-based and sequence-based methods, which can effectively extract function information from distantly related proteins. Two structure-based methods, Pocket-Surfer and Patch-Surfer, identify similar known ligand binding sites for pocket regions in a query protein without using global protein fold similarity information. Two sequence-based methods, protein function prediction and extended similarity group, make use of weakly similar sequences that are conventionally discarded in homology based function annotation. Combined together with experimental methods we hope that computational methods will make leading contribution in functional elucidation of the protein structures.     

Functional annotation from predicted protein interaction networks

MOTIVATION: Progress in large-scale experimental determination of protein-protein interaction networks for several organisms has resulted in innovative methods of functional inference based on network connectivity. However, the amount of effort and resources required for the elucidation of experimental protein interaction networks is prohibitive. Previously we, and others, have developed techniques to predict protein interactions for novel genomes using computational methods and data generated from other genomes. RESULTS: We evaluated the performance of a network-based functional annotation method that makes use of our predicted protein interaction networks. We show that this approach performs equally well on experimentally derived and predicted interaction networks, for both manually and computationally assigned annotations. We applied the method to predicted protein interaction networks for over 50 organisms from all domains of life, providing annotations for many previously unannotated proteins and verifying existing low-confidence annotations. AVAILABILITY: Functional predictions for over 50 organisms are available at http://bioverse.compbio.washington.edu and datasets used for analysis at http://data.compbio.washington.edu/misc/downloads/nannotation_data/. SUPPLEMENTARY INFORMATION: A supplemental appendix gives additional details not in the main text. (http://data.compbio.washington.edu/misc/downloads/nannotation_data/supplement.pdf).     

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.     

Prediction of membrane protein types by fusing protein-protein interaction and protein sequence information

Membrane proteins are gatekeepers to the cell and essential for determination of the function of cells. Identification of the types of membrane proteins is an essential problem in cell biology. It is time-consuming and expensive to identify the type of membrane proteins with traditional experimental methods. The alternative way is to design effective computational methods, which can provide quick and reliable predictions. To date, several computational methods have been proposed in this regard. Several of them used the features extracted from the sequence information of individual proteins. Recently, networks are more and more popular to tackle different protein-related problems, which can organize proteins in a system level and give an overview of all proteins. However, such form weakens the essential properties of proteins, such as their sequence information. In this study, a novel feature fusion scheme was proposed, which integrated the information of protein sequences and protein-protein interaction network. The fused features of a protein were defined as the linear combination of sequence features of all proteins in the network, where the combination coefficients were the probabilities yielded by the random walk with restart algorithm with the protein as the seed node. Several models with such fused features and different classification algorithms were built and evaluated. Their performance for predicting the type of membrane proteins was improved compared with the models only with the sequence features or network information.     

How do oncoprotein mutations rewire protein–protein interaction networks?

The acquisition of mutations that activate oncogenes or inactivate tumor suppressors is a primary feature of most cancers. Mutations that directly alter protein sequence and structure drive the development of tumors through aberrant expression and modification of proteins, in many cases directly impacting components of signal transduction pathways and cellular architecture. Cancer-associated mutations may have direct or indirect effects on proteins and their interactions and while the effects of mutations on signaling pathways have been widely studied, how mutations alter underlying protein–protein interaction networks is much less well understood. Systematic mapping of oncoprotein protein interactions using proteomics techniques as well as computational network analyses is revealing how oncoprotein mutations perturb protein–protein interaction networks and drive the cancer phenotype.     

Identification of additional proteins in differential proteomics using protein interaction networks

In this study, we developed a novel computational approach based on protein–protein interaction networks to identify a list of proteins that might have remained undetected in differential proteomic profiling experiments. We tested our computational approach on two sets of human smooth muscle cell protein extracts that were affected differently by DNase I treatment. Differential proteomic analysis by saturation DIGE resulted in the identification of 41 human proteins. The application of our approach to these 41 input proteins consisted of four steps: (i) Compilation of a human protein–protein interaction network from public databases; (ii) calculation of interaction scores based on functional similarity; (iii) determination of a set of candidate proteins that are needed to efficiently and confidently connect the 41 input proteins; and (iv) ranking of the resulting 25 candidate proteins. Two of the three highest‐ranked proteins, beta‐arrestin 1, and beta‐arrestin 2, were experimentally tested, revealing that their abundance levels in human smooth muscle cell samples were indeed affected by DNase I treatment. These proteins had not been detected during the experimental proteomic analysis. Our study suggests that our computational approach may represent a simple, universal, and cost‐effective means to identify additional proteins that remain elusive for current 2D gel‐based proteomic profiling techniques.     

Specification, annotation, visualization and simulation of a large rule-based model for ERBB receptor signaling

ABSTRACT: BACKGROUND: Mathematical/computational models are needed to understand cell signaling networks, which are complex. Signaling proteins contain multiple functional components and multiple sites of post-translational modification. The multiplicity of components and sites of modification ensures that interactions among signaling proteins have the potential to generate myriad protein complexes and post-translational modification states. As a result, the number of chemical species that can be populated in a cell signaling network, and hence the number of equations in an ordinary differential equation model required to capture the dynamics of these species, is prohibitively large. To overcome this problem, the rule-based modeling approach has been developed for representing interactions within signaling networks efficiently and compactly through coarse-graining of the chemical kinetics of molecular interactions. RESULTS: Here, we provide a demonstration that the rule-based modeling approach can be used to specify and simulate a large model for ERBB receptor signaling that accounts for site-specific details of protein-protein interactions. The model is considered large because it corresponds to a reaction network containing more reactions than can be practically enumerated. The model encompasses activation of ERK and Akt, and it can be simulated using a network-free simulator, such as NFsim, to generate time courses of phosphorylation for 55 individual serine, threonine, and tyrosine residues. The model is annotated and visualized in the form of an extended contact map. CONCLUSIONS: With the development of software that implements novel computational methods for calculating the dynamics of large-scale rule-based representations of cellular signaling networks, it is now possible to build and analyze models that include a significant fraction of the protein interactions that comprise a signaling network, with incorporation of the site-specific details of the interactions. Modeling at this level of detail is important for understanding cellular signaling.     

Extending signaling pathways with protein-interaction networks. Application to apoptosis

Cells exploit signaling pathways during responses to environmental changes, and these processes are often modulated during disease. Particularly, relevant human pathologies such as cancer or viral infections require downregulating apoptosis signaling pathways to progress. As a result, the identification of proteins responsible for these changes is essential for the diagnostics and development of therapeutics. Transferring functional annotation within protein interaction networks has proven useful to identify such proteins, although this is not a trivial task. Here, we used different scoring methods to transfer annotation from 53 well-studied members of the human apoptosis pathways (as known by 2005) to their protein interactors. All scoring methods produced significant predictions (compared to a random negative model), but its number was too large to be useful. Thus, we made a final prediction using specific combinations of scoring methods and compared it to the proteins related to apoptosis signaling pathways during the last 5 years. We propose 273 candidate proteins that may be relevant in apoptosis signaling pathways. Although some of them have known functions consistent with their proposed apoptotsis involvement, the majority have not been annotated yet, leaving room for further experimental studies. We provide our predictions at http://sbi.imim.es/web/Apoptosis.php.     

Network-Based Study Reveals Potential Infection Pathways of Hepatitis-C Leading to Various Diseases

Protein-protein interaction network-based study of viral pathogenesis has been gaining popularity among computational biologists in recent days. In the present study we attempt to investigate the possible pathways of hepatitis-C virus (HCV) infection by integrating the HCV-human interaction network, human protein interactome and human genetic disease association network. We have proposed quasi-biclique and quasi-clique mining algorithms to integrate these three networks to identify infection gateway host proteins and possible pathways of HCV pathogenesis leading to various diseases. Integrated study of three networks, namely HCV-human interaction network, human protein interaction network, and human proteins-disease association network reveals potential pathways of infection by the HCV that lead to various diseases including cancers. The gateway proteins have been found to be biologically coherent and have high degrees in human interactome compared to the other virus-targeted proteins. The analyses done in this study provide possible targets for more effective anti-hepatitis-C therapeutic involvement.     

Rational design of TNFα binding proteins based on the de novo designed protein DS119

De novo protein design offers templates for engineering tailor‐made protein functions and orthogonal protein interaction networks for synthetic biology research. Various computational methods have been developed to introduce functional sites in known protein structures. De novo designed protein scaffolds provide further opportunities for functional protein design. Here we demonstrate the rational design of novel tumor necrosis factor alpha (TNFα) binding proteins using a home‐made grafting program AutoMatch. We grafted three key residues from a virus 2L protein to a de novo designed small protein, DS119, with consideration of backbone flexibility. The designed proteins bind to TNFα with micromolar affinities. We further optimized the interface residues with RosettaDesign and significantly improved the binding capacity of one protein Tbab1‐4. These designed proteins inhibit the activity of TNFα in cellular luciferase assays. Our work illustrates the potential application of the de novo designed protein DS119 in protein engineering, biomedical research, and protein sequence‐structure‐function studies.     

Molecular Recognition Features in Zika Virus Proteome

Viruses have compact genomes that encode limited number of proteins in comparison to other biological entities. Interestingly, viral proteins have shown natural abundance of either completely disordered proteins that are recognized as intrinsically disorder proteins (IDPs) or partially disordered segments known as intrinsically disordered protein regions (IDPRs). IDPRs are involved in interactions with multiple binding partners to accomplish signaling, regulation, and control functions in cells. Tuning of IDPs and IDPRs are mediated through post-translational modification and alternative splicing. Often, the interactions of IDPRs with their binding protein partner(s) lead to transition from the state of disorder to ordered form. Such interaction-prone protein IDPRs are identified as molecular recognition features (MoRFs). Molecular recognition is an important initial step for the biomolecular interactions and their functional proceedings. Although previous studies have established occurrence of the IDPRs in Zika virus proteome, which provide the functional diversity and structural plasticity to viral proteins, the MoRF analysis has not been performed as of yet. Many computational methods have been developed for the identification of the MoRFs in protein sequences including ANCHOR, MoRFpred, DISOPRED3, and MoRFchibi_web server. In the current study, we have investigated the presence of MoRF regions in structural and non-structural proteins of Zika virus using an aforementioned set of computational techniques. Furthermore, we have experimentally validated the intrinsic disorderness of NS2B cofactor region of NS2B–NS3 protease. NS2B has one of the longest MoRF regions in Zika virus proteome. In future, this study may provide valuable information while investigating the virus host protein interaction networks.     

Discrete logic modelling as a means to link protein signalling networks with functional analysis of mammalian signal transduction

Large‐scale protein signalling networks are useful for exploring complex biochemical pathways but do not reveal how pathways respond to specific stimuli. Such specificity is critical for understanding disease and designing drugs. Here we describe a computational approach—implemented in the free CNO software—for turning signalling networks into logical models and calibrating the models against experimental data. When a literature‐derived network of 82 proteins covering the immediate‐early responses of human cells to seven cytokines was modelled, we found that training against experimental data dramatically increased predictive power, despite the crudeness of Boolean approximations, while significantly reducing the number of interactions. Thus, many interactions in literature‐derived networks do not appear to be functional in the liver cells from which we collected our data. At the same time, CNO identified several new interactions that improved the match of model to data. Although missing from the starting network, these interactions have literature support. Our approach, therefore, represents a means to generate predictive, cell‐type‐specific models of mammalian signalling from generic protein signalling networks.     

Synthetic modular systems--reverse engineering of signal transduction

During the last decades, biology has decomposed cellular systems into genetic, functional and molecular networks. It has become evident that these networks consist of components with specific functions (e.g., proteins and genes). This has generated a considerable amount of knowledge and hypotheses concerning cellular organization. The idea discussed here is to test the extent of this knowledge by reconstructing, or reverse engineering, new synthetic biological systems from known components. We will discuss how integration of computational methods with proteomics and engineering concepts might lead us to a deeper and more abstract understanding of signal transduction systems. Designing and successfully introducing synthetic proteins into cellular pathways would provide us with a powerful research tool with many applications, such as development of biosensors, protein drugs and rewiring of biological pathways.     

Fundamentals of protein interaction network mapping

Studying protein interaction networks of all proteins in an organism (“interactomes”) remains one of the major challenges in modern biomedicine. Such information is crucial to understanding cellular pathways and developing effective therapies for the treatment of human diseases. Over the past two decades, diverse biochemical, genetic, and cell biological methods have been developed to map interactomes. In this review, we highlight basic principles of interactome mapping. Specifically, we discuss the strengths and weaknesses of individual assays, how to select a method appropriate for the problem being studied, and provide general guidelines for carrying out the necessary follow‐up analyses. In addition, we discuss computational methods to predict, map, and visualize interactomes, and provide a summary of some of the most important interactome resources. We hope that this review serves as both a useful overview of the field and a guide to help more scientists actively employ these powerful approaches in their research.