Fully automated protein complex prediction based on topological similarity and community structure

To understand the function of protein complexes and their association with biological processes, a lot of studies have been done towards analyzing the protein-protein interaction (PPI) networks. However, the advancement in high-throughput technology has resulted in a humongous amount of data for analysis. Moreover, high level of noise, sparseness, and skewness in degree distribution of PPI networks limits the performance of many clustering algorithms and further analysis of their interactions.In addressing and solving these problems we present a novel random walk based algorithm that converts the incomplete and binary PPI network into a protein-protein topological similarity matrix (PP-TS matrix). We believe that if two proteins share some high-order topological similarities they are likely to be interacting with each other. Using the obtained PP-TS matrix, we constructed and used weighted networks to further study and analyze the interaction among proteins. Specifically, we applied a fully automated community structure finding algorithm (Auto-HQcut) on the obtained weighted network to cluster protein complexes. We then analyzed the protein complexes for significance in biological processes. To help visualize and analyze these protein complexes we also developed an interface that displays the resulting complexes as well as the characteristics associated with each complex.Applying our approach to a yeast protein-protein interaction network, we found that the predicted protein-protein interaction pairs with high topological similarities have more significant biological relevance than the original protein-protein interactions pairs. When we compared our PPI network reconstruction algorithm with other existing algorithms using gene ontology and gene co-expression, our algorithm produced the highest similarity scores. Also, our predicted protein complexes showed higher accuracy measure compared to the other protein complex predictions.     

Characterization of multiprotein complexes of the Borrelia burgdorferi outer membrane vesicles

Among bacterial cell envelopes, the Borrelia burgdorferi outer membrane (OM) is structurally unique in that the identities of many protein complexes remain unknown; however, their characterization is the first step toward our understanding of membrane protein interactions and potential functions. Here, we used two-dimensional blue native/SDS-PAGE/mass spectrometric analysis for a global characterization of protein-protein interactions as well as to identify protein complexes in OM vesicles isolated from multiple infectious sensu stricto isolates of B. burgdorferi. Although we uncovered the existence of at least 10 distinct OM complexes harboring several unique subunits, the complexome is dominated by the frequent occurrence of a limited diversity of membrane proteins, most notably P13, outer surface protein (Osp) A, -B, -C, and -D and Lp6.6. The occurrence of these complexes and specificity of subunit interaction were further supported by independent two-dimensional immunoblotting and coimmunoprecipitation assays as well as by mutagenesis studies, where targeted depletion of a subunit member (P66) selectively abolished a specific complex. Although a comparable profile of the OM complexome was detected in two major infectious isolates, such as B31 and 297, certain complexes are likely to occur in an isolate-specific manner. Further assessment of protein complexes in multiple Osp-deficient isolates showed loss of several protein complexes but revealed the existence of additional complex/subunits that are undetectable in wild-type cells. Together, these observations uncovered borrelial antigens involved in membrane protein interactions. The study also suggests that the assembly process of OM complexes is specific and that the core or stabilizing subunits vary between complexes. Further characterization of these protein complexes including elucidation of their biological significance may shed new light on the mechanism of pathogen persistence and the development of preventative measures against the infection.     

The mitochondrial complexome of Arabidopsis thaliana

