Functional evaluation of domain-domain interactions and human protein interaction networks

MOTIVATION: Large amounts of protein and domain interaction data are being produced by experimental high-throughput techniques and computational approaches. To gain insight into the value of the provided data, we used our new similarity measure based on the Gene Ontology (GO) to evaluate the molecular functions and biological processes of interacting proteins or domains. The applied measure particularly addresses the frequent annotation of proteins or domains with multiple GO terms. RESULTS: Using our similarity measure, we compare predicted domain-domain and human protein-protein interactions with experimentally derived interactions. The results show that our similarity measure is of significant benefit in quality assessment and confidence ranking of domain and protein networks. We also derive useful confidence score thresholds for dividing domain interaction predictions into subsets of low and high confidence. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Evolutionary conservation of domain-domain interactions

Background

Recently, there has been much interest in relating domain-domain interactions (DDIs) to protein-protein interactions (PPIs) and vice versa, in an attempt to understand the molecular basis of PPIs.

Results

Here we map structurally derived DDIs onto the cellular PPI networks of different organisms and demonstrate that there is a catalog of domain pairs that is used to mediate various interactions in the cell. We show that these DDIs occur frequently in protein complexes and that homotypic interactions (of a domain with itself) are abundant. A comparison of the repertoires of DDIs in the networks of Escherichia coli, Saccharomyces cerevisiae, Caenorhabditis elegans, Drosophila melanogaster, and Homo sapiens shows that many DDIs are evolutionarily conserved.

Conclusion

Our results indicate that different organisms use the same 'building blocks' for PPIs, suggesting that the functionality of many domain pairs in mediating protein interactions is maintained in evolution.     

Evolutionary conservation of domain-domain interactions

Background  

Recently, there has been much interest in relating domain-domain interactions (DDIs) to protein-protein interactions (PPIs) and vice versa, in an attempt to understand the molecular basis of PPIs.     

Oligomeric protein structure networks: insights into protein-protein interactions

Background  

Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the principles of protein-protein interactions. In this study, oligomeric protein structures are viewed from a network perspective to obtain new insights into protein association. Structure graphs of proteins have been constructed from a non-redundant set of protein oligomer crystal structures by considering amino acid residues as nodes and the edges are based on the strength of the non-covalent interactions between the residues. The analysis of such networks has been carried out in terms of amino acid clusters and hubs (highly connected residues) with special emphasis to protein interfaces.     

Co-evolutionary analysis of domains in interacting proteins reveals insights into domain-domain interactions mediating protein-protein interactions

Recent advances in functional genomics have helped generate large-scale high-throughput protein interaction data. Such networks, though extremely valuable towards molecular level understanding of cells, do not provide any direct information about the regions (domains) in the proteins that mediate the interaction. Here, we performed co-evolutionary analysis of domains in interacting proteins in order to understand the degree of co-evolution of interacting and non-interacting domains. Using a combination of sequence and structural analysis, we analyzed protein-protein interactions in F1-ATPase, Sec23p/Sec24p, DNA-directed RNA polymerase and nuclear pore complexes, and found that interacting domain pair(s) for a given interaction exhibits higher level of co-evolution than the non-interacting domain pairs. Motivated by this finding, we developed a computational method to test the generality of the observed trend, and to predict large-scale domain-domain interactions. Given a protein-protein interaction, the proposed method predicts the domain pair(s) that is most likely to mediate the protein interaction. We applied this method on the yeast interactome to predict domain-domain interactions, and used known domain-domain interactions found in PDB crystal structures to validate our predictions. Our results show that the prediction accuracy of the proposed method is statistically significant. Comparison of our prediction results with those from two other methods reveals that only a fraction of predictions are shared by all the three methods, indicating that the proposed method can detect known interactions missed by other methods. We believe that the proposed method can be used with other methods to help identify previously unrecognized domain-domain interactions on a genome scale, and could potentially help reduce the search space for identifying interaction sites.     

Predicting domain-domain interactions using a parsimony approach

We propose a novel approach to predict domain-domain interactions from a protein-protein interaction network. In our method we apply a parsimony-driven explanation of the network, where the domain interactions are inferred using linear programming optimization, and false positives in the protein network are handled by a probabilistic construction. This method outperforms previous approaches by a considerable margin. The results indicate that the parsimony principle provides a correct approach for detecting domain-domain contacts.     

