Computational prediction of residues that participate in protein-protein interactions is a difficult task, and state of the art methods have shown only limited success in this arena. One possible problem with these methods is that they try to predict interacting residues without incorporating information about the partner protein, although it is unclear how much partner information could enhance prediction performance. To address this issue, the two following comparisons are of crucial significance: (a) comparison between the predictability of inter-protein residue pairs, i.e., predicting exactly which residue pairs interact with each other given two protein sequences; this can be achieved by either combining conventional single-protein predictions or making predictions using a new model trained directly on the residue pairs, and the performance of these two approaches may be compared: (b) comparison between the predictability of the interacting residues in a single protein (irrespective of the partner residue or protein) from conventional methods and predictions converted from the pair-wise trained model. Using these two streams of training and validation procedures and employing similar two-stage neural networks, we showed that the models trained on pair-wise contacts outperformed the partner-unaware models in predicting both interacting pairs and interacting single-protein residues. Prediction performance decreased with the size of the conformational change upon complex formation; this trend is similar to docking, even though no structural information was used in our prediction. An example application that predicts two partner-specific interfaces of a protein was shown to be effective, highlighting the potential of the proposed approach. Finally, a preliminary attempt was made to score docking decoy poses using prediction of interacting residue pairs; this analysis produced an encouraging result.
Citation: Ahmad S, Mizuguchi K (2011) Partner-Aware Prediction of Interacting Residues in Protein-Protein Complexes from Sequence Data. PLoS ONE 6(12): e29104. https://doi.org/10.1371/journal.pone.0029104
Editor: Charlotte M. Deane, University Of Oxford, United Kingdom
Received: October 12, 2011; Accepted: November 21, 2011; Published: December 14, 2011
Copyright: © 2011 Ahmad, Mizuguchi. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This work has been supported by a grants-in-aid (kaken-hi #22500277) program of Japan Society for Promotion of Science of Japan to SA and a grant from the Industrial Technology Research Grant Program in 2007 from New Energy and Industrial Technology Development Organization of Japan to KM. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
Protein-protein interactions are crucial for almost all aspects of cellular dynamics in living systems , and an enormous amount of research has been conducted to reveal, understand and predict protein-protein interactions at species and cellular levels (e.g., ). Despite the central role of protein-protein interactions in the theme of life, a complete protein-protein interactome has not yet been deciphered, even for a small organism, and continuous efforts are being made to refine the available data . Solving the three-dimensional structure of a protein complex can provide a detailed understanding of a specific protein-protein interaction (e.g., , ), but this type of technology becomes inaccessible on a genomic scale. Pair-wise associations between proteins can be inferred much more rapidly from high-throughput experiments, such as yeast two hybrid assays or mass spectrometry , but they cannot provide insights into the detailed mechanisms involved in such interactions, which is essential for therapeutic or biotechnological interventions. Therefore, a large number of putative interactions remain uncharacterized due to this technological gap.
Many protein structures have been solved (or can be modeled accurately), and the structure of a complex can, in principle, be obtained by docking its constituents. However, protein-protein complexes are formed as a result of numerous interactions at tertiary and quaternary structure levels; therefore, the task of building a complex from these individual units represents a considerable challenge. Prediction of interacting regions between a pair of proteins is a step toward elucidating the final mode of interaction between the proteins. For this purpose, a sequence-based approach is likely to be more convenient and faster than structure-based methods because of the lower dimensionality of the input data and the abundant sequence information. The underlying principle behind this approach has been to identify a relationship between readily computable sequence features (e.g., residue type) and the quantities that characterize the interaction (e.g., residue contact or the change in the free energy of the association). Once a relationship has been established, novel interactions can be detected via these features. A number of studies have been performed attempting to model this relationship (e.g., , ). Researchers have also endeavored to distinguish physical interactions from random associations , transient interactions from obligatory complexes , crystal packing from oligomerization  and specificity from affinity and promiscuity .
Prediction-oriented studies generally address one of the two following problems: (a) given a set of proteins, to determine which pairs interact with each other and (b) given a single-protein sequence (or structure), to determine sequence (or structural) regions that would interact with any other protein. Both types of studies have relied on a variety of sequence, structural or other data sources, such as microarray data , protein structures , , , conservation of interaction sites , , clustering of conserved residues , co-evolution statistics  and codon usage . A variety of computational techniques have been employed to utilize this information, including neural networks , , , , , support vector machines , , , , , , , random forests  and Bayesian techniques , , , , .
In this study, we are concerned with the second problem, and we aim to predict interacting residues from sequence information alone. However, we intend to go beyond the current regime of predicting residues that would interact with any protein; instead, we aim to identify interacting residue pairs between two specific proteins. A more specific objective of the current study was to assess whether the performance of sequence-based prediction of interacting residues can be improved by training models on interacting residue pairs with knowledge of the interacting partner protein. To answer this question, we trained a two-stage neural network model on a data set composed of interacting residue pairs from known protein complexes; next, we trained a similar two-stage model on a data set of single residues extracted from the same data source (without using any pairing information). The performance of the models trained either on residue pairs or on single residues was compared by predicting both the interacting residue pairs and the interacting single residues. The results showed that the models trained on residue pairs outperformed those trained on single residues on both accounts. Similar to docking, the prediction performance was anti-correlated with the size of the conformational change that was induced upon complex formation.
Furthermore, we carried out a preliminary assessment regarding the possibility of using this method to predict multiple interfaces of a protein with different partners, and we obtained an encouraging result. We also made a preliminary attempt to use the proposed method as a scoring function for protein-protein docking, and we showed that our simple procedure was competitive against a more sophisticated structure-based approach.
The protein-protein docking benchmark data set (version 3.0) compiled by Hwang et al. , which is abbreviated DBD3.0 in this work, was used throughout this study. We chose this data set because it was systematically curated and included protein complexes (each consisting of a “ligand” and a “receptor”) for which the unbound structures of both the ligand and the receptor were available, thus allowing us to analyze our results in the context of conformational changes. Furthermore, the data set also provided pre-computed ranked decoy sets, and we utilized this resource to score the docking decoys (see below).
This data set contains 124 complexes, and we used only the bound structures for the current study. The authors constructed DBD3.0 such that no two complexes shared an identical set of families defined in Structural Classification of Proteins (SCOP)  (see  for details). Thus, the data set was non-redundant, but the redundancy was defined somewhat differently from the typical sequence-based prediction methods. We evaluated sequence-level redundancy using BLASTCLUST  and confirmed that no two complexes shared more than 30% sequence identity in both the ligand and the receptor chains, i.e., at least one protein in the pair was unique.
To achieve unbiased training and evaluation, we adopted the procedure described in Figure 1. In DBD3.0, a ligand (or receptor) may consist of more than one protein chain. Each chain was treated separately, but only the interactions between the ligand and receptor were considered (thus, interactions within the ligand or receptor chains were ignored). Data were pooled for all the chains from both the ligand and the receptor to produce a single performance metric for each complex. For example, if there were m1 and m2 residues in the two chains of a ligand and n1 and n2 residues in the two chains of a receptor, a total of (m1+m2)*(n1+n2) residue pairs were considered, and an attempt was made to classify them as either interacting or non-interacting. Likewise, a total of m1+m2+n1+n2 residues were considered in predicting the interacting residues in a single chain, and the results were pooled together.
For each of the 124 complexes, the data sets were prepared by pairing residues from the ligand and receptor chains for a pair-wise prediction (as shown in the second part of the illustration). Single-residue data were also prepared for the whole complex. However, the residues were not encoded as pairs; they were taken from individual chains and partner information was discarded, and the contact data for all the chains were pooled together to obtain whole-complex data. In one training cycle, the contact and feature data from all but one of the complexes were used for training, and the left-out complex data were then used to evaluate prediction performance. Performance scores were calculated for one complex in one training cycle. The obtained set of 124 scores was then averaged to obtain an overall performance score.
Interface residue definition
A pair of residues from different chains of proteins was labeled as belonging to the positive class (binding) if the distance between any atom of one residue and any atom of the other was less than or equal to 6.0 Å. This distance cutoff has been used in other studies . Contacts within multiple chains of a single ligand or a receptor were ignored, as illustrated in Figure 1.
As in our previous studies, we used propensity scores for single-residue contacts as a ratio between the relative number of that residue type in the interface and the relative number of residues of any type in the interface , . This definition was extended to pair-wise contacts in a similar way. Specifically, the interface propensity of a residue pair with indices i and j (where i and j have values from 1 to 20) is given by the following equation:where Ni refers to the number of residues of residue type i (e.g., Arg) and Nij(I) is the number of contacting residue pairs identified by indices i and j in the interface. Summation was performed over all the residue pair types.
The statistical significance of the overrepresentation of certain residue pairs was assessed using a chi-squared test comparing the observed and expected numbers of contacts for each residue pair. The observed number of contacts (Oij) was obtained for the entire set of proteins, and the expected number of contacts (Eij) between amino acids i and j in one protein complex was computed using the following equation:where No is the total number of observed contacts among all the residue pairs and the subscript i and j are used for ligand and receptor residues respectively. The expected number was computed for each complex separately, and the numbers were then added to obtain a final value. This expected number of contacts was compared with the observed number of contacts for each pair of residue types, and a chi-squared value was computed using the following formula:and compared with the values from the standard table with a single degree of freedom.
Interacting residue-pair predictions
Predictions were performed by identifying a trained model that could relate a set of sequence features from a pair of target residues and their sequence neighbors to their contact state (binding or non-binding, as defined above). The sequence feature set refers to (a) sparsely encoded sequence features, such as those used in classical works on secondary structure prediction ; (b) position-specific scoring matrix (PSSM)-based features that are similar to our previous studies ; and (c) a combination of (a) and (b). Sparsely encoded sequence features simply represent each amino acid by a 20-dimensional vector, in which all but one of the dimensions are set to zero and one dimension corresponding to that residue type is set to 1. On the other hand, PSSM-based encoding represents each residue by the log-odd frequency of occurrence of the 20 residue types in an alignment at the target residue position (alignment column). The PSSM was obtained by running 3 iterations of PSIBLAST  using the default parameters against the NCBI NR database. Typically, an m-residue window is used for PSSM encoded features, and an n-residue window is employed for a sparsely encoded residue, where m and n range from 0 to the maximum window size (7 residues in this study). The resulting m+n features from each residue at position i and j in two contacting chains were concatenated in both orders (i,j and j,i), which created two patterns for the neural network inputs with identical target outputs. Using the features in both orders allowed the neural network to automatically learn that the pattern vector was independent of the order of the residues in the pair. Accordingly, model performance was evaluated by making a prediction for each residue pair in both orders and using the average of the two as the final score. The target output for the neural network was set to 0 or 1, which corresponded to the negative and positive class labels as defined above. The neural networks returned a real number between 0 and 1, which was converted to a class label using the procedure described in the performance evaluation section.
In the first stage of prediction, 24 independent neural network models were trained and assessed by leave-one-out cross validation. The models were allowed to learn for a fixed number of cycles without using information from the protein that was left out. The prediction performance for each left-out protein was computed from a model trained in the absence of this protein, and the scores were averaged to obtain an overall performance score. The first stage neural network models differed from each other in terms of the following characteristics:
- Feature sets: Different window sizes were used for the sparse and PSSM-encoded environments of the residue pairs that ranged from 0 to 3 residue neighbors (n sequence neighbors from the N- and C- terminal position leads to a (2n+1) residue window, which results in values of 0 to 7). Because there were 5 such possibilities for each of the sparse and PSSM-encoded features, a total of 5×5 possible combinations remained. Of these remaining combinations, 1 (0 for PSSM and 0 for sparse encoding) was a featureless representation that was discarded; this left 24 independent models. Terminal positions where N- and C-terminal residues are not present and hence pattern vectors could not be created have been excluded from the training/validation cycle data sets.
- Negative data sampling: In each of the 24 models, training was performed by sampling negative data because negative class data (non interacting residue pairs) were approximately 500 times more prevalent than positive class data (interacting residue pairs). To overcome the training difficulties caused by this imbalance, only 2% (or 1,000, whichever was smaller) of the randomly selected negative data points were used for training. All the positive data points were retained. No sampling was performed for the cross-validation (blind) data, and the reported performance measures were based on the real data. The 2% residue-pair data corresponded to approximately 14% (square root of 0.02) of the data from each of the two interacting proteins; therefore, the single-protein training models sampled 14% of the negative data. Each of the 24 models was trained on different random samples, which allowed for noise cancelation between models in the stage 2 predictions.
In the second stage, the first stage predictions produced by the 24 neural networks were averaged to obtain the final prediction (see Figure 2).
Pair prediction to single-chain predictions
To convert a pair-wise prediction score to a conventional interface residue prediction in single proteins, pair-wise prediction was first performed as described above. For each residue in each protein, we next assigned the highest pair-wise score that involved that residue. Thus, all the residues in all the chains were assigned a real value score, which is analogous to a single-chain prediction score, and all performance parameters were computed from these scores.
Single-chain to pair-wise predictions for benchmarking
The currently available methods for predicting protein interaction sites return a single score for each residue in each protein chain, irrespective of its partner. To obtain a pair-wise prediction score that could be used in a comparison, we performed single-chain predictions for the individual chains and then calculated the pair-wise score of a residue pair by averaging the individual scores of the two residues in the pair.
All the prediction models were trained to return a real number between 0 and 1, and the desired class labels were binary (1 for interface residues and 0 for non-interface residues). The output real numbers were converted into a class prediction by selecting different thresholds (thereby changing the number of residues that were predicted to be in the interface), and performance was evaluated. At a given threshold, any correctly predicted interface residues were designated as true positives (and their counts were denoted TP), whereas any correctly predicted non-interface residues were designated as true negatives (TN). Similarly, false positives (FP) and false negatives (FN) were residues that were wrongly predicted to be in the positive or negative class, respectively. For each threshold, the sensitivity (also called recall), precision and specificity of the model were defined as follows:To consider both recall and precision, the F1-measure (the harmonic mean of precision and recall) was defined as follows:Because the balance between these scores changes with the threshold, a single performance measure was required to compare the performance of the various models. The two following measures are common: (i) the area under the receiver operating characteristic (ROC) curve, or AUC, where the ROC is a plot of the recall against (1-specificity), and this measure considers an entire range of threshold values; and (ii) a set of precision, recall and F1 at the best performing threshold, at which F1 takes the highest value. For most comparisons, we used the AUC as the main performance measure, and in some cases, we provide recall, precision and F1 scores as an additional reference in the supplementary materials.
In our leave-one-out scenario, all the performance scores were computed for each (left-out) protein complex and averaged (over 124 values) to obtain an overall estimate.
Results and Discussion
Propensity of pair-wise versus single-protein-residue preferences
Table 1 shows the propensity scores of the 10 most preferred and the 10 most excluded residue pairs in the protein-protein interface (Table S1 provides complete details). The graphical pairing propensities of all the combinations are shown in Figure 3. Because our primary goal was to provide a comparison between single-residue preferences and pairing preferences, the propensities computed for the single residues to be in the interface are shown in the plot as a reference. The following observations were made from these results:
Each plot corresponds to interface propensity of a residue with all of the 20 possible partner residues. Single residue propensity values for the target residue are shown by a horizontal dashed line. See Table 1 for comments and Table S1 for additional details.
- Several residues appeared to be highly preferred with one partner but highly excluded with another; e.g., Pro paired with Trp with a high propensity (2.3), but its pairing with Ala was one of the most excluded parings. Similarly, Phe paired with Tyr with a high propensity, but its pairing with Val was highly excluded from the interface. This observation justifies the pair-wise and partner-aware prediction that we aim to make.
- Some residues showed less specific contact preferences than others; e.g., Tyr had a high propensity to pair with several residues, such as Arg, Phe, and Trp, which suggests a general preference for Tyr to be in the interface. Tyr can easily accommodate itself in both the loop and the strand regions of antibody complementarity determining regions (CDRs). Together with its amphiphilic nature, this often results in over-representation of Tyr in CDRs . Although this reference addresses CDRs, similar interaction preferences of Tyr appeared in non-antibody complexes, as indicated in the results of this study.
- Hydrophobic residues are not always preferred in the interface; this is evident because some pairs, such as Met-Val and Ala-Val, were excluded from the interface. Apparently, this result is in contrast to the observation of predominantly hydrophobic interactions contributing to folding and intra-chain residue-pair contacts in proteins, well documented in previous studies (e.g., , ). However, this apparent discrepancy must be interpreted in the context of the current propensity values being derived from sequences and considering that they implicitly include the surface propensity of the residues. Because many hydrophobic residues lie in the buried regions of a protein, the absence of a high propensity for hydrophobic residues only implies that these residues may naturally prefer the protein core to a protein-protein interface. An exposed hydrophobic residue may become preferred in the interface, which is an issue that we did not examine because we were interested in the sequence determinants of the interface residues. However, the propensities of the single residues within the surface have been examined by other researchers and can thus be referred to for comparison .
- Electrostatic forces are also important because similarly charged Lys-Lys pairs were excluded, and oppositely charged Arg-Asp pairs were preferred. Interestingly, Arg did not appear in the excluded residue pair list except with a couple of partners with low statistical significance. On the other hand Lys did not always appear in the preferred list, which suggests that these residues play different roles, despite having identical charges. Arg has a higher propensity than Lys for the interface of protein-ligand and protein-nucleic acid complexes , . This may be attributed to a number of structural and chemical attributes of Arg in contrast to Lys. For example, Arg can form a larger number of hydrogen bonds than Lys. Arg also exhibits pseudo-aromatic behavior due to the planar nature of its π-electron system .
Despite a clear sign of recognition that is promoted by the individual residue pairs, interface regions cannot be identified by simply locating complementary residue pairs because there are so many possible combinations and because sequence and structural neighbors are likely to constrain the actual population of interface residue pairs. The best estimates of these biases can be made by trying to predict the interface and then examining the prediction performance obtained from various feature sets. Therefore, we used a range of sequence windows encoded by residue identities and the evolutionary profile of each position to predict interface residue pairs from all the possible pairs of two proteins. The results are discussed in the following sections.
To obtain a thorough analysis, four types of predictions were compared. First, the models that were trained on residue pairs were used to estimate the performance of the left-out complex in a leave-one-out cross-validation regime. These pair-wise predictions were then converted to single-residue predictions by assigning the highest score of the pairs in which a given residue was involved.
Conversely, two prediction performance scores were obtained from the models that were trained on single proteins in a similar manner. The pair-wise scores were obtained by simply averaging the scores of the two residues in a pair. Thus, the ability to predict interacting pairs and single residues can be compared for the two sets of models, i.e., the models trained on pairs and those that were trained on single residues.
Table 2 summarizes all the performance scores measured by the AUC. The results of the pair-wise models for each protein are provided in Table S2. Protein-wise comparison of performance in the two prediction models with detailed ROC plots are shown in Figures S1 (prediction of residue pairs) and S2 (prediction of single residues).
The overall results can be summarized as follows.
Models trained on residue pairs outperform the corresponding single-protein models
The first two rows of Table 2 show all four of the performance scores for the models that were trained on DBD3.0. The performances of the models trained on residue pairs were 72.9% and 66.1% for the residue pair and the single-residue predictions, respectively. The corresponding performances of the models trained on single residues were 71.0% and 63.8%, respectively. The performance of the pair-wise models was higher with respect to predicting both single residues and residue pairs, and the differences were statistically significant.
A typical example of the partner-unaware and pair-wise, partner-aware predictions is shown in Figure 4 using Acetylcholinesterase in complex with Toxin F-VII Fasciculin-2 (PDB ID: 1MAH). The predictions made from a model that was trained on single residues produced a number of false positives in the top scoring residues. This number significantly decreased after partner information was introduced by means of a pair-wise model. Quantitatively, the proportions of true positives that were in the top 20 positions in the two cases were 25% and 50%, respectively, showing a net improvement by 25 percentage points in this particular example. Presumably, the false positives were filtered out because the partner protein did not contain complementary residues for the candidates that were detected in the single-protein model.
The left and right images were drawn from the top-scoring 20 predictions from single-protein trained models (solid red) and pair-wise trained models (solid green), respectively. Many false positive cases observed in the single-protein trained model were eliminated in the pair-wise model. (The false positive rate in the selected 20 residues is 75% and 50% with an overall AUC of ROC being 60% and 82%, respectively. Predictions are made from the models trained by excluding this complex from the training data.)
Two-stage models are significantly better than stage 1 models
Although most of the comparisons in this study were based on the final stage 2 model, we examined the performance of the stage 1 models in comparison to the final model. In general, the pair-wise model performance was approximately 2–6 percentage points higher than the first-stage model (Table 2). Similarly, the single-chain prediction models showed an improvement of 4–7 percentage points. Because the two-stage model essentially averages multiple predictions from closely related feature subsets, we believe that this improvement was caused by noise reduction because only the residues that showed high scores in all (or most) of the models were given high scores in the second stage. Because most of the published methods for predicting protein-protein interactions are based on single-stage computational models, they may benefit by employing this two-stage approach.
Comparison with SPPIDER and PSIVER
In the last two rows of Table 2, we show the ability of two public web servers (SPPIDER  and PSIVER ) to predict single interacting residues. We also converted their prediction results into residue pair scores in the same way as described above.
While the prediction performance of our method was based on the leave-one-out cross-validation results and was therefore based on 124 models, the online web servers used a single model for all predictions. Furthermore, data redundancy, the definition of contacts and the performance evaluation method used were all different in the different studies, which made it rather difficult to directly compare their performances. For example, SPPIDER defines contacts by building a consensus over a number of similar instances in which a residue position occurs, thereby significantly enriching the number of positive class data points. This leads to a relatively large number of positive predictions (we observed that 3% of all the residues produced the maximum binding score). In our calculations, many of these contact predictions were flagged as false positives; however, according to the SPPIDER definition, these could be considered true positive cases. In the current study, we also discarded contacts within the chains of a single ligand or receptor (as illustrated in Figure 1). Therefore, although the performance of our models appears to be higher than that of the previously published methods, we do not claim that they provide a more accurate result; this claim would require more rigorous examination using common data sets, and various definitions of contacts would be necessary.
Comparison with PIPE Sites
While this work was being completed, a related study was published . In this publication, the authors reported the development of the web server PIPE Sites, which predicts interacting regions in a pair of protein sequences. The method essentially pairs protein sub-sequences at various window sizes and scans a database of known protein-protein interactions for their co-occurrence. Their prediction method does not use any training, and it is based on direct comparison. The method was benchmarked by measuring the overlap between the predicted paired regions and the pair of sequence regions annotated as interacting domains in a database . We note that although the PIPE Site method is likely promising and useful, it addresses the problem of protein-protein interactions at a different level, as it detects relatively longer interacting regions. Because the PIPE Site predictions at the residue-pair level are unavailable, we were unable to perform even a rough quantitative comparison with our method.
Protein-wise performance comparison
We next analyzed the protein-wise performance of our final stage 2 model and made the following observations.
Complexes with large conformational changes are difficult to predict, although no structures are used in the prediction
The creators of DBD3.0  investigated the degree of difficulty in predicting docked complexes from unbound structures; they defined the three levels of difficulty involved as rigid body, medium and highly difficult complexes. Because this classification was based on structural considerations, i.e., the conformational changes that occur upon complex formation, it would be interesting to determine whether the pair-wise predictions derived purely from sequence features also follow the same pattern of difficulty levels. In Table 3, we summarize the performance of the pair-wise prediction results with respect to the three categories. To provide a more detailed view of this summary, we plotted the performance scores as a function of the root mean square deviation (RMSD) of the conformational change on complex formation in Figure 5. As shown in Table 3, the residue pairs in difficult class complexes were predicted to have scores that were 11.4 percentage points lower on average than the rigid body cases. An alternative demonstration of this result is the negative correlation (R = −0.355) that exists between the RMSD of the bound/unbound structure pairs and prediction performance (Figure 5). Therefore, we conclude that the structural changes introduced by complex formation are a challenge that must be resolved for both structure-based docking and sequence-based predictions; we presume that this challenge exists because the long-range intra-chain cooperativity of the interacting residues could not be learned by the prediction models.
Even though there are few data points in high RMSD category making the statistical point only suggestive in nature, poorer prediction performance for complexes undergoing large conformational change is consistent with the arguments in the discussion.
Performance grouped by the functional class of a complex
To analyze the variation of prediction performance, based on the functional class of a complex, we used the same functional classification provided by the creators of DBD3.0 . Antibody/antigen complexes in that work were divided into two groups based on the availability of unbound structure. Since that classification is irrelevant for our sequence-based predictions, we merged them into a single category called Antibody/Antigen complexes. The last part of Table 3 shows the average performance of residue pair prediction in the three groups based on this classification. We observed a clear pattern that suggested the functional categories of Antibody/Antigen complexes to be the best predicted group of protein-protein complexes. This high prediction performance was produced potentially because antibody-antigen complexes may utilize some common patterns of interacting residue pairs, enabling these patterns to be detected by models trained on other complexes within these functional categories. The behavior of enzymes and their substrates and inhibitors is close to the overall average. The lowest performance was observed in the unclassified group, which was designated “others.” It is expected that for efficient prediction, several members of the same functional class should be present in the training data; the “others” category presumably consisted of several different functional protein classes, and these classes were not well represented in the data. Improvement of the annotation of complexes and enrichment of the data with samples from each functional class will likely improve performance for these cases.
Application to detect partner-specific interface residues
Previous sequence-based predictors of protein-interaction sites have aimed to detect interface residues without considering partner proteins. One significant application of the current method is that it can be used to distinguish between partner-specific interfaces of proteins that interact with more than one protein. Here, we examined a few multi-chain complexes from the Protein Data Bank (PDB)  that were not included in DBD3.0. One such example was the transducin protein beta chain 1 (PDB ID: 3PSC, chains A, B and G). Chain B directly contacts chain A (beta-adrenergic receptor kinase-1) and chain G (guanine nucleotide binding protein gamma subunit). To determine to what extent the interface residues on chain B, which correspond to partner chains A and G, can be distinguished, we predicted interacting residue pairs for the BA and BG complexes and converted them to single-residue predictions for chain B. Figure 6 shows the results of these predictions. Although a number of common true and false positive cases were produced, several residues specific to each partner chain were correctly identified. Such a separation would not be possible with conventional sequence-based prediction methods. However, further analysis is needed to benchmark the current method's ability to distinguish partner-specific interfaces more accurately and quantitatively, and work is in progress toward this goal.
The two partners are shown in transparent colors (chain A, which is the beta-adrenergic receptor kinase-1, is shown in red, and chain G, which is the guanine nucleotide binding protein's gamma-2 subunit, is shown in green). Predictions from the pair-wise model for each partner chain were converted into single chain predictions and displayed on chain B. Common binding sites, predicted with both partners, were removed and residues exclusively predicted with each partner are shown in the corresponding partner color. Out of the 30 top-scoring residues after removing common predictions, most residues have been assigned to the correct partner.
Application as a docking-pose scoring-function
Pair-wise predictions are likely to be of great value in scoring protein-protein complex decoy poses in a docking experiment. One of the first challenges in docking experiments is to select a promising candidate from a set of these decoys, which are generated by treating individual proteins as rigid bodies and sampling their hypothetical complexes . The developers of DBD3.0 used this data set to evaluate the docking program ZDOCK , and they provided docking decoy poses that were generated for these complexes using a rigid-body procedure, along with their ranks based on ZDOCK scores and the number of hits in the top 2000 poses.
Using this data set of 15 degree rotation poses, we compared the performance of our proposed method with the ZDOCK ranks. To obtain a rank from our procedure, we predicted the pair-wise scores for each complex (using leave-one-out cross-validation, as described above) and computed the AUC for the predicted scores in reference to the contact data obtained from each pose. The AUC was treated as a scoring function, and all the poses were ranked in order of their AUC. The two evaluation measures used by ZDOCK are (1) the number of native-like hits (native/decoy RMSD<2.5 Å) in the top 2000 poses and (2) the rank of the first native like structure. We found that the number of native-like hits that were obtained using the AUC of our proposed method was approximately 82% of the number of hits produced by ZDOCK. Although we used a straightforward sequence-based approach (e.g., with no repulsive term), this result appears promising and can form the basis of a more elaborate scoring function that would account for structure and other aspects.
We also tested whether our method provided information that was not already available in the ZDOCK scoring procedure. For this, we re-ranked all the complexes by taking a weighted average of the ranks from the ZDOCK and AUC-based scores (the ZDOCK rank was assigned a 3∶1 weight after integer values between 1 and 4 were arbitrarily tested, and the value that produced slightly better results than others was selected). We found a modest overall increase of 3% (from 479 to 493 in the 78 complexes with at least one native-like pose) in the number of hits using this consensus-based approach. However, the rank of the first hit was not improved with either our AUC-based method or a consensus-based approach, which suggests that the AUC-based information is of rather low resolution and cannot be used to rank closely related promising candidates. This problem has been found to be the most difficult to solve by even the best scoring functions that have been developed thus far . Therefore, although agreement between contacts derived from a docking pose and our pair-wise prediction can provide useful added value to the scoring procedures, further work must be performed to take maximum advantage of this observation.
PPIPP Web server
A two-stage prediction model that was trained on interacting residue pairs, as described above, has been developed and is publicly available at http://tardis.nibio.go.jp/netasa/ppipp/. This online version of our model uses two FASTA formatted sequences as inputs and performs pair-wise predictions between their residues. Final scores are provided for residue pairs, and the scores are also converted to single residues for each chain. A simple graphical representation of the top 200 pairs is also displayed that shows the possible connectivity in the two chains. Further improvements with respect to the graphical presentation of the results are in progress.
The role of partner information in predicting protein-protein interaction sites has been found to be important; as a result, pair-wise models outperform partner-unaware models. Prediction of the single-protein interface residues that correspond to different partner proteins makes it possible to predict multiple interfaces on the same proteins; it also allows us to accurately pair interacting residues from individual protein chains.
ROC curves for predicting interacting residue pairs from models trained on single sequences (SS) and protein pairs (PP).
ROC curves for predicting interacting single residues from models trained on single sequences (SS) and protein pairs (PP).
Contact preferences of residue pairs (sorted by p-values). Total number of residue pairs in the entire data set is 7,750,982 of which 11,259 have at least one contact within (one residue of the pair is less than 6.0 Å from the other).
Conceived and designed the experiments: SA. Performed the experiments: SA. Analyzed the data: SA. Wrote the paper: SA KM. Scientific discussions: SA KM.
- 1. Hakes L, Pinney J, Robertson D, Lovell S (2008) Protein-protein interaction networks and biology–what's the connection? Nature Biotechnology 69–72.L. HakesJ. PinneyD. RobertsonS. Lovell2008Protein-protein interaction networks and biology–what's the connection?Nature Biotechnology6972
- 2. D'Alessandro A, Righetti P, Zolla L (2010) The red blood cell proteome and interactome: an update. J Proteome Res 9: 144–163.A. D'AlessandroP. RighettiL. Zolla2010The red blood cell proteome and interactome: an update.J Proteome Res9144163
- 3. Kelly W, Stumpf M (2008) Protein-protein interactions: from global to local analyses. Curr Opin Biotechnol 19: 396–403.W. KellyM. Stumpf2008Protein-protein interactions: from global to local analyses.Curr Opin Biotechnol19396403
- 4. Bonsor D, Postel S, Pierce B, Wang N, Zhu P, et al. (2011) Molecular basis of a million-fold affinity maturation process in a protein-protein interaction. J Mol Biol 411: 321–328.D. BonsorS. PostelB. PierceN. WangP. Zhu2011Molecular basis of a million-fold affinity maturation process in a protein-protein interaction.J Mol Biol411321328
- 5. Leung C, Gong Z, Chen J, Glover J (2011) Molecular basis of BACH1/FANCJ recognition by TopBP1 in DNA replication checkpoint control. J Biol Chem 286: 4292–4301.C. LeungZ. GongJ. ChenJ. Glover2011Molecular basis of BACH1/FANCJ recognition by TopBP1 in DNA replication checkpoint control.J Biol Chem28642924301
- 6. Shoemaker B, Panchenko A (2007) Deciphering protein-protein interactions. Part I. Experimental techniques and databases. PLoS Computational Biology 3: e42.B. ShoemakerA. Panchenko2007Deciphering protein-protein interactions. Part I. Experimental techniques and databases.PLoS Computational Biology3e42
- 7. Mintseris J, Pierce B, Wiehe K, Anderson R, Chen R, et al. (2007) Integrating statistical pair potentials into protein complex prediction. Proteins 69: 511–520.J. MintserisB. PierceK. WieheR. AndersonR. Chen2007Integrating statistical pair potentials into protein complex prediction.Proteins69511520
- 8. Porollo A, Meller J (2007) Prediction-based Fingerprints of Protein-Protein Interactions. Proteins 66: 630–645.A. PorolloJ. Meller2007Prediction-based Fingerprints of Protein-Protein Interactions.Proteins66630645
- 9. Soong T-t, Wrzeszczynski KO, Rost B (2008) Physical protein-protein interactions predicted from microarrays. Bioinformatics 24: 2608–2614.T-t SoongKO WrzeszczynskiB. Rost2008Physical protein-protein interactions predicted from microarrays.Bioinformatics2426082614
- 10. Perkins JR, Diboun I, Dessailly BH, Lees JG, Orengo C (2010) Transient Protein-Protein Interactions: Structural, Functional, and Network Properties. Structure 18: 1233–1243.JR PerkinsI. DibounBH DessaillyJG LeesC. Orengo2010Transient Protein-Protein Interactions: Structural, Functional, and Network Properties.Structure1812331243
- 11. Bernauer J, Bahadur RP, Rodier F, Janin J, Poupon A (2008) DiMoVo: a Voronoi tessellation-based method for discriminating crystallographic and biological protein–protein interactions. Bioinformatics 24: 652–658.J. BernauerRP BahadurF. RodierJ. JaninA. Poupon2008DiMoVo: a Voronoi tessellation-based method for discriminating crystallographic and biological protein–protein interactions.Bioinformatics24652658
- 12. Schreiber G, Keating AE (2011) Protein binding specificity versus promiscuity. Curr Opin Struct Biol 21: 50–61.G. SchreiberAE Keating2011Protein binding specificity versus promiscuity.Curr Opin Struct Biol215061
- 13. Hamer R, Luo Q, Armitage J, Reinert G, Deane C (2010) i-Patch: interprotein contact prediction using local network information. Proteins 78: 2781–2797.R. HamerQ. LuoJ. ArmitageG. ReinertC. Deane2010i-Patch: interprotein contact prediction using local network information.Proteins7827812797
- 14. Konc J, Janezic D (2007) Protein-protein binding-sites prediction by protein surface structure conservation. J Chem Inf Model 47: 940–944.J. KoncD. Janezic2007Protein-protein binding-sites prediction by protein surface structure conservation.J Chem Inf Model47940944
- 15. Geppert T, Hoy B, Wessler S, Schneider G (2011) Context-based identification of protein-protein interfaces and “hot-spot” residues. Chem Biol 18: 344–353.T. GeppertB. HoyS. WesslerG. Schneider2011Context-based identification of protein-protein interfaces and “hot-spot” residues.Chem Biol18344353
- 16. Zhang Q, Petrey D, Norel R, Honig B (2010) Protein interface conservation across structure space. Proceedings National Academy of Science (USA) 107: 10896–108901.Q. ZhangD. PetreyR. NorelB. Honig2010Protein interface conservation across structure space.Proceedings National Academy of Science (USA)10710896108901
- 17. Reddy B, Kaznessis Y (2005) A quantitative analysis of interfacial amino acid conservation in protein-protein hetero complexes. J Bioinform Comput Biol 3: 1137–1150.B. ReddyY. Kaznessis2005A quantitative analysis of interfacial amino acid conservation in protein-protein hetero complexes.J Bioinform Comput Biol311371150
- 18. Guharoy M, Chakrabarti P (2010) Conserved residue clusters at protein-protein interfaces and their use in binding site identification. BMC Bioinformatics 11: 286.M. GuharoyP. Chakrabarti2010Conserved residue clusters at protein-protein interfaces and their use in binding site identification.BMC Bioinformatics11286
- 19. Guo Y, Yu L, Wen Z, Li M (2008) Using support vector machine combined with auto covariance to predict protein–protein interactions from protein sequences. Nucleic Acids Research 36: 3025–3030.Y. GuoL. YuZ. WenM. Li2008Using support vector machine combined with auto covariance to predict protein–protein interactions from protein sequences.Nucleic Acids Research3630253030
- 20. Najafabadi HS, Salavati R (2008) Sequence-based prediction of protein-protein interactions by means of codon usage. Genome Biology 9: R87.HS NajafabadiR. Salavati2008Sequence-based prediction of protein-protein interactions by means of codon usage.Genome Biology9R87
- 21. Zhou H, Shan Y (2001) Prediction of protein interaction sites from sequence profile and residue neighbor list. Proteins 44: 336–343.H. ZhouY. Shan2001Prediction of protein interaction sites from sequence profile and residue neighbor list.Proteins44336343
- 22. Knisley D, Knisley J (2011) Predicting protein-protein interactions using graph invariants and a neural network. Comput Biol Chem 35: 108–113.D. KnisleyJ. Knisley2011Predicting protein-protein interactions using graph invariants and a neural network.Comput Biol Chem35108113
- 23. Wang B, Chen P, Wang P, Zhao G, Zhang X (2010) Radial basis function neural network ensemble for predicting protein-protein interaction sites in heterocomplexes. Protein Pept Lett 17: 1111–1116.B. WangP. ChenP. WangG. ZhaoX. Zhang2010Radial basis function neural network ensemble for predicting protein-protein interaction sites in heterocomplexes.Protein Pept Lett1711111116
- 24. Ofran Y, Rost B (2003) Predicted protein-protein interaction sites from local sequence information. FEBS Letters 544: 236–239.Y. OfranB. Rost2003Predicted protein-protein interaction sites from local sequence information.FEBS Letters544236239
- 25. Fariselli P, Pazos F, Valencia A, Casadio R (2002) Prediction of protein-protein interaction sites in heterocomplexes with neural networks. Eur J Biochem 269: 1356–1361.P. FariselliF. PazosA. ValenciaR. Casadio2002Prediction of protein-protein interaction sites in heterocomplexes with neural networks.Eur J Biochem26913561361
- 26. Bui Q, Katrenko S, Sloot P (2011) A hybrid approach to extract protein-protein interactions. Bioinformatics 27: 259–265.Q. BuiS. KatrenkoP. Sloot2011A hybrid approach to extract protein-protein interactions.Bioinformatics27259265
- 27. Tikk D, Thomas P, Palaga P, Hakenberg J, Leser U (2010) A comprehensive benchmark of kernel methods to extract protein-protein interactions from literature. PLoS Comput Biol 6: e1000837.D. TikkP. ThomasP. PalagaJ. HakenbergU. Leser2010A comprehensive benchmark of kernel methods to extract protein-protein interactions from literature.PLoS Comput Biol6e1000837
- 28. Rashid M, Ramasamy S, Raghava G (2010) A simple approach for predicting protein-protein interactions. Curr Protein Pept Sci 11: 589–600.M. RashidS. RamasamyG. Raghava2010A simple approach for predicting protein-protein interactions.Curr Protein Pept Sci11589600
- 29. Chen P, Li J (2010) Sequence-based identification of interface residues by an integrative profile combining hydrophobic and evolutionary information. BMC Bioinformatics 11: 402.P. ChenJ. Li2010Sequence-based identification of interface residues by an integrative profile combining hydrophobic and evolutionary information.BMC Bioinformatics11402
- 30. Li N, Sun Z, Jiang F (2008) Prediction of protein-protein binding site by using core interface residue and support vector machine. BMC Bioinformatics 9: 553.N. LiZ. SunF. Jiang2008Prediction of protein-protein binding site by using core interface residue and support vector machine.BMC Bioinformatics9553
- 31. Dong Q, Wang X, Lin L, Guan Y (2007) Exploiting residue-level and profile-level interface propensities for usage in binding sites prediction of proteins. BMC Bioinformatics 8: 147.Q. DongX. WangL. LinY. Guan2007Exploiting residue-level and profile-level interface propensities for usage in binding sites prediction of proteins.BMC Bioinformatics8147
- 32. Koike A, Takagi T (2004) Prediction of protein-protein interaction sites using support vector machines. Protein Eng Des Sel 17: 165–173.A. KoikeT. Takagi2004Prediction of protein-protein interaction sites using support vector machines.Protein Eng Des Sel17165173
- 33. Chen X, Liu M (2005) Prediction of protein-protein interactions using random decision forest framework. Bioinformatics 21: 4394–4400.X. ChenM. Liu2005Prediction of protein-protein interactions using random decision forest framework.Bioinformatics2143944400
- 34. Murakami Y, Mizuguchi K (2010) Applying the Naïve Bayes classifier with kernel density estimation to the prediction of protein-protein interaction sites. Bioinformatics 26: 1841–1848.Y. MurakamiK. Mizuguchi2010Applying the Naïve Bayes classifier with kernel density estimation to the prediction of protein-protein interaction sites.Bioinformatics2618411848
- 35. Wang C, Cheng J, Su S (2009) Prediction of interacting protein pairs from sequence using a Bayesian method. Protein J 28: 111–1115.C. WangJ. ChengS. Su2009Prediction of interacting protein pairs from sequence using a Bayesian method.Protein J281111115
- 36. Gilmore J, Auberry D, Sharp J, White A, Anderson K, et al. (2008) A Bayesian estimator of protein-protein association probabilities. Bioinformatics 24: 1554–1555.J. GilmoreD. AuberryJ. SharpA. WhiteK. Anderson2008A Bayesian estimator of protein-protein association probabilities.Bioinformatics2415541555
- 37. Burger L, van Nimwegen E (2008) Accurate prediction of protein-protein interactions from sequence alignments using a Bayesian method. Mol Syst Biol 4: 165.L. BurgerE. van Nimwegen2008Accurate prediction of protein-protein interactions from sequence alignments using a Bayesian method.Mol Syst Biol4165
- 38. Bradford J, Needham C, Bulpitt A, Westhead D (2006) Insights into protein-protein interfaces using a Bayesian network prediction method. J Mol Biol 362: 365–386.J. BradfordC. NeedhamA. BulpittD. Westhead2006Insights into protein-protein interfaces using a Bayesian network prediction method.J Mol Biol362365386
- 39. Hwang H, Pierce B, Mintseris J, Janin J, Weng Z (2008) Protein-protein docking benchmark version 3.0. Proteins 73: 705–709.H. HwangB. PierceJ. MintserisJ. JaninZ. Weng2008Protein-protein docking benchmark version 3.0.Proteins73705709
- 40. Andreeva A, Howorth D, Brenner SE, Hubbard TJ, Chothia C, et al. (2004) SCOP database in 2004: refinements integrate structure and sequence family data. Nucleic Acids Research 32: D226–229.A. AndreevaD. HoworthSE BrennerTJ HubbardC. Chothia2004SCOP database in 2004: refinements integrate structure and sequence family data.Nucleic Acids Research32D226229
- 41. Altschul SF, Madden TL, Schaffer AA, Zhang JH, Zhang Z, et al. (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research 25: 3389–3402.SF AltschulTL MaddenAA SchafferJH ZhangZ. Zhang1997Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.Nucleic Acids Research2533893402
- 42. Ofran Y, Rost B (2006) ISIS: interaction sites identified from sequence. Bioinformatics 23: e13–e16.Y. OfranB. Rost2006ISIS: interaction sites identified from sequence.Bioinformatics23e13e16
- 43. Andrabi M, Mizuguchi K, Sarai A, Ahmad S (2009) Prediction of mono- and di-nucleotide-specific DNA-binding sites in proteins using neural networks. . BMC Structural Biology 9: 30.M. AndrabiK. MizuguchiA. SaraiS. Ahmad2009Prediction of mono- and di-nucleotide-specific DNA-binding sites in proteins using neural networks. .BMC Structural Biology930
- 44. Malik A, Ahmad S (2007) Sequence and structural features of carbohydrate binding in proteins and assessment of predictability using a neural network. BMC Structural Biology 7: A. MalikS. Ahmad2007Sequence and structural features of carbohydrate binding in proteins and assessment of predictability using a neural network.BMC Structural Biology7
- 45. Qian N, Sejnowski TJ (1998) Predicting the secondary structure of globular proteins using neural network models. Journal of Molecular Biology 202: 865–884.N. QianTJ Sejnowski1998Predicting the secondary structure of globular proteins using neural network models.Journal of Molecular Biology202865884
- 46. Mian IS, Bradwell AR, Olson AJ (1991) Structure, function and properties of antibody binding sites. J Mol Biol 217: 133–151.IS MianAR BradwellAJ Olson1991Structure, function and properties of antibody binding sites.J Mol Biol217133151
- 47. Fitzpatrick AW, Knowles TPJ, Waudby CA, Vendruscolo M, Dobson CM (2011) Inversion of the balance between hydrophobic and Hydrogen Bonding Interactions in Protein Folding and Aggregation. PLoS Comput Biol 7: e1002169.AW FitzpatrickTPJ KnowlesCA WaudbyM. VendruscoloCM Dobson2011Inversion of the balance between hydrophobic and Hydrogen Bonding Interactions in Protein Folding and Aggregation.PLoS Comput Biol7e1002169
- 48. Miyazawa S, Jernigan R (1996) Residue-residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading. J Mol Biol 256: 623–644.S. MiyazawaR. Jernigan1996Residue-residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading.J Mol Biol256623644
- 49. Jones S, Thornton JM (1996) Principles of protein-protein interactions. Proceedings National Academy of Science (USA) 93: 13–20.S. JonesJM Thornton1996Principles of protein-protein interactions.Proceedings National Academy of Science (USA)931320
- 50. Amos-Binks A, Patulea C, Pitre S, Schoenrock A, Gui Y, et al. (2011) Binding Site Prediction for Protein-Protein Interactions and Novel Motif Discovery using Re-occurring Polypeptide Sequences. BMC Bioinformatics 12: 225.A. Amos-BinksC. PatuleaS. PitreA. SchoenrockY. Gui2011Binding Site Prediction for Protein-Protein Interactions and Novel Motif Discovery using Re-occurring Polypeptide Sequences.BMC Bioinformatics12225
- 51. Raghavachari B, Tasneem A, Przytycka T, Jothi R (2008) DOMINE: a database of protein domain interactions. Nucleic Acids Research 36: D656–D561.B. RaghavachariA. TasneemT. PrzytyckaR. Jothi2008DOMINE: a database of protein domain interactions.Nucleic Acids Research36D656D561
- 52. Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, et al. (2000) The Protein Data Bank. Nucleic Acids Research 28: 235–242.HM BermanJ. WestbrookZ. FengG. GillilandTN Bhat2000The Protein Data Bank.Nucleic Acids Research28235242
- 53. Lensink MF, Wodak SJ (2010) Docking and scoring protein interactions: CAPRI 2009. Proteins 78: 3073–3084.MF LensinkSJ Wodak2010Docking and scoring protein interactions: CAPRI 2009.Proteins7830733084