Structure-Based Assembly of Protein Complexes in Yeast

Protein-protein interaction inference based on semantic similarity of Gene Ontology terms

Identifying protein-protein interactions is important in molecular biology. Experimental methods to this issue have their limitations, and computational approaches have attracted more and more attentions from the biological community. The semantic similarity derived from the Gene Ontology (GO) annotation has been regarded as one of the most powerful indicators for protein interaction. However, conventional methods based on GO similarity fail to take advantage of the specificity of GO terms in the ontology graph. We proposed a GO-based method to predict protein-protein interaction by integrating different kinds of similarity measures derived from the intrinsic structure of GO graph. We extended five existing methods to derive the semantic similarity measures from the descending part of two GO terms in the GO graph, then adopted a feature integration strategy to combines both the ascending and the descending similarity scores derived from the three sub-ontologies to construct various kinds of features to characterize each protein pair. Support vector machines (SVM) were employed as discriminate classifiers, and five-fold cross validation experiments were conducted on both human and yeast protein-protein interaction datasets to evaluate the performance of different kinds of integrated features, the experimental results suggest the best performance of the feature that combines information from both the ascending and the descending parts of the three ontologies. Our method is appealing for effective prediction of protein-protein interaction.

Binding interface change and cryptic variation in the evolution of protein-protein interactions

Background

Physical interactions between proteins are essential for almost all biological functions and systems. To understand the evolution of function it is therefore important to understand the evolution of molecular interactions. Of key importance is the evolution of binding specificity, the set of interactions made by a protein, since change in specificity can lead to “rewiring” of interaction networks. Unfortunately, the interfaces through which proteins interact are complex, typically containing many amino-acid residues that collectively must contribute to binding specificity as well as binding affinity, structural integrity of the interface and solubility in the unbound state.

Results

In order to study the relationship between interface composition and binding specificity, we make use of paralogous pairs of yeast proteins. Immediately after duplication these paralogues will have identical sequences and protein products that make an identical set of interactions. As the sequences diverge, we can correlate amino-acid change in the interface with any change in the specificity of binding. We show that change in interface regions correlates only weakly with change in specificity, and many variants in interfaces are functionally equivalent. We show that many of the residue replacements within interfaces are silent with respect to their contribution to binding specificity.

Conclusions

We conclude that such functionally-equivalent change has the potential to contribute to evolutionary plasticity in interfaces by creating cryptic variation, which in turn may provide the raw material for functional innovation and coevolution.

Electronic supplementary material

The online version of this article (doi:10.1186/s12862-016-0608-1) contains supplementary material, which is available to authorized users.

The neuronal porosome complex in health and disease

Cup-shaped secretory portals at the cell plasma membrane called porosomes mediate the precision release of intravesicular material from cells. Membrane-bound secretory vesicles transiently dock and fuse at the base of porosomes facing the cytosol to expel pressurized intravesicular contents from the cell during secretion. The structure, isolation, composition, and functional reconstitution of the neuronal porosome complex have greatly progressed, providing a molecular understanding of its function in health and disease. Neuronal porosomes are 15 nm cup-shaped lipoprotein structures composed of nearly 40 proteins, compared to the 120 nm nuclear pore complex composed of >500 protein molecules. Membrane proteins compose the porosome complex, making it practically impossible to solve its atomic structure. However, atomic force microscopy and small-angle X-ray solution scattering studies have provided three-dimensional structural details of the native neuronal porosome at sub-nanometer resolution, providing insights into the molecular mechanism of its function. The participation of several porosome proteins previously implicated in neurotransmission and neurological disorders, further attest to the crosstalk between porosome proteins and their coordinated involvement in release of neurotransmitter at the synapse.

Protein-protein interaction prediction by combined analysis of genomic and conservation information

Protein-protein interactions (PPIs) are highly important because of their main role in cellular processes and biochemical pathways; therefore, PPI can be very useful in the prediction of protein functions. Experimental techniques of PPI detection have certain drawbacks; hence computational methods can be used to complement wet lab techniques. Such methods can be applied to PPI prediction as well as validation of experimental results. Computational algorithms can lead to many false PPI predictions, which in turn result in non-adequate performance. We have developed a novel method based on combined analysis, entitled PPIccc. Three different descriptors for PPIccc included gene co-expression values, codon usage similarity and conservation of surface residues between protein products of a gene pair, which combined to predict PPI. Validation of results based on Human Protein Reference Database (HPRD) indicated improvement of performance in our proposed method. The results also revealed that conservation of surface residues between proteins in combination with codon usage similarity of their related genes increase the performance of PPI prediction. This means that codon usage similarity and surface residues between proteins (only sequence-based features) can predict PPIs as good as PPIccc.

Protein complex detection in PPI networks based on data integration and supervised learning method

Background

Revealing protein complexes are important for understanding principles of cellular organization and function. High-throughput experimental techniques have produced a large amount of protein interactions, which makes it possible to predict protein complexes from protein-protein interaction (PPI) networks. However, the small amount of known physical interactions may limit protein complex detection.

Methods

The new PPI networks are constructed by integrating PPI datasets with the large and readily available PPI data from biomedical literature, and then the less reliable PPI between two proteins are filtered out based on semantic similarity and topological similarity of the two proteins. Finally, the supervised learning protein complex detection (SLPC), which can make full use of the information of available known complexes, is applied to detect protein complex on the new PPI networks.

Results

The experimental results of SLPC on two different categories yeast PPI networks demonstrate effectiveness of the approach: compared with the original PPI networks, the best average improvements of 4.76, 6.81 and 15.75 percentage units in the F-score, accuracy and maximum matching ratio (MMR) are achieved respectively; compared with the denoising PPI networks, the best average improvements of 3.91, 4.61 and 12.10 percentage units in the F-score, accuracy and MMR are achieved respectively; compared with ClusterONE, the start-of the-art complex detection method, on the denoising extended PPI networks, the average improvements of 26.02 and 22.40 percentage units in the F-score and MMR are achieved respectively.