Mitochondria are central to cellular metabolism and energy conversion. In plants they also enable photosynthesis through additional components and functional flexibility. A majority of those processes relies on the assembly of individual proteins to larger protein complexes, some of which operate as large molecular machines. There has been a strong interest in the makeup and function of mitochondrial protein complexes and protein–protein interactions in plants, but the experimental approaches used typically suffer from selectivity or bias. Here, we present a complexome profiling analysis for leaf mitochondria of the model plant Arabidopsis thaliana for the systematic characterization of protein assemblies. Purified organelle extracts were separated by 1D Blue native (BN) PAGE, a resulting gel lane was dissected into 70 slices (complexome fractions) and proteins in each slice were identified by label free quantitative shot‐gun proteomics. Overall, 1359 unique proteins were identified, which were, on average, present in 17 complexome fractions each. Quantitative profiles of proteins along the BN gel lane were aligned by similarity, allowing us to visualize protein assemblies. The data allow re‐annotating the subunit compositions of OXPHOS complexes, identifying assembly intermediates of OXPHOS complexes and assemblies of alternative respiratory oxidoreductases. Several protein complexes were discovered that have not yet been reported in plants, such as a 530 kDa Tat complex, 460 and 1000 kDa SAM complexes, a calcium ion uniporter complex (150 kDa) and several PPR protein complexes. We have set up a tailored online resource ( https://complexomemap.de/at_mito_leaves ) to deposit the data and to allow straightforward access and custom data analyses.     

A unified representation of multiprotein complex data for modeling interaction networks

The protein interaction network presents one perspective for understanding cellular processes. Recent experiments employing high-throughput mass spectrometric characterizations have resulted in large data sets of physiologically relevant multiprotein complexes. We present a unified representation of such data sets based on an underlying bipartite graph model that is an advance over existing models of the network. Our unified representation allows for weighting of connections between proteins shared in more than one complex, as well as addressing the higher level organization that occurs when the network is viewed as consisting of protein complexes that share components. This representation also allows for the application of the rigorous MinMaxCut graph clustering algorithm for the determination of relevant protein modules in the networks. Statistically significant annotations of clusters in the protein-protein and complex-complex networks using terms from the Gene Ontology indicate that this method will be useful for posing hypotheses about uncharacterized components of protein complexes or uncharacterized relationships between protein complexes.     

Using indirect protein-protein interactions for protein complex prediction

Protein complexes are fundamental for understanding principles of cellular organizations. As the sizes of protein-protein interaction (PPI) networks are increasing, accurate and fast protein complex prediction from these PPI networks can serve as a guide for biological experiments to discover novel protein complexes. However, it is not easy to predict protein complexes from PPI networks, especially in situations where the PPI network is noisy and still incomplete. Here, we study the use of indirect interactions between level-2 neighbors (level-2 interactions) for protein complex prediction. We know from previous work that proteins which do not interact but share interaction partners (level-2 neighbors) often share biological functions. We have proposed a method in which all direct and indirect interactions are first weighted using topological weight (FS-Weight), which estimates the strength of functional association. Interactions with low weight are removed from the network, while level-2 interactions with high weight are introduced into the interaction network. Existing clustering algorithms can then be applied to this modified network. We have also proposed a novel algorithm that searches for cliques in the modified network, and merge cliques to form clusters using a "partial clique merging" method. Experiments show that (1) the use of indirect interactions and topological weight to augment protein-protein interactions can be used to improve the precision of clusters predicted by various existing clustering algorithms; and (2) our complex-finding algorithm performs very well on interaction networks modified in this way. Since no other information except the original PPI network is used, our approach would be very useful for protein complex prediction, especially for prediction of novel protein complexes.     

Composite structural motifs of binding sites for delineating biological functions of proteins

Most biological processes are described as a series of interactions between proteins and other molecules, and interactions are in turn described in terms of atomic structures. To annotate protein functions as sets of interaction states at atomic resolution, and thereby to better understand the relation between protein interactions and biological functions, we conducted exhaustive all-against-all atomic structure comparisons of all known binding sites for ligands including small molecules, proteins and nucleic acids, and identified recurring elementary motifs. By integrating the elementary motifs associated with each subunit, we defined composite motifs that represent context-dependent combinations of elementary motifs. It is demonstrated that function similarity can be better inferred from composite motif similarity compared to the similarity of protein sequences or of individual binding sites. By integrating the composite motifs associated with each protein function, we define meta-composite motifs each of which is regarded as a time-independent diagrammatic representation of a biological process. It is shown that meta-composite motifs provide richer annotations of biological processes than sequence clusters. The present results serve as a basis for bridging atomic structures to higher-order biological phenomena by classification and integration of binding site structures.     

Unveiling protein functions through the dynamics of the interaction network

Protein interaction networks have become a tool to study biological processes, either for predicting molecular functions or for designing proper new drugs to regulate the main biological interactions. Furthermore, such networks are known to be organized in sub-networks of proteins contributing to the same cellular function. However, the protein function prediction is not accurate and each protein has traditionally been assigned to only one function by the network formalism. By considering the network of the physical interactions between proteins of the yeast together with a manual and single functional classification scheme, we introduce a method able to reveal important information on protein function, at both micro- and macro-scale. In particular, the inspection of the properties of oscillatory dynamics on top of the protein interaction network leads to the identification of misclassification problems in protein function assignments, as well as to unveil correct identification of protein functions. We also demonstrate that our approach can give a network representation of the meta-organization of biological processes by unraveling the interactions between different functional classes.     

Clustering by common friends finds locally significant proteins mediating modules

MOTIVATION: Much research has been dedicated to large-scale protein interaction networks including the analysis of scale-free topologies, network modules and the relation of domain-domain to protein-protein interaction networks. Identifying locally significant proteins that mediate the function of modules is still an open problem. Method: We use a layered clustering algorithm for interaction networks, which groups proteins by the similarity of their direct neighborhoods. We identify locally significant proteins, called mediators, which link different clusters. We apply the algorithm to a yeast network. RESULTS: Clusters and mediators are organized in hierarchies, where clusters are mediated by and act as mediators for other clusters. We compare the clusters and mediators to known yeast complexes and find agreement with precision of 71% and recall of 61%. We analyzed the functions, processes and locations of mediators and clusters. We found that 55% of mediators to a cluster are enriched with a set of diverse processes and locations, often related to translocation of biomolecules. Additionally, 82% of clusters are enriched with one or more functions. The important role of mediators is further corroborated by a comparatively higher degree of conservation across genomes. We illustrate the above findings with an example of membrane protein translocation from the cytoplasm to the inner nuclear membrane. AVAILABILITY: All software is freely available under Supplementary information.     

TRP1 interacting PDZ-domain protein GIPC forms oligomers and is localized to intracellular vesicles in human melanocytes

PDZ proteins coordinate assembly of protein complexes that participate in diverse biological processes. GIPC is a multifunctional PDZ protein that interacts with several soluble and membrane proteins. Unlike most PDZ proteins, GIPC contains single PDZ domain and the mechanisms by which GIPC mediates its actions remain unclear. We investigated the possibility that in lieu of multiple PDZ domains, GIPC forms multimers. Here, we demonstrate that GIPC can bind to itself and that the PDZ domain is involved in GIPC-GIPC interaction. Gel filtration, sucrose gradient centrifugation and chemical cross-linking showed that whereas bulk of cytosolic GIPC was present as monomer, oligomers with an estimated molecular mass corresponding to GIPC homotrimer were readily detectable in the membrane fraction. Modeling of GIPC PDZ domain showed feasibility of trimerization. Immunogold electron microscopy showed that GIPC is present in clusters near vesicles. Our data suggest that oligomers of GIPC mediate its functions in melanocytes.     

Analysis and network representation of hotspots in protein interfaces using minimum cut trees

We propose a novel approach to analyze and visualize residue contact networks of protein interfaces by graph‐based algorithms using a minimum cut tree (mincut tree). Edges in the network are weighted according to an energy function derived from knowledge‐based potentials. The mincut tree, which is constructed from the weighted residue network, simplifies and summarizes the complex structure of the contact network by an efficient and informative representation. This representation offers a comprehensible view of critical residues and facilitates the inspection of their organization. We observed, on a nonredundant data set of 38 protein complexes with experimental hotspots that the highest degree node in the mincut tree usually corresponds to an experimental hotspot. Further, hotspots are found in a few paths in the mincut tree. In addition, we examine the organization of hotspots (hot regions) using an iterative clustering algorithm on two different case studies. We find that distinct hot regions are located on specific sites of the mincut tree and some critical residues hold these clusters together. Clustering of the interface residues provides information about the relation of hot regions with each other. Our new approach is useful at the molecular level for both identification of critical paths in the protein interfaces and extraction of hot regions by clustering of the interface residues. Proteins 2010. © 2010 Wiley‐Liss, Inc.     

Localized network centrality and essentiality in the yeast–protein interaction network

It has been suggested that a close relationship exists between gene essentiality and network centrality in protein–protein interaction networks. However, recent studies have reported somewhat conflicting results on this relationship. In this study, we investigated whether essential proteins could be inferred from network centrality alone. In addition, we determined which centrality measures describe the essentiality well. For this analysis, we devised new local centrality measures based on several well‐known centrality measures to more precisely describe the connection between network topology and essentiality. We examined two recent yeast protein–protein interaction networks using 40 different centrality measures. We discovered a close relationship between the path‐based localized information centrality and gene essentiality, which suggested underlying topological features that represent essentiality. We propose that two important features of the localized information centrality (proper representation of environmental complexity and the consideration of local sub‐networks) are the key factors that reveal essentiality. In addition, a random forest classifier showed reasonable performance at classifying essential proteins. Finally, the results of clustering analysis using centrality measures indicate that some network clusters are closely related with both particular biological processes and essentiality, suggesting that functionally related proteins tend to share similar network properties.     

From proteomes to complexomes in the era of systems biology

Protein complexes carry out almost the entire signaling and functional processes in the cell. The protein complex complement of a cell, and its network of complex–complex interactions, is referred to here as the complexome. Computational methods to predict protein complexes from proteomics data, resulting in network representations of complexomes, have recently being developed. In addition, key advances have been made toward understanding the network and structural organization of complexomes. We review these bioinformatics advances, and their discovery‐potential, as well as the merits of integrating proteomics data with emerging methods in systems biology to study protein complex signaling. It is envisioned that improved integration of proteomics and systems biology, incorporating the dynamics of protein complexes in space and time, may lead to more predictive models of cell signaling networks for effective modulation.     

Protein complexes identification based on go attributed network embedding

Background

Identifying protein complexes from protein-protein interaction (PPI) network is one of the most important tasks in proteomics. Existing computational methods try to incorporate a variety of biological evidences to enhance the quality of predicted complexes. However, it is still a challenge to integrate different types of biological information into the complexes discovery process under a unified framework. Recently, attributed network embedding methods have be proved to be remarkably effective in generating vector representations for nodes in the network. In the transformed vector space, both the topological proximity and node attributed affinity between different nodes are preserved. Therefore, such attributed network embedding methods provide us a unified framework to integrate various biological evidences into the protein complexes identification process.

Results

In this article, we propose a new method called GANE to predict protein complexes based on Gene Ontology (GO) attributed network embedding. Firstly, it learns the vector representation for each protein from a GO attributed PPI network. Based on the pair-wise vector representation similarity, a weighted adjacency matrix is constructed. Secondly, it uses the clique mining method to generate candidate cores. Consequently, seed cores are obtained by ranking candidate cores based on their densities on the weighted adjacency matrix and removing redundant cores. For each seed core, its attachments are the proteins with correlation score that is larger than a given threshold. The combination of a seed core and its attachment proteins is reported as a predicted protein complex by the GANE algorithm. For performance evaluation, we compared GANE with six protein complex identification methods on five yeast PPI networks. Experimental results showes that GANE performs better than the competing algorithms in terms of different evaluation metrics.

Conclusions

GANE provides a framework that integrate many valuable and different biological information into the task of protein complex identification. The protein vector representation learned from our attributed PPI network can also be used in other tasks, such as PPI prediction and disease gene prediction.

     

Insights into protein-DNA interactions through structure network analysis

Protein-DNA interactions are crucial for many cellular processes. Now with the increased availability of structures of protein-DNA complexes, gaining deeper insights into the nature of protein-DNA interactions has become possible. Earlier, investigations have characterized the interface properties by considering pairwise interactions. However, the information communicated along the interfaces is rarely a pairwise phenomenon, and we feel that a global picture can be obtained by considering a protein-DNA complex as a network of noncovalently interacting systems. Furthermore, most of the earlier investigations have been carried out from the protein point of view (protein-centric), and the present network approach aims to combine both the protein-centric and the DNA-centric points of view. Part of the study involves the development of methodology to investigate protein-DNA graphs/networks with the development of key parameters. A network representation provides a holistic view of the interacting surface and has been reported here for the first time. The second part of the study involves the analyses of these graphs in terms of clusters of interacting residues and the identification of highly connected residues (hubs) along the protein-DNA interface. A predominance of deoxyribose-amino acid clusters in beta-sheet proteins, distinction of the interface clusters in helix-turn-helix, and the zipper-type proteins would not have been possible by conventional pairwise interaction analysis. Additionally, we propose a potential classification scheme for a set of protein-DNA complexes on the basis of the protein-DNA interface clusters. This provides a general idea of how the proteins interact with the different components of DNA in different complexes. Thus, we believe that the present graph-based method provides a deeper insight into the analysis of the protein-DNA recognition mechanisms by throwing more light on the nature and the specificity of these interactions.     

PPiClust: efficient clustering of 3D protein-protein interaction interfaces

The biological mechanisms through which proteins interact with one another are best revealed by studying the structural interfaces between interacting proteins. Protein-protein interfaces can be extracted from three-dimensional (3D) structural data of protein complexes and then clustered to derive biological insights. However, conventional protein interface clustering methods lack computational scalability and statistical support. In this work, we present a new method named "PPiClust" to systematically encode, cluster, and analyze similar 3D interface patterns in protein complexes efficiently. Experimental results showed that our method is effective in discovering visually consistent and statistically significant clusters of interfaces, and at the same time sufficiently time-efficient to be performed on a single computer. The interface clusters are also useful for uncovering the structural basis of protein interactions. Analysis of the resulting interface clusters revealed groups of structurally diverse proteins having similar interface patterns. We also found, in some of the interface clusters, the presence of well-known linear binding motifs which were noncontiguous in the primary sequences. These results suggest that PPiClust can discover not only statistically significant, but also biologically significant, protein interface clusters from protein complex structural data.     

Quantitative proteomics identified 3 oxidative phosphorylation genes with clinical prognostic significance in gastric cancer

The aim of the present study was to explore the underlying mechanisms involved in gastric cancer (GC) formation using data‐independent acquisition (DIA) quantitative proteomics analysis. We identified the differences in protein expression and related functions involved in biological metabolic processes in GC. Totally, 745 differentially expressed proteins (DEPs) were found in GC tissues vs. gastric normal tissues. Despite enormous complexity in the details of the underlying regulatory network, we find that clusters of proteins from the DEPs were mainly involved in 38 pathways. All of the identified DEPs involved in oxidative phosphorylation were down‐regulated. Moreover, GC possesses significantly altered biological metabolic processes, such as NADH dehydrogenase complex assembly and tricarboxylic acid cycle, which is mostly consistent with that in KEGG analysis. Furthermore the higher expression of UQCRQ, NDUFB7 and UQCRC2 were positively correlated with a better prognosis, implicating these proteins may as novel candidate diagnostic and prognostic biomarkers.