PPIDomainMiner: Inferring domain-domain interactions from multiple sources of protein-protein interactions

Many biological processes are mediated by protein-protein interactions (PPIs). Because protein domains are the building blocks of proteins, PPIs likely rely on domain-domain interactions (DDIs). Several attempts exist to infer DDIs from PPI networks but the produced datasets are heterogeneous and sometimes not accessible, while the PPI interactome data keeps growing.We describe a new computational approach called “PPIDM” (Protein-Protein Interactions Domain Miner) for inferring DDIs using multiple sources of PPIs. The approach is an extension of our previously described “CODAC” (Computational Discovery of Direct Associations using Common neighbors) method for inferring new edges in a tripartite graph. The PPIDM method has been applied to seven widely used PPI resources, using as “Gold-Standard” a set of DDIs extracted from 3D structural databases. Overall, PPIDM has produced a dataset of 84,552 non-redundant DDIs. Statistical significance (p-value) is calculated for each source of PPI and used to classify the PPIDM DDIs in Gold (9,175 DDIs), Silver (24,934 DDIs) and Bronze (50,443 DDIs) categories. Dataset comparison reveals that PPIDM has inferred from the 2017 releases of PPI sources about 46% of the DDIs present in the 2020 release of the 3did database, not counting the DDIs present in the Gold-Standard. The PPIDM dataset contains 10,229 DDIs that are consistent with more than 13,300 PPIs extracted from the IMEx database, and nearly 23,300 DDIs (27.5%) that are consistent with more than 214,000 human PPIs extracted from the STRING database. Examples of newly inferred DDIs covering more than 10 PPIs in the IMEx database are provided.Further exploitation of the PPIDM DDI reservoir includes the inventory of possible partners of a protein of interest and characterization of protein interactions at the domain level in combination with other methods. The result is publicly available at http://ppidm.loria.fr/.     

Inferring domain-domain interactions from protein-protein interactions in the complex network conformation

Background

As protein domains are functional and structural units of proteins, a large proportion of protein-protein interactions (PPIs) are achieved by domain-domain interactions (DDIs), many computational efforts have been made to identify DDIs from experimental PPIs since high throughput technologies have produced a large number of PPIs for different species. These methods can be separated into two categories: deterministic and probabilistic. In deterministic methods, parsimony assumption has been utilized. Parsimony principle has been widely used in computational biology as the evolution of the nature is considered as a continuous optimization process. In the context of identifying DDIs, parsimony methods try to find a minimal set of DDIs that can explain the observed PPIs. This category of methods are promising since they can be formulated and solved easily. Besides, researches have shown that they can detect specific DDIs, which is often hard for many probabilistic methods. We notice that existing methods just view PPI networks as simply assembled by single interactions, but there is now ample evidence that PPI networks should be considered in a global (systematic) point of view for it exhibits general properties of complex networks, such as 'scale-free' and 'small-world'.

Results

In this work, we integrate this global point of view into the parsimony-based model. Particularly, prior knowledge is extracted from these global properties by plausible reasoning and then taken as input. We investigate the role of the added information extensively through numerical experiments. Results show that the proposed method has improved performance, which confirms the biological meanings of the extracted prior knowledge.

Conclusions

This work provides us some clues for using these properties of complex networks in computational models and to some extent reveals the biological meanings underlying these general network properties.

     

Protein domain annotation with predicted domain-domain interaction networks

This paper presents a framework for annotating protein domains with predicted domain-domain interaction networks. Specially, domain annotation is formalized as a multi-class classification problem in this work. The numerical experiments on InterPro domains show promising results, which proves the efficiency of our proposed methods.     

An integrated approach to the prediction of domain-domain interactions

Background  

The development of high-throughput technologies has produced several large scale protein interaction data sets for multiple species, and significant efforts have been made to analyze the data sets in order to understand protein activities. Considering that the basic units of protein interactions are domain interactions, it is crucial to understand protein interactions at the level of the domains. The availability of many diverse biological data sets provides an opportunity to discover the underlying domain interactions within protein interactions through an integration of these biological data sets.     