Conclusions

The experimental results show that the performances of SLPC have a large improvement through integration of new receivable PPI data from biomedical literature into original PPI networks and denoising PPI networks. In addition, our protein complexes detection method can achieve better performance than ClusterONE.

MOEPGA: A novel method to detect protein complexes in yeast protein-protein interaction networks based on MultiObjective Evolutionary Programming Genetic Algorithm

The identification of protein complexes in protein-protein interaction (PPI) networks has greatly advanced our understanding of biological organisms. Existing computational methods to detect protein complexes are usually based on specific network topological properties of PPI networks. However, due to the inherent complexity of the network structures, the identification of protein complexes may not be fully addressed by using single network topological property. In this study, we propose a novel MultiObjective Evolutionary Programming Genetic Algorithm (MOEPGA) which integrates multiple network topological features to detect biologically meaningful protein complexes. Our approach first systematically analyzes the multiobjective problem in terms of identifying protein complexes from PPI networks, and then constructs the objective function of the iterative algorithm based on three common topological properties of protein complexes from the benchmark dataset, finally we describe our algorithm, which mainly consists of three steps, population initialization, subgraph mutation and subgraph selection operation. To show the utility of our method, we compared MOEPGA with several state-of-the-art algorithms on two yeast PPI datasets. The experiment results demonstrate that the proposed method can not only find more protein complexes but also achieve higher accuracy in terms of fscore. Moreover, our approach can cover a certain number of proteins in the input PPI network in terms of the normalized clustering score. Taken together, our method can serve as a powerful framework to detect protein complexes in yeast PPI networks, thereby facilitating the identification of the underlying biological functions.

A New Method for Detecting Protein Complexes based on the Three Node Cliques

The identification of protein complexes in protein-protein interaction (PPI) networks is fundamental for understanding biological processes and cellular molecular mechanisms. Many graph computational algorithms have been proposed to identify protein complexes from PPI networks by detecting densely connected groups of proteins. These algorithms assess the density of subgraphs through evaluation of the sum of individual edges or nodes; thus, incomplete and inaccurate measures may miss meaningful biological protein complexes with functional significance. In this study, we propose a novel method for assessing the compactness of local subnetworks by measuring the number of three node cliques. The present method detects each optimal cluster by growing a seed and maximizing the compactness function. To demonstrate the efficacy of the new proposed method, we evaluate its performance using five PPI networks on three reference sets of yeast protein complexes with five different measurements and compare the performance of the proposed method with four state-of-the-art methods. The results show that the protein complexes generated by the proposed method are of better quality than those generated by four classic methods. Therefore, the new proposed method is effective and useful for detecting protein complexes in PPI networks.

Identification of Essential Proteins Based on a New Combination of Local Interaction Density and Protein Complexes

Background

Computational approaches aided by computer science have been used to predict essential proteins and are faster than expensive, time-consuming, laborious experimental approaches. However, the performance of such approaches is still poor, making practical applications of computational approaches difficult in some fields. Hence, the development of more suitable and efficient computing methods is necessary for identification of essential proteins.

Method

In this paper, we propose a new method for predicting essential proteins in a protein interaction network, local interaction density combined with protein complexes (LIDC), based on statistical analyses of essential proteins and protein complexes. First, we introduce a new local topological centrality, local interaction density (LID), of the yeast PPI network; second, we discuss a new integration strategy for multiple bioinformatics. The LIDC method was then developed through a combination of LID and protein complex information based on our new integration strategy. The purpose of LIDC is discovery of important features of essential proteins with their neighbors in real protein complexes, thereby improving the efficiency of identification.

Results

Experimental results based on three different PPI(protein-protein interaction) networks of Saccharomyces cerevisiae and Escherichia coli showed that LIDC outperformed classical topological centrality measures and some recent combinational methods. Moreover, when predicting MIPS datasets, the better improvement of performance obtained by LIDC is over all nine reference methods (i.e., DC, BC, NC, LID, PeC, CoEWC, WDC, ION, and UC).

Conclusions

LIDC is more effective for the prediction of essential proteins than other recently developed methods.

CyToStruct: Augmenting the Network Visualization of Cytoscape with the Power of Molecular Viewers

It can be informative to view biological data, e.g., protein-protein interactions within a large complex, in a network representation coupled with three-dimensional structural visualizations of individual molecular entities. CyToStruct, introduced here, provides a transparent interface between the Cytoscape platform for network analysis and molecular viewers, including PyMOL, UCSF Chimera, VMD, and Jmol. CyToStruct launches and passes scripts to molecular viewers from the network's edges and nodes. We provide demonstrations to analyze interactions among subunits in large protein/RNA/DNA complexes, and similarities among proteins. CyToStruct enriches the network tools of Cytoscape by adding a layer of structural analysis, offering all capabilities implemented in molecular viewers. CyToStruct is available at https://bitbucket.org/sergeyn/cytostruct/wiki/Home and in the Cytoscape App Store. Given the coordinates of a molecular complex, our web server (http://trachel-srv.cs.haifa.ac.il/rachel/ppi/) automatically generates all files needed to visualize the complex as a Cytoscape network with CyToStruct bridging to PyMOL, UCSF Chimera, VMD, and Jmol.

Predicting protein complexes from weighted protein-protein interaction graphs with a novel unsupervised methodology: Evolutionary enhanced Markov clustering

OBJECTIVE

Proteins are considered to be the most important individual components of biological systems and they combine to form physical protein complexes which are responsible for certain molecular functions. Despite the large availability of protein-protein interaction (PPI) information, not much information is available about protein complexes. Experimental methods are limited in terms of time, efficiency, cost and performance constraints. Existing computational methods have provided encouraging preliminary results, but they phase certain disadvantages as they require parameter tuning, some of them cannot handle weighted PPI data and others do not allow a protein to participate in more than one protein complex. In the present paper, we propose a new fully unsupervised methodology for predicting protein complexes from weighted PPI graphs.

METHODS AND MATERIALS

The proposed methodology is called evolutionary enhanced Markov clustering (EE-MC) and it is a hybrid combination of an adaptive evolutionary algorithm and a state-of-the-art clustering algorithm named enhanced Markov clustering. EE-MC was compared with state-of-the-art methodologies when applied to datasets from the human and the yeast Saccharomyces cerevisiae organisms.

RESULTS

Using public available datasets, EE-MC outperformed existing methodologies (in some datasets the separation metric was increased by 10-20%). Moreover, when applied to new human datasets its performance was encouraging in the prediction of protein complexes which consist of proteins with high functional similarity. In specific, 5737 protein complexes were predicted and 72.58% of them are enriched for at least one gene ontology (GO) function term.

CONCLUSIONS

EE-MC is by design able to overcome intrinsic limitations of existing methodologies such as their inability to handle weighted PPI networks, their constraint to assign every protein in exactly one cluster and the difficulties they face concerning the parameter tuning. This fact was experimentally validated and moreover, new potentially true human protein complexes were suggested as candidates for further validation using experimental techniques.

Proteome of the insulin-secreting Min6 cell porosome complex: involvement of Hsp90 in its assembly and function

Porosomes are secretory portals located at the cell plasma membrane involved in the regulated release of intravesicular contents from cells. Porosomes have been immunoisolated from a number of cells including the exocrine pancreas and neurons, biochemically characterized, and functionally reconstituted into an artificial lipid membrane. In the current study, the proteome of the porosome complex in mouse insulinoma Min6 cells was determined, demonstrating among other proteins, the presence of 30 core proteins including the heat shock protein Hsp90. Half maximal inhibition of Hsp90 using the specific inhibitor 17-demethoxy-17-(2-prophenylamino) geldanamycin, results in the loss of proteins, including the calcium-transporting ATPase type 2C and the potassium channel subfamily K member 2 from the Min6 porosome. This loss of porosome proteins is reflected in the observed inhibition of glucose stimulated insulin release from Min6 cells exposed to the Hsp90 specific inhibitor. Results from the study implicate Hsp90 in the assembly and function of the porosome complex.

BIOLOGICAL SIGNIFICANCE

In the present study, the porosome proteome in the insulin-secreting mouse β-cell line Min6 has been determined. Nearly 30 core proteins including the heat shock protein Hsp90 are found to compose the Min6 porosome complex. Results from the study implicate Hsp90 in the assembly of the Min6 porosome. These new findings will facilitate understanding of the porosome assembly and its function in insulin secretion.

Mechismo: predicting the mechanistic impact of mutations and modifications on molecular interactions

Systematic interrogation of mutation or protein modification data is important to identify sites with functional consequences and to deduce global consequences from large data sets. Mechismo (mechismo.russellab.org) enables simultaneous consideration of thousands of 3D structures and biomolecular interactions to predict rapidly mechanistic consequences for mutations and modifications. As useful functional information often only comes from homologous proteins, we benchmarked the accuracy of predictions as a function of protein/structure sequence similarity, which permits the use of relatively weak sequence similarities with an appropriate confidence measure. For protein–protein, protein–nucleic acid and a subset of protein–chemical interactions, we also developed and benchmarked a measure of whether modifications are likely to enhance or diminish the interactions, which can assist the detection of modifications with specific effects. Analysis of high-throughput sequencing data shows that the approach can identify interesting differences between cancers, and application to proteomics data finds potential mechanistic insights for how post-translational modifications can alter biomolecular interactions.

Predicting protein complex in protein interaction network - a supervised learning based method

Background

Protein complexes are important for understanding principles of cellular organization and function. High-throughput experimental techniques have produced a large amount of protein interactions, making it possible to predict protein complexes from protein -protein interaction networks. However, most of current methods are unsupervised learning based methods which can't utilize the information of the large amount of available known complexes.

Methods

We present a supervised learning-based method for predicting protein complexes in protein - protein interaction networks. The method extracts rich features from both the unweighted and weighted networks to train a Regression model, which is then used for the cliques filtering, growth, and candidate complex filtering. The model utilizes additional "uncertainty" samples and, therefore, is more discriminative when used in the complex detection algorithm. In addition, our method uses the maximal cliques found by the Cliques algorithm as the initial cliques, which has been proven to be more effective than the method of expanding from the seeding proteins used in other methods.

Results

The experimental results on several PIN datasets show that in most cases the performance of our method are superior to comparable state-of-the-art protein complex detection techniques.

Conclusions

The results demonstrate the several advantages of our method over other state-of-the-art techniques. Firstly, our method is a supervised learning-based method that can make full use of the information of the available known complexes instead of being only based on the topological structure of the PIN. That also means, if more training samples are provided, our method can achieve better performance than those unsupervised methods. Secondly, we design the rich feature set to describe the properties of the known complexes, which includes not only the features from the unweighted network, but also those from the weighted network built based on the Gene Ontology information. Thirdly, our Regression model utilizes additional "uncertainty" samples and, therefore, becomes more discriminative, whose effectiveness for the complex detection is indicated by our experimental results.

MAE-FMD: multi-agent evolutionary method for functional module detection in protein-protein interaction networks

Background

Studies of functional modules in a Protein-Protein Interaction (PPI) network contribute greatly to the understanding of biological mechanisms. With the development of computing science, computational approaches have played an important role in detecting functional modules.

Results

We present a new approach using multi-agent evolution for detection of functional modules in PPI networks. The proposed approach consists of two stages: the solution construction for agents in a population and the evolutionary process of computational agents in a lattice environment, where each agent corresponds to a candidate solution to the detection problem of functional modules in a PPI network. First, the approach utilizes a connection-based encoding scheme to model an agent, and employs a random-walk behavior merged topological characteristics with functional information to construct a solution. Next, it applies several evolutionary operators, i.e., competition, crossover, and mutation, to realize information exchange among agents as well as solution evolution. Systematic experiments have been conducted on three benchmark testing sets of yeast networks. Experimental results show that the approach is more effective compared to several other existing algorithms.