Domain structure and domain-domain interactions of recombinant tissue plasminogen activator

The melting of recombinant tissue plasminogen activator (rtPA) has been investigated by differential scanning calorimetry and fluorescence spectroscopy. At neutral pH, rtPA melts with only partial reversibility in a single sharp peak that can be deconvoluted into four transitions. By contrast, at acidic pH the melting process is spread over a broad range of temperature and is highly reversible. Under these conditions five transitions are resolved by deconvolution analysis. Additional measurements in 6 M guanidinium chloride reveal a sixth transition representing an extremely stable domain. Comparison of the melting curves of several fragments with those of the parent protein allowed all of the transitions to be assigned. The results indicate that rtPA is comprised of six independently folded domains. Two of these domains correspond to the two kringle modules whose thermodynamic properties are similar to those of the kringles in plasminogen. Two additional domains are formed by the epidermal growth factor (EGF)-like and finger modules, the latter of which is extremely stable, requiring the presence of a chemical denaturant for its melting to be observed. The serine protease module contains two more domains which at neutral pH melt cooperatively in a single transition but at low pH melt independently, accounting for the greater number of transitions observed there. Measurements with a 50-kDa fragment lacking the C-terminal half of the serine protease module and with a variant lacking the finger and EGF domains indicate that the serine protease domains interact strongly with and are stabilized by the finger and/or EGF domains in the intact protein. This interaction between domains located at opposite ends of the rtPA molecule produces a more compact structure. A better understanding of such interactions may enhance efforts to engineer plasminogen activators with improved thrombolytic properties.     

Energetics of domain-domain interactions and entropy driven association of beta-crystallins

Beta-crystallins are major protein constituents of the mammalian lens, where their stability and association into higher order complexes are critical for lens clarity and refraction. They undergo modification as the lens ages, including cleavage of their terminal extensions. The energetics of betaA3- and betaB2-crystallin association was studied using site-directed mutagenesis and analytical ultracentrifugation. Recombinant (r) murine wild type betaA3- and betaB2-crystallins were modified by removal of either the N-terminal extension of betaA3 (rbetaA3Ntr) or betaB2 (rbetaB2Ntr), or both the N- and C-terminal extensions of betaB2 (rbetaB2NCtr). The proteins were expressed in Sf9 insect cells or Escherichia coli and purified by gel-filtration and ion-exchange chromatography. All beta-crystallins studied demonstrated fast reversible monomer-dimer equilibria over the temperature range studied (5-35 degrees C) with a tendency to form tighter dimers at higher temperatures. The N-terminal deletion of rbetaA3 (rbetaA3Ntr) significantly increases the enthalpy (+10.9 kcal/mol) and entropy (+40.7 cal/deg mol) of binding relative to unmodified protein. Removal of both N- and C-terminal extensions of rbetaB2 also increases these parameters but to a lesser degree. Deletion of the betaB2-crystallin N-terminal extension alone (rbetaB2Ntr) gave almost no change relative to rbetaB2. The resultant net negative changes in the binding energy suggest that betaAlpha3- and betaB2-crystallin association is entropically driven. The thermodynamic consequences of the loss of betaAlpha3-crystallin terminal extensions by in vivo proteolytic processing could increase their tendency to associate and so promote the formation of higher order associates in the aging and cataractous lens.     

Mining protein networks for synthetic genetic interactions

Background  

The local connectivity and global position of a protein in a protein interaction network are known to correlate with some of its functional properties, including its essentiality or dispensability. It is therefore of interest to extend this observation and examine whether network properties of two proteins considered simultaneously can determine their joint dispensability, i.e., their propensity for synthetic sick/lethal interaction. Accordingly, we examine the predictive power of protein interaction networks for synthetic genetic interaction in Saccharomyces cerevisiae, an organism in which high confidence protein interaction networks are available and synthetic sick/lethal gene pairs have been extensively identified.     

Decomposing PPI networks for complex discovery

Background

Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput protein-protein interactions (PPI), many algorithms have been proposed to discover protein complexes from PPI networks. However, existing algorithms generally do not take into consideration the fact that not all the interactions in a PPI network take place at the same time. As a result, predicted complexes often contain many spuriously included proteins, precluding them from matching true complexes.