Conclusions

The algorithm has the characteristics of outstanding recall, F-measure, sensitivity and accuracy while keeping other competitive performances, so it can be applied to the biological study which requires high accuracy.

Neuronal Porosome-The Secretory Portal at the Nerve Terminal: It's Structure-Function, Composition, and Reconstitution

Cup-shaped secretory portals at the cell plasma membrane called porosomes mediate secretion from cells. Membrane bound secretory vesicles transiently dock and fuse at the cytosolic compartment of the porosome base to expel intravesicular contents to the outside during cell secretion. In the past decade, the structure, isolation, composition, and functional reconstitution of the neuronal porosome complex has been accomplished providing a molecular understanding of its structure-function. Neuronal porosomes are 15 nm cup-shaped lipoprotein structures composed of nearly 40 proteins. Being a membrane-associated supramolecular complex has precluded determination of the atomic structure of the porosome. However recent studies using small-angle X-ray solution scattering (SAXS), provide at sub-nanometer resolution, the native 3D structure of the neuronal porosome complex associated with docked synaptic vesicle at the nerve terminal. Additionally, results from the SAXS study and earlier studies using atomic force microscopy, provide the possible molecular mechanism involved in porosome-mediated neurotransmitter release at the nerve terminal.

A new method for predicting essential proteins based on dynamic network topology and complex information

Predicting essential proteins is highly significant because organisms can not survive or develop even if only one of these proteins is missing. Improvements in high-throughput technologies have resulted in a large number of available protein-protein interactions. By taking advantage of these interaction data, researchers have proposed many computational methods to identify essential proteins at the network level. Most of these approaches focus on the topology of a static protein interaction network. However, the protein interaction network changes with time and condition. This important inherent dynamics of the protein interaction network is overlooked by previous methods. In this paper, we introduce a new method named CDLC to predict essential proteins by integrating dynamic local average connectivity and in-degree of proteins in complexes. CDLC is applied to the protein interaction network of Saccharomyces cerevisiae. The results show that CDLC outperforms five other methods (Degree Centrality (DC), Local Average Connectivity-based method (LAC), Sum of ECC (SoECC), PeC and Co-Expression Weighted by Clustering coefficient (CoEWC)). In particular, CDLC could improve the prediction precision by more than 45% compared with DC methods. CDLC is also compared with the latest algorithm CEPPK, and a higher precision is achieved by CDLC. CDLC is available as Supplementary materials. The default settings of active threshold and alpha-parameter are 0.8 and 0.1, respectively.

Porosome in Cystic Fibrosis

Macromolecular structures embedded in the cell plasma membrane called ‘porosomes’, are involved in the regulated fractional release of intravesicular contents from cells during secretion. Porosomes range in size from 15 nm in neurons and astrocytes to 100-180 nm in the exocrine pancreas and neuroendocrine cells. Porosomes have been isolated from a number of cells, and their morphology, composition, and functional reconstitution well documented. The 3D contour map of the assembly of proteins within the porosome complex, and its native X-ray solution structure at sub-nm resolution has also advanced. This understanding now provides a platform to address diseases that may result from secretory defects. Water and ion binding to mucin impart hydration, critical for regulating viscosity of the mucus in the airways epithelia. Appropriate viscosity is required for the movement of mucus by the underlying cilia. Hence secretion of more viscous mucus prevents its proper transport, resulting in chronic and fatal airways disease such as cystic fibrosis (CF). CF is caused by the malfunction of CF transmembrane conductance regulator (CFTR), a chloride channel transporter, resulting in viscous mucus in the airways. Studies in mice lacking functional CFTR secrete highly viscous mucous that adhered to the epithelium. Since CFTR is known to interact with the t-SNARE protein syntaxin-1A, and with the chloride channel CLC-3, which are also components of the porosome complex, the interactions between CFTR and the porosome complex in the mucin-secreting human airway epithelial cell line Calu-3 was hypothesized and tested. Results from the study demonstrate the presence of approximately 100 nm in size porosome complex composed of 34 proteins at the cell plasma membrane in Calu-3 cells, and the association of CFTR with the complex. In comparison, the nuclear pore complex measures 120 nm and is comprised of over 500 protein molecules. The involvement of CFTR in porosome-mediated mucin secretion is hypothesized, and is currently being tested.

Protein-protein interaction networks studies and importance of 3D structure knowledge

Protein-protein interaction networks (PPINs) are a powerful tool to study biological processes in living cells. In this review, we present the progress of PPIN studies from abstract to more detailed representations. We will focus on 3D interactome networks, which offer detailed information at the atomic level. This information can be exploited in understanding not only the underlying cellular mechanisms, but also how human variants and disease-causing mutations affect protein functions and complexes' stability. Recent studies have used structural information on PPINs to also understand the molecular mechanisms of binding partner selection. We will address the challenges in generating 3D PPINs due to the restricted number of solved protein structures. Finally, some of the current use of 3D PPINs will be discussed, highlighting their contribution to the studies in genotype-phenotype relationships and in the optimization of targeted studies to design novel chemical compounds for medical treatments.

An edge-based protein complex identification algorithm with gene co-expression data (PCIA-GeCo)

Recent studies have shown that protein complex is composed of core proteins and attachment proteins, and proteins inside the core are highly co-expressed. Based on this new concept, we reconstruct weighted PPI network by using gene expression data, and develop a novel protein complex identification algorithm from the angle of edge (PCIA-GeCo). First, we select the edge with high co-expressed coefficient as seed to form the preliminary cores. Then, the preliminary cores are filtered according to the weighted density of complex core to obtain the unique core. Finally, the protein complexes are generated by identifying attachment proteins for each core. A comprehensive comparison in term of F-measure, Coverage rate, P-value between our method and three other existing algorithms HUNTER, COACH and CORE has been made by comparing the predicted complexes against benchmark complexes. The evaluation results show our method PCIA-GeCo is effective; it can identify protein complexes more accurately.

Modeling protein assemblies in the proteome

Most (if not all) proteins function when associated in multimolecular assemblies. Attaining the structures of protein assemblies at the atomic scale is an important aim of structural biology. Experimentally, structures are increasingly available, and computations can help bridge the resolution gap between high- and low-resolution scales. Existing computational methods have made substantial progress toward this aim; however, current approaches are still limited. Some involve manual adjustment of experimental data; some are automated docking methods, which are computationally expensive and not applicable to large-scale proteome studies; and still others exploit the symmetry of the complexes and thus are not applicable to nonsymmetrical complexes. Our study aims to take steps toward overcoming these limitations. We have developed a strategy for the construction of protein assemblies computationally based on binary interactions predicted by a motif-based protein interaction prediction tool, PRISM (Protein Interactions by Structural Matching). Previously, we have shown its power in predicting pairwise interactions. Here we take a step toward multimolecular assemblies, reflecting the more prevalent cellular scenarios. With this method we are able to construct homo-/hetero-complexes and symmetric/asymmetric complexes without a limitation on the number of components. The method considers conformational changes and is applicable to large-scale studies. We also exploit electron microscopy density maps to select a solution from among the predictions. Here we present the method, illustrate its results, and highlight its current limitations.

The binary protein-protein interaction landscape of Escherichia coli

Efforts to map the Escherichia coli interactome have identified several hundred macromolecular complexes, but direct binary protein-protein interactions (PPIs) have not been surveyed on a large scale. Here we performed yeast two-hybrid screens of 3,305 baits against 3,606 preys (∼70% of the E. coli proteome) in duplicate to generate a map of 2,234 interactions, which approximately doubles the number of known binary PPIs in E. coli. Integration of binary PPI and genetic-interaction data revealed functional dependencies among components involved in cellular processes, including envelope integrity, flagellum assembly and protein quality control. Many of the binary interactions that we could map in multiprotein complexes were informative regarding internal topology of complexes and indicated that interactions in complexes are substantially more conserved than those interactions connecting different complexes. This resource will be useful for inferring bacterial gene function and provides a draft reference of the basic physical wiring network of this evolutionarily important model microbe.

Analyzing protein-protein interactions in the post-interactomic era. Are we ready for the endgame?

Mapping protein-protein interactions in genome-wide scales revealed thousands of novel binding partners in each of the explored model organisms. Organizing these hits in comprehensive ways is becoming increasingly important for systems biology approaches to understand complex cellular processes and diseases. However, proteome wide interaction techniques and their resulting global networks are not revealing the topologies of networks that are truly operating in the cell. In this short review I will discuss which prerequisites have to be fulfilled and which experimental methods might be practicable to translate primary protein interaction data into network presentations that help in understanding cellular processes.

Dynamic protein ligand interactions--insights from MS

Proteins undergo dynamic interactions with carbohydrates, lipids and nucleotides to form catalytic cores, fine‐tuned for different cellular actions. The study of dynamic interactions between proteins and their cognate ligands is therefore fundamental to the understanding of biological systems. During the last two decades MS, and its associated techniques, has become accepted as a method for the study of protein–ligand interactions, not only for covalent complexes, where the use of MS is well established, but also, and significantly for protein–ligand interactions, for noncovalent assemblies. In this review, we employ a broad definition of a ligand to encompass protein subunits, drug molecules, oligonucleotides, carbohydrates, and lipids. Under the appropriate conditions, MS can reveal the composition, heterogeneity and dynamics of these protein–ligand interactions, and in some cases their structural arrangements and binding affinities. Herein, we highlight MS approaches for studying protein–ligand complexes, including those containing integral membrane subunits, and showcase examples from recent literature. Specifically, we tabulate the myriad of methodologies, including hydrogen exchange, proteomics, hydroxyl radical footprinting, intact complexes, and crosslinking, which, when combined with MS, provide insights into conformational changes and subtle modifications in response to ligand‐binding interactions.

Computational Prediction of Protein-Protein Interaction Networks: Algo-rithms and Resources

Protein interactions play an important role in the discovery of protein functions and pathways in biological processes. This is especially true in case of the diseases caused by the loss of specific protein-protein interactions in the organism. The accuracy of experimental results in finding protein-protein interactions, however, is rather dubious and high throughput experimental results have shown both high false positive beside false negative information for protein interaction. Computational methods have attracted tremendous attention among biologists because of the ability to predict protein-protein interactions and validate the obtained experimental results. In this study, we have reviewed several computational methods for protein-protein interaction prediction as well as describing major databases, which store both predicted and detected protein-protein interactions, and the tools used for analyzing protein interaction networks and improving protein-protein interaction reliability.

Template-based structure modeling of protein-protein interactions

The structure of protein-protein complexes can be constructed by using the known structure of other protein complexes as a template. The complex structure templates are generally detected either by homology-based sequence alignments or, given the structure of monomer components, by structure-based comparisons. Critical improvements have been made in recent years by utilizing interface recognition and by recombining monomer and complex template libraries. Encouraging progress has also been witnessed in genome-wide applications of template-based modeling, with modeling accuracy comparable to high-throughput experimental data. Nevertheless, bottlenecks exist due to the incompleteness of the protein-protein complex structure library and the lack of methods for distant homologous template identification and full-length complex structure refinement.

High-resolution network biology: connecting sequence with function

Proteins are not monolithic entities; rather, they can contain multiple domains that mediate distinct interactions, and their functionality can be regulated through post-translational modifications at multiple distinct sites. Traditionally, network biology has ignored such properties of proteins and has instead examined either the physical interactions of whole proteins or the consequences of removing entire genes. In this Review, we discuss experimental and computational methods to increase the resolution of protein-protein, genetic and drug-gene interaction studies to the domain and residue levels. Such work will be crucial for using interaction networks to connect sequence and structural information, and to understand the biological consequences of disease-associated mutations, which will hopefully lead to more effective therapeutic strategies.