Results

We propose two methods to tackle this problem: (1) The localization GO term decomposition method: We utilize cellular component Gene Ontology (GO) terms to decompose PPI networks into several smaller networks such that the proteins in each decomposed network are annotated with the same cellular component GO term. (2) The hub removal method: This method is based on the observation that hub proteins are more likely to fuse clusters that correspond to different complexes. To avoid this, we remove hub proteins from PPI networks, and then apply a complex discovery algorithm on the remaining PPI network. The removed hub proteins are added back to the generated clusters afterwards. We tested the two methods on the yeast PPI network downloaded from BioGRID. Our results show that these methods can improve the performance of several complex discovery algorithms significantly. Further improvement in performance is achieved when we apply them in tandem.

Conclusions

The performance of complex discovery algorithms is hindered by the fact that not all the interactions in a PPI network take place at the same time. We tackle this problem by using localization GO terms or hubs to decompose a PPI network before complex discovery, which achieves considerable improvement.

     

Impact of intra-subunit domain-domain interactions on creatine kinase activity and stability

Creatine kinase (CK) is a key enzyme in vertebrate excitable tissues. In this research, five conserved residues located on the intra-subunit domain-domain interface were mutated to explore their role in the activity and structural stability of CK. The mutations of Val72 and Gly73 decreased both the activity and stability of CK. The mutations of Cys74 and Val75, which had no significant effect on CK activity and structure, gradually decreased the stability and reactivation of CK. Our results suggested that the mutations might modify the correct positioning of the loop contributing to domain-domain interactions, and result in decreased stability against denaturation.     

A comparison of SCOP and CATH with respect to domain-domain interactions

The analysis and prediction of protein-protein interaction sites from structural data are restricted by the limited availability of structural complexes that represent the complete protein-protein interaction space. The domain classification schemes CATH and SCOP are normally used independently in the analysis and prediction of protein domain-domain interactions. In this article, the effect of different domain classification schemes on the number and type of domain-domain interactions observed in structural data is systematically evaluated for the SCOP and CATH hierarchies. Although there is a large overlap in domain assignments between SCOP and CATH, 23.6% of CATH interfaces had no SCOP equivalent and 37.3% of SCOP interfaces had no CATH equivalent in a nonredundant set. Therefore, combining both classifications gives an increase of between 23.6 and 37.3% in domain-domain interfaces. It is suggested that if possible, both domain classification schemes should be used together, but if only one is selected, SCOP provides better coverage than CATH. Employing both SCOP and CATH reduces the false negative rate of predictive methods, which employ homology matching to structural data to predict protein-protein interaction by an estimated 6.5%.     

Docking interactions in protein kinase and phosphatase networks

To achieve high biological specificity, protein kinases and phosphatases often recognize their targets through interactions that occur outside of the active site. Although the role of modular protein-protein interaction domains in kinase and phosphatase signaling has been well characterized, it is becoming clear that many kinases and phosphatases utilize docking interactions - recognition of a short peptide motif in target partners by a groove on the catalytic domain that is separate from the active site. Docking is particularly prevalent in serine/threonine kinases and phosphatases, and is a versatile organizational tool for building complex signaling networks; it confers a high degree of specificity and, in some cases, allosteric regulation.     

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.     

Evolution and dynamics of protein interactions and networks

The central role of protein-protein interactions (PPIs) in biology has stimulated colossal efforts to identify thousands of them in several organisms. The resulting PPI maps are commonly represented as graphs, where nodes denote proteins and edges represent physical interactions. However, the methods used to generate PPI data on a large scale do not readily allow one to discriminate features such as interaction strength (affinity), type (protein-protein or protein-peptide interaction) or spatiotemporal existence (where and when the proteins are present and interact). Yet, in recent years, a number of studies have tackled these limitations by projecting additional information onto PPIs, revealing novel properties in terms of their evolution and dynamics. In this review we examine these properties both at the binary interaction level and at the network level. We suggest that the diverse and sometimes contradictory results described by different research groups are mostly due to incomplete data coverage and limited data types. Finally, we discuss recently developed methods that will improve this picture in the future.