Detecting overlapping protein complexes in PPI networks based on robustness

BACKGROUND

Recently, large data sets of protein-protein interactions (PPI) which can be modeled as PPI networks are generated through high-throughput methods. And locally dense regions in PPI networks are very likely to be protein complexes. Since protein complexes play a key role in many biological processes, detecting protein complexes in PPI networks is one of important tasks in post-genomic era. However, PPI networks are often incomplete and noisy, which builds barriers to mining protein complexes.

RESULTS

We propose a new and effective algorithm based on robustness to detect overlapping clusters as protein complexes in PPI networks. And in order to improve the accuracy of resulting clusters, our algorithm tries to reduce bad effects brought by noise in PPI networks. And in our algorithm, each new cluster begins from a seed and is expanded through adding qualified nodes from the cluster's neighbourhood nodes. Besides, in our algorithm, a new distance measurement method between a cluster K and a node in the neighbours of K is proposed as well. The performance of our algorithm is evaluated by applying it on two PPI networks which are Gavin network and Database of Interacting Proteins (DIP). The results show that our algorithm is better than Markov clustering algorithm (MCL), Clique Percolation method (CPM) and core-attachment based method (CoAch) in terms of F-measure, co-localization and Gene Ontology (GO) semantic similarity.

CONCLUSIONS

Our algorithm detects locally dense regions or clusters as protein complexes. The results show that protein complexes generated by our algorithm have better quality than those generated by some previous classic methods. Therefore, our algorithm is effective and useful.

PLW: Probabilistic Local Walks for detecting protein complexes from protein interaction networks

BACKGROUND

Many biological processes are carried out by proteins interacting with each other in the form of protein complexes. However, large-scale detection of protein complexes has remained constrained by experimental limitations. As such, computational detection of protein complexes by applying clustering algorithms on the abundantly available protein-protein interaction (PPI) networks is an important alternative. However, many current algorithms have overlooked the importance of selecting seeds for expansion into clusters without excluding important proteins and including many noisy ones, while ensuring a high degree of functional homogeneity amongst the proteins detected for the complexes.

RESULTS

We designed a novel method called Probabilistic Local Walks (PLW) which clusters regions in a PPI network with high functional similarity to find protein complex cores with high precision and efficiency in O (|V| log |V| + |E|) time. A seed selection strategy, which prioritises seeds with dense neighbourhoods, was devised. We defined a topological measure, called common neighbour similarity, to estimate the functional similarity of two proteins given the number of their common neighbours.

CONCLUSIONS

Our proposed PLW algorithm achieved the highest F-measure (recall and precision) when compared to 11 state-of-the-art methods on yeast protein interaction data, with an improvement of 16.7% over the next highest score. Our experiments also demonstrated that our seed selection strategy is able to increase algorithm precision when applied to three previous protein complex mining techniques.

AVAILABILITY

The software, datasets and predicted complexes are available at http://wonglkd.github.io/PLW.

Genome-wide structural modelling of TCR-pMHC interactions

Background

The adaptive immune response is antigen-specific and triggered by pathogen recognition through T cells. Although the interactions and mechanisms of TCR-peptide-MHC (TCR-pMHC) have been studied over three decades, the biological basis for these processes remains controversial. As an increasing number of high-throughput binding epitopes and available TCR-pMHC complex structures, a fast genome-wide structural modelling of TCR-pMHC interactions is an emergent task for understanding immune interactions and developing peptide vaccines.

Results

We first constructed the PPI matrices and iMatrix, using 621 non-redundant PPI interfaces and 398 non-redundant antigen-antibody interfaces, respectively, for modelling the MHC-peptide and TCR-peptide interfaces, respectively. The iMatrix consists of four knowledge-based scoring matrices to evaluate the hydrogen bonds and van der Waals forces between sidechains or backbones, respectively. The predicted energies of iMatrix are high correlated (Pearson's correlation coefficient is 0.6) to 70 experimental free energies on antigen-antibody interfaces. To further investigate iMatrix and PPI matrices, we inferred the 701,897 potential peptide antigens with significant statistic from 389 pathogen genomes and modelled the TCR-pMHC interactions using available TCR-pMHC complex structures. These identified peptide antigens keep hydrogen-bond energies and consensus interactions and our TCR-pMHC models can provide detailed interacting models and crucial binding regions.

Conclusions

Experimental results demonstrate that our method can achieve high precision for predicting binding affinity and potential peptide antigens. We believe that iMatrix and our template-based method can be useful for the binding mechanisms of TCR-pMHC complexes and peptide vaccine designs.

Evaluating template-based and template-free protein-protein complex structure prediction

We compared the performance of template-free (docking) and template-based methods for the prediction of protein-protein complex structures. We found similar performance for a template-based method based on threading (COTH) and another template-based method based on structural alignment (PRISM). The template-based methods showed similar performance to a docking method (ZDOCK) when the latter was allowed one prediction for each complex, but when the same number of predictions was allowed for each method, the docking approach outperformed template-based approaches. We identified strengths and weaknesses in each method. Template-based approaches were better able to handle complexes that involved conformational changes upon binding. Furthermore, the threading-based and docking methods were better than the structural-alignment-based method for enzyme-inhibitor complex prediction. Finally, we show that the near-native (correct) predictions were generally not shared by the various approaches, suggesting that integrating their results could be the superior strategy.

Designing template-free predictor for targeting protein-ligand binding sites with classifier ensemble and spatial clustering

Accurately identifying the protein-ligand binding sites or pockets is of significant importance for both protein function analysis and drug design. Although much progress has been made, challenges remain, especially when the 3D structures of target proteins are not available or no homology templates can be found in the library, where the template-based methods are hard to be applied. In this paper, we report a new ligand-specific template-free predictor called TargetS for targeting protein-ligand binding sites from primary sequences. TargetS first predicts the binding residues along the sequence with ligand-specific strategy and then further identifies the binding sites from the predicted binding residues through a recursive spatial clustering algorithm. Protein evolutionary information, predicted protein secondary structure, and ligand-specific binding propensities of residues are combined to construct discriminative features; an improved AdaBoost classifier ensemble scheme based on random undersampling is proposed to deal with the serious imbalance problem between positive (binding) and negative (nonbinding) samples. Experimental results demonstrate that TargetS achieves high performances and outperforms many existing predictors. TargetS web server and data sets are freely available at: http://www.csbio.sjtu.edu.cn/bioinf/TargetS/ for academic use.

Identifying complexes from protein interaction networks according to different types of neighborhood density

To facilitate the realization of biological functions, proteins are often organized into complexes. While computational techniques are used to predict these complexes, detailed understanding of their organization remains inadequate. Apart from complexes that reside in very dense regions of a protein interaction network in which most algorithms are able to identify, we observe that many other complexes, while not residing in very dense regions, reside in regions with low neighborhood density. We develop an algorithm for identifying protein complexes by considering these two types of complexes separately. We test our algorithm on a few yeast protein interaction networks, and show that our algorithm is able to identify complexes more accurately than existing algorithms. A software program NDComplex for implementing the algorithm is available at http://faculty.cse.tamu.edu/shsze/ndcomplex.

Protein complex detection using interaction reliability assessment and weighted clustering coefficient

BACKGROUND

Predicting protein complexes from protein-protein interaction data is becoming a fundamental problem in computational biology. The identification and characterization of protein complexes implicated are crucial to the understanding of the molecular events under normal and abnormal physiological conditions. On the other hand, large datasets of experimentally detected protein-protein interactions were determined using High-throughput experimental techniques. However, experimental data is usually liable to contain a large number of spurious interactions. Therefore, it is essential to validate these interactions before exploiting them to predict protein complexes.

RESULTS

In this paper, we propose a novel graph mining algorithm (PEWCC) to identify such protein complexes. Firstly, the algorithm assesses the reliability of the interaction data, then predicts protein complexes based on the concept of weighted clustering coefficient. To demonstrate the effectiveness of the proposed method, the performance of PEWCC was compared to several methods. PEWCC was able to detect more matched complexes than any of the state-of-the-art methods with higher quality scores.

CONCLUSIONS

The higher accuracy achieved by PEWCC in detecting protein complexes is a valid argument in favor of the proposed method. The datasets and programs are freely available at http://faculty.uaeu.ac.ae/nzaki/Research.htm.

From systems to structure: bridging networks and mechanism

There is a wide gap between the generation of large-scale biological data sets and more-detailed, structural and mechanistic studies. However, recent studies that explicitly combine data from systems and structural biological approaches are having a profound effect on our ability to predict how mutations and small molecules affect atomic-level mechanisms, disrupt systems-level networks, and ultimately lead to changes in organismal fitness. In fact, we argue that a shared framework for analysis of nonadditive genetic and thermodynamic responses to perturbations will accelerate the integration of reductionist and global approaches. A stronger bridge between these two areas will allow for a deeper and more-complete understanding of complex biological phenomenon and ultimately provide needed breakthroughs in biomedical research.

Mapping monomeric threading to protein-protein structure prediction

The key step of template-based protein-protein structure prediction is the recognition of complexes from experimental structure libraries that have similar quaternary fold. Maintaining two monomer and dimer structure libraries is however laborious, and inappropriate library construction can degrade template recognition coverage. We propose a novel strategy SPRING to identify complexes by mapping monomeric threading alignments to protein-protein interactions based on the original oligomer entries in the PDB, which does not rely on library construction and increases the efficiency and quality of complex template recognitions. SPRING is tested on 1838 nonhomologous protein complexes which can recognize correct quaternary template structures with a TM score >0.5 in 1115 cases after excluding homologous proteins. The average TM score of the first model is 60% and 17% higher than that by HHsearch and COTH, respectively, while the number of targets with an interface RMSD <2.5 Å by SPRING is 134% and 167% higher than these competing methods. SPRING is controlled with ZDOCK on 77 docking benchmark proteins. Although the relative performance of SPRING and ZDOCK depends on the level of homology filters, a combination of the two methods can result in a significantly higher model quality than ZDOCK at all homology thresholds. These data demonstrate a new efficient approach to quaternary structure recognition that is ready to use for genome-scale modeling of protein-protein interactions due to the high speed and accuracy.

Low-resolution structural modeling of protein interactome

Structural characterization of protein-protein interactions across the broad spectrum of scales is key to our understanding of life at the molecular level. Low-resolution approach to protein interactions is needed for modeling large interaction networks, given the significant level of uncertainties in large biomolecular systems and the high-throughput nature of the task. Since only a fraction of protein structures in interactome are determined experimentally, protein docking approaches are increasingly focusing on modeled proteins. Current rapid advancement of template-based modeling of protein-protein complexes is following a long standing trend in structure prediction of individual proteins. Protein-protein templates are already available for almost all interactions of structurally characterized proteins, and about one third of such templates are likely correct.

Spotlight: assembly of protein complexes by integrating graph clustering methods

As is generally assumed, clusters in protein-protein interaction (PPI) networks perform specific, crucial functions in biological systems. Various network community detection methods have been developed to exploit PPI networks in order to identify protein complexes and functional modules. Due to the potential role of various regulatory modes in biological networks, a single method may just apply a single graph property and neglect communities highlighted by other network properties. This work presents a novel integration method to capture protein modules/protein complexes by multiple network features detected by different algorithms. The integration method is further implemented in a web-based platform with a highly effective interactive network analyzer. Conventionally adopted methods with different perspectives on network community detection (e.g., CPM, FastGreedy, HUNTER, MCL, LE, SpinGlass, and WalkTrap) are also executed simultaneously. Analytical results indicate that the proposed method performs better than the conventional ones. The proposed approach can capture the transcription and RNA splicing machineries from the yeast protein network. Meanwhile, proteins that are highly associated with each other, yet not described in both machineries are also identified. In sum, a protein that is closely connected to components of a known module or a complex in the network view implies the functional association among them. Importantly, our method can detect these unique network features, thus facilitating efforts to discover unknown components of functional modules/protein complexes.

AVAILABILITY

Spotlight is freely accessible at http://hub.iis.sinica.edu.tw/spotlight. Video clips for a quick view of usage are available in the website online help page.

Toward a three-dimensional view of protein networks between species

General principles governing biomolecular interactions between species are expected to differ significantly from known principles governing the interactions within species, yet these principles remain poorly understood at the systems level. A key reason for this knowledge gap is the lack of a detailed three-dimensional (3D), atomistic view of biomolecular interaction networks between species. Recent progress in structural biology, systems biology, and computational biology has enabled accurate and large-scale construction of 3D structural models of nodes and edges for protein–protein interaction networks within and between species. The resulting within- and between-species structural interaction networks have provided new biophysical, functional, and evolutionary insights into species interactions and infectious disease. Here, we review the nascent field of between-species structural systems biology, focusing on interactions between host and pathogens such as viruses.

A survey of computational methods for protein complex prediction from protein interaction networks

Complexes of physically interacting proteins are one of the fundamental functional units responsible for driving key biological mechanisms within the cell. Their identification is therefore necessary to understand not only complex formation but also the higher level organization of the cell. With the advent of "high-throughput" techniques in molecular biology, significant amount of physical interaction data has been cataloged from organisms such as yeast, which has in turn fueled computational approaches to systematically mine complexes from the network of physical interactions among proteins (PPI network). In this survey, we review, classify and evaluate some of the key computational methods developed till date for the identification of protein complexes from PPI networks. We present two insightful taxonomies that reflect how these methods have evolved over the years toward improving automated complex prediction. We also discuss some open challenges facing accurate reconstruction of complexes, the crucial ones being the presence of high proportion of errors and noise in current high-throughput datasets and some key aspects overlooked by current complex detection methods. We hope this review will not only help to condense the history of computational complex detection for easy reference but also provide valuable insights to drive further research in this area.

Computational structural analysis of protein interactions and networks

Protein interactions have been at the focus of computational biology in recent years. In particular, interest has come from two different communities--structural and systems biology. Here, we will discuss key systems and structural biology methods that have been used for analysis and prediction of protein-protein interactions and the insight these approaches have provided on the nature and organization of protein-protein interactions inside cells.

Detection of a rare BCR-ABL tyrosine kinase fusion protein in H929 multiple myeloma cells using immunoprecipitation (IP)-tandem mass spectrometry (MS/MS)

Hypothesis directed proteomics offers higher throughput over global analyses. We show that immunoprecipitation (IP)-tandem mass spectrometry (LC-MS/MS) in H929 multiple myeloma (MM) cancer cells led to the discovery of a rare and unexpected BCR-ABL fusion, informing a therapeutic intervention using imatinib (Gleevec). BCR-ABL is the driving mutation in chronic myeloid leukemia (CML) and is uncommon to other cancers. Three different IP-MS experiments central to cell signaling pathways were sufficient to discover a BCR-ABL fusion in H929 cells: phosphotyrosine (pY) peptide IP, p85 regulatory subunit of phosphoinositide-3-kinase (PI3K) IP, and the GRB2 adaptor IP. The pY peptides inform tyrosine kinase activity, p85 IP informs the activating adaptors and receptor tyrosine kinases (RTKs) involved in AKT activation and GRB2 IP identifies RTKs and adaptors leading to ERK activation. Integration of the bait-prey data from the three separate experiments identified the BCR-ABL protein complex, which was confirmed by biochemistry, cytogenetic methods, and DNA sequencing revealed the e14a2 fusion transcript. The tyrosine phosphatase SHP2 and the GAB2 adaptor protein, important for MAPK signaling, were common to all three IP-MS experiments. The comparative treatment of tyrosine kinase inhibitor (TKI) drugs revealed only imatinib, the standard of care in CML, was inhibitory to BCR-ABL leading to down-regulation of pERK and pS6K and inhibiting cell proliferation. These data suggest a model for directed proteomics from patient tumor samples for selecting the appropriate TKI drug(s) based on IP and LC-MS/MS. The data also suggest that MM patients, in addition to CML patients, may benefit from BCR-ABL diagnostic screening.

Molecular dynamics simulations of hsp90 with an eye to inhibitor design

Proteins carry out their functions through interactions with different partners. Dynamic conformational switching among different structural sub-states favors the adaptation to the shapes of the different partners. Such conformational changes can be determined by diverse biochemical factors, such as ligand-binding. Atomic level investigations of the mechanisms that underlie functional dynamics may provide new opportunities for the discovery of leads that target disease-related proteins. In this review, we report our views and approaches on the development of novel and accurate physical-chemistry-based models for the characterization of the salient aspects of the ligand-regulated dynamics of Hsp90, and on the exploitation of such new knowledge for the rational discovery of inhibitors of the chaperone.

Coarse-grained simulations of protein-protein association: an energy landscape perspective

Understanding protein-protein association is crucial in revealing the molecular basis of many biological processes. Here, we describe a theoretical simulation pipeline to study protein-protein association from an energy landscape perspective. First, a coarse-grained model is implemented and its applications are demonstrated via molecular dynamics simulations for several protein complexes. Second, an enhanced search method is used to efficiently sample a broad range of protein conformations. Third, multiple conformations are identified and clustered from simulation data and further projected on a three-dimensional globe specifying protein orientations and interacting energies. Results from several complexes indicate that the crystal-like conformation is favorable on the energy landscape even if the landscape is relatively rugged with metastable conformations. A closer examination on molecular forces shows that the formation of associated protein complexes can be primarily electrostatics-driven, hydrophobics-driven, or a combination of both in stabilizing specific binding interfaces. Taken together, these results suggest that the coarse-grained simulations and analyses provide an alternative toolset to study protein-protein association occurring in functional biomolecular complexes.