BACKGROUND
proteins usually accomplish their biological functions as components of stable complexes or through transient interactions with other proteins.
the most detailed experimental information on protein complexes comes from high-resolution x-ray structures.
these structures provide clues on the mechanism by which the complex accomplishes its function, give insights into the physical and evolutionary principles of protein-protein interactions through statistical analysis  <cit> , and can be used as templates for the computational prediction of protein-protein interactions using docking  <cit>  or threading  <cit>  techniques.
because protein crystals contain a regular array of molecules it is a nontrivial task to determine which molecules form the biologically relevant complex.
only a subset of the molecules in the asymmetric unit or additional molecules related by space group transformations may be included in the complex.
although protein data bank  files contain information on generating the biological complex , this information is error prone.
an approximate lower bound, which is discussed in the results section, suggests that the error rate for biomt annotation is at least 9%.
this means that structural studies, such as those mentioned above, must depend on either small but reliable manually curated sets of protein complex structures or on large but significantly less reliable automatically generated sets.
computational methods that predict the biological complex for an x-ray structure can improve the reliability of complex annotations.
the earliest methods were applied only to the more limited problem of distinguishing homodimers from monomers by using a variety of differentiating features: interface area and atomic pair contacts  <cit> , fraction of surface residues in the interface and evolutionary conservation  <cit> , and a combination of non-polar interface area, fraction of buried interface atoms, and residue propensity score  <cit> .
a more general method, described in  <cit> , used scores based on atom pairs that contact across interfaces combined with iterative partitioning of the graph representing crystal contacts in order to predict complexes.
this method gave a 16% error rate on a non-redundant set of  <dig> x-ray structures.
the protein quaternary structure  server  <cit>  discriminates biological and crystal contacts based on a weighted score computed from the interface accessible area, number of interface residues, solvation energy, and the number of salt bridges and disulphide bonds.
finally, a new prediction method and web server, pisa  <cit> , was introduced during the course of this work.
that method used an empirical estimate of both enthalpic and entropic contributions to the binding free energy in order to predict stable complexes.
small ligands were also included in the free energy calculation.
although there are many online databases that contain analyses of protein complex structures obtained from other sources  <cit> , such as biomt annotation or pqs, there are currently only two other databases that contain predictions of complexes for the entire pdb, namely pqs and pisa.
the lack of many independent prediction databases is probably due to the difficulty in predicting complete protein complexes and is one motivation for this work.
we have developed a new method for identifying biological relevant protein complexes in x-ray structures and demonstrate a significant reduction in the annotation error rate.
in addition, our database , see availability and requirements section for url), contains a useful byproduct – a new classification of all protein contacts  found in the pdb.
first, protein-protein interfaces are grouped by similarity and all interfaces in a particular cluster are either all predicted to be specific  contacts or non-specific  contacts.
crystal contacts are defined to be protein-protein interfaces that only occur in the non-physiological environment of the crystal .
because all interfaces in a cluster containing biological interfaces are between proteins with similar amino acid sequences and have similar binding geometry, they presumably arose through evolutionary divergence.
thus they provide a valuable resource for studying how similar interfaces appear in different complexes of diverse functions.
second, the protein-protein interface clusters are classified by a machine learning method that utilizes a robust set of diverse interface properties.
previously we demonstrated that a similar set of properties was sufficient to distinguish near-native docked conformations in a large set of decoys  <cit> .
the combination of a large set of properties and a more sophisticated statistical model is expected to yield more accurate interface predictions.
third, the prediction method incorporates all pdb structures  rather that making a separate prediction on individual structures.
this means that information from multiple structures is combined to make the prediction of each complex.
finally, we derive the overall complex structure by a rigorous probabilistic framework that combines the probability scores from the interface predictions with probabilities derived from the pdb annotation.
methods
benchmark set of protein complex structures
a non-redundant benchmark set of  <dig> complex structures was created by combining the sets of  <cit>  and  <cit> , removing redundant complexes, and adding an additional  <dig> unrelated complexes, where all annotations were manually verified from an extensive search of the literature.
pdb entry 1mda from the ponstingl et al.
<dig> set was not included because four chains  were found to have incorrect amino acid sequences.
the  <dig> additional complexes were iteratively added by randomly choosing a complex such that no two complexes in the combined set had corresponding subunits with > 25% sequence identity.
the best quality structure, with the fewest chain breaks and mutations and highest resolution, was chosen among all pdb structures of the same complex.
furthermore, the literature, starting from the original article for the x-ray structure, was examined in order to identify the structure of the relevant protein complex and to insure that the prevalent oligomeric state of the complex in solution was experimentally verified and agreed with the structure.
this set was used for training and validating the random forest classifier for protein-protein interface prediction and for assessing the overall prediction accuracy for complexes.
the set is available, together with the annotations and prediction results .
protein-protein interface prediction data
protein-protein interfaces were predicted to be either biologically relevant contacts or crystal contacts using a random forest classifier  <cit>  trained on diverse interface properties.
the interface properties are the following:  <dig> contacting residue pair counts,  <dig> residue propensity log values, evolutionary conservation log, interface area, number of intermolecular hydrogen bonds and disulfide bonds, packing density, homo- or hetero-interface, and symmetric or non-symmetric interface.
both the residue-level  <cit>  and atomic-level properties  <cit>  were previously shown to distinguish protein-protein interfaces.
contacting residues had at least one pair of non-hydrogen atoms, one in each residue, separated by less than  <dig> Å. only interfaces with at least  <dig> intermolecular residue contacts were included in the prediction data.
the residue propensity log values reflect the number of each residue type occurring in the interface compared with the number expected from a random reshuffling of residue types on the surface.
this results in a probability that is calculated from a hypergeometric null distribution, as described in  <cit> .
the interface area was defined as  <dig> , in which the solvent accessible surface area  was calculated with the dssp program  <cit> .
the number of intermolecular hydrogen bonds was determined by adding hydrogen atoms and optimizing their geometry using the icm program  <cit>  and counting the number of potential hydrogen donor/acceptor pairs within  <dig>  Å of each other.
intermolecular disulfide bonds were defined by two cysteine residues with s-s separations between  <dig>  Å and  <dig>  Å. the packing density was calculated as sasa0/, in which sasa <dig> is the sasa with a zero probe sphere radius and the solvent excluded surface is calculated using a  <dig>  Å radius probe sphere.
the evolutionary conservation of each residue was defined as the column entropy s for a multiple alignment of similar sequences
s=−∑i=120filog⁡fi
in which fi are the residue frequencies in the corresponding alignment column.
the multiple sequence alignment was generated by collecting similar sequences from the ncbi nr database using blast  <cit>  with the protein sequence of interest as a query and an e-value cutoff of  <dig> , removing redundant sequences with > 90% sequence identity using the cd-hit program  <cit> , and finally aligning them using muscle  <cit> .
the evolutionary conservation p-value, which reflects the probability of observing more highly conserved residues in the interface than in the remaining protein surface by chance, was calculated with the wilcoxon rank-sum test  <cit> .
finally, whether or not the interface was symmetric, i.e.
possesses two-fold crystallographic symmetry, was included in the interface properties because it is a common feature of homodimers.
clustering similar interfaces
similar protein-protein interfaces were clustered into groups.
essentially those groups are groups of identical  structures, where corresponding residues are globally aligned.
all interfaces in a particular group are assigned to be either all crystal contacts or all biological interfaces .
previous studies have used various criteria to cluster protein-protein interfaces by similarity  <cit> , but one important innovation in our method is the use of such clusters to make consistent predictions of biological interfaces and consequently consistent predictions of biological complexes across the pdb.
assigning pfam residue-residue contacts
pdb residue numbers are inconsistent in general, i.e.
the same residue in different structures of the same protein may have different numbers.
because of this, they cannot be used directly in order to compare residue-residue contacts in different structures.
therefore residue numbers were made consistent by mapping them to either the corresponding pfam  <cit>  alignment column number or, if no pfam assignment is possible, by the residue index of the most similar uniprot sequence  <cit> .
hereafter the combination of the pfam family accession number and alignment column number  is denoted as the uniform residue number.
this also insures that aligned residues in homologous protein sequences are designated by the same number.
pdb sequences were first aligned to the most similar uniprot sequence, which was determined by performing a blast search of uniprot amino acid sequences and choosing the uniprot sequence with highest sequence identity to the query pdb sequence.
next the correspondence between the uniprot and pfam sequence was deduced from the full multiple alignment of uniprot sequences used to define each pfam family.
because breaks in the protein sequence in a pdb structure may lead to alignment errors near the breaks, each contiguous segment of the protein chain was separately aligned to the corresponding uniprot sequence using the emboss program needle for global pairwise sequence alignment  <cit> .
next the set of contacting residue pairs  in each protein-protein interface was calculated with the residues referred to by their uniform residue number.
all original protein chains as well as symmetry-related chains within  <dig> Å of any of the original chains, with the inter-chain separation defined by the minimum distance between non-hydrogen atoms in each chain, were included in order to insure all interfaces for the complete biological complex are present.
the symmetry-related molecules were generated using pymol  <cit> .
clustering procedure
interfaces were then clustered so that the minimum fractional residue contact overlap o, defined by
o=nmin⁡,n)
was at least  <dig>  between any two interfaces in the same cluster.
n denotes the number of contacting residue pairs in interface i and the numerator is the number of common contacting residue pairs.
this overlap cutoff value is actually a rather strict requirement as residues in the interfaces make multiple contacts with each other, so that when 30% of all contacts are the same between two interfaces it is very unlikely that the interfaces are unrelated.
although clustering a large number of interfaces would be computationally expensive, the clustering problem can be subdivided into manageable subproblems.
first identical interfaces, with the same proteins and same relative space transformation, within each pdb complex were rapidly identified and grouped.
next, all non-identical interfaces throughout the pdb were clustered using hierarchical complete linkage clustering with distance measure 1-o and the largest clusters with o ≥  <dig>  were selected.
this task was subdivided by clustering only groups of interfaces with the same pair of pfam accession numbers since the overlap between interfaces with different pfam numbers is zero by definition.
this clustering reduced the  <dig> non-identical protein-protein interfaces into  <dig> clusters.
identical protein-protein interfaces, which have the same residue-residue contacts between the same proteins, have fractional residue contact overlap o =  <dig>  and are therefore trivially assigned to the same cluster.
random forest classifier
the random forest method uses the consensus prediction from an ensemble of randomized decision trees for classification  <cit> .
it was chosen for interface prediction because of several desirable properties: resistance to overfitting, speed, the ability to use combinations of continuous and discrete data, and insensitivity to data normalization.
the randomforest package in r was used  <cit> .
approximately 15% of the benchmark set interfaces had missing evolutionary conservation data because a sufficient number of homologous sequences  could not be found.
missing data values were first imputed by the median value of that variable.
the input data included all interface properties described in protein-protein interface prediction data.
each protein-protein interface was classified as either a specific contact appearing in a biological complex or a non-specific crystal contact.
the variation of the random forest score within each cluster was estimated by calculating the standard deviation in the score within a sample of interfaces of intermediate size.
all  <dig> clusters containing exactly  <dig> interfaces were chosen for this purpose.
the average of the standard deviation in the scores within each cluster was found to be only  <dig> .
because the intra-cluster score variation is so small and also to speed up the calculation, predictions were made for only a single randomly chosen interface in each cluster and all interfaces in the cluster were assigned to the same class, as described above.
a total of  <dig> classification trees generated from  <dig> random chosen variables were used in the random forest classifier.
as expected  <cit> , the prediction accuracy was largely insensitive to these model parameters .
a random forest score was calculated as the fraction of trees that classify the interface as a biological interface.
all other interfaces in the same cluster, which were not used with the random forest classifier, were then also assigned this score.
cross-validation procedure
prediction performance was assessed using 10-fold cross-validation.
the  <dig> interface clusters appearing in the benchmark set were randomly divided into  <dig> approximately equal size test sets.
predictions were then made for each test set in turn using a random forest classifier trained on the remaining interface data in the other  <dig> sets and the prediction statistics calculated.
this procedure prevents overly optimistic performance estimates due to overfitting.
predictions for structures not included in the benchmark set were made using a random forest classifier trained on data for all interface clusters in the benchmark set.
estimating the contribution of each interface property to prediction accuracy
one further advantage of the random forest classifier is the ability to quickly estimate the contribution of each input variable to the overall prediction accuracy.
this is accomplished by calculating the average decrease in accuracy for data upon permuting the values for the variable of interest.
this can be efficiently calculated because only the so-called out-of-bag data is used   <cit> .
because the benchmark set data is significantly unbalanced, the variable importance was calculated using a balanced set of data, containing all  <dig> specific interface examples and an equal number of randomly selected non-specific interface examples.
the importance for two groups of variables, all  <dig> residue propensity log values and all  <dig> contacting residue pair counts was calculated using an alternative procedure because importance for groups of variables is not implemented in the randomforest package.
in this case, the 10-fold cross-validation accuracy was compared with the accuracy obtained by permuting the variables of interest in the cross-validation test data sets.
the accuracy difference was then averaged over  <dig> independent calculations.
prediction of the protein complex
overall, the prediction procedure for the protein complexes combines local information from the random forest interface prediction scores with global information from the number of subunits in the biomt complex using a consistent probabilistic framework.
the prediction is performed by maximizing the total probability over all structures simultaneously so that, in general, information from multiple structures contributes to the prediction of each individual complex.
interface contribution to the total probability
the random forest scores for each interface in a predicted complex need to be converted into probabilities in order to calculate the total likelihood that the complex is correct.
this was accomplished by separately fitting the score distributions for biological interfaces ) and crystal contact interfaces ) in the benchmark set using gaussian kernel density estimation.
the resulting smooth distributions are shown in figure  <dig>
the local interface component of the score for each particular complex can be obtained for each possible interface assignment  by computing the following product over all unique interface clusters in the predicted complex.
p=∏ci∈  specificp  specific∏ci∈ non− specificp  non-specific
this equation assumes that the probabilities for each unique interface are independent.
this is a very good approximation, because we cluster all similar interfaces together, and interfaces in a cluster are either all assigned as specific or all assigned as non-specific.
it is not possible to consider as independent closely related interfaces within clusters.
biomt contribution to the total probability
even though the biomt annotation in the pdb files, which specifies how to generate the biological complex, is error-prone, it is still often correct and thus provides valuable information for predicting the complex.
therefore a predicted complex whose oligomeric state agrees with the biomt annotation should be assigned a higher likelihood to be correct than one with a different oligomeric state.
we have chosen the number of subunits in the complex as a criterion of such agreement because often the only independent experimental information on the complex, aside from the crystal structure itself, is its oligomeric state as measured by, for example, chromatography.
the probability that the number of subunits in the biomt complex  agrees with the number of subunits in the actual complex  is
p = p + pp
if the probability of observing nbiomt subunits by chance is estimated by the fraction of all possible complexes, resulting from all 2nclusters different possible interface assignments, that have nbiomt subunits then equation  <dig> becomes
p≈p+)n∑in
in which n is the number of predicted complexes with i subunits out of all possible predicted complexes.
there are two different ways in which n can agree with nbiomt: either the biomt complex is correct  or the biomt complex is incorrect and the number of subunits agrees by chance .
the value of p is approximated by its upper bound due to consistency  discussed above.
the biomt contribution, pbiomt, to the overall likelihood of the predicted complex can be then calculated based on the number of unique subunits observed in the prediction as p from equation  <dig>  if n = nbiomt, or  <dig> - p, if n ≠ nbiomt.
total probability for each predicted complex
the probability for a particular complex is calculated as the product of the biomt contribution, pbiomt,  and the local interface contribution, p, in equation  <dig>  the total likelihood of a particular interface assignment is the product of the probabilities over all complexes considered.
the set of protein complex subunits and resulting protein complexes may be represented by a graph in which each node corresponds to a particular subunit and edges join contacting subunits.
there are two types of edges in the graph: specific  or non-specific  interfaces between the two corresponding subunits.
for a particular assignment of the interfaces, the component of the graph that  is connected by specific contacts,  contains at least one subunit in the asymmetric unit, and  contains all unique subunits is the predicted complex.
because the interfaces in a cluster are considered either all specific or all non-specific there are 2nclusters different possible interface assignments in which nclusters is the total number of clusters.
a constraint is imposed so that each predicted complex is required to include each non-redundant protein chain in the x-ray structure at least once.
this is required because presumably each structure contains a single biologically relevant complex and not a collection of proteins that form multiple non-interacting complexes.
in the few cases in which a consistent assignment of interfaces clusters that satisfies this constraint does not exist, only the assignments that minimally violate the constraint  are considered.
prediction of protein complexes using maximization of the total likelihood
the assignment of interface clusters as either specific or non-specific and the resulting predictions of biological complexes are then accomplished by maximizing the total likelihood over all possible interface cluster assignments subject to the aforementioned constraint.
because there are  <dig> clusters and the number of possible interface assignments is 2nclusters , it is fortunate that the optimization problem can be broken down into independent subproblems.
this is done by generating a graph in which each node represents a cluster and edges are placed between two nodes for clusters co-occurring in any structure.
next, all connected components in this graph are determined.
independent optimizations are then performed for each set of interface clusters corresponding to nodes present in a single connected component.
the optimization was done by exhaustive enumeration of all interface cluster assignments in subproblems with ≤  <dig> interface clusters and otherwise using a monte carlo algorithm employing metropolis sampling with a temperature parameter of  <dig> .
the vast majority of subproblems  could be exactly solved by the former method.
RESULTS
protein-protein interface prediction performance
the performance of the random forest classifier in predicting protein-protein interfaces was assessed by plotting the receiver operator characteristic  curve for the 10-fold cross validation results on the benchmark set.
the roc curve, shown in figure  <dig>  displays the tradeoff between prediction sensitivity and specificity.
the random forest score cutoff is the parameter that is varied along the curve.
the value of  <dig>  for the area under the roc curve is near the maximum value of  <dig>  and demonstrates the high prediction accuracy.
contributions of interface properties to prediction accuracy
as described in the methods section, the importance of each interface property to the overall random forest prediction accuracy can easily be calculated.
this can give insight into which properties are most useful in discriminating specific protein-protein interfaces from non-specific interfaces and provide guidance for future prediction efforts.
first we compare the relative importance of individual properties using the out-of-bag data.
the properties making the largest contribution to the prediction accuracy, along with their relative importance, are listed in table  <dig>
all properties with a relative importance of at least  <dig>  are shown.
an asterisk indicates a group rather than individual properties.
the interface area makes the largest contribution to the prediction accuracy.
its importance in discriminating specific protein-protein interfaces has been noted in earlier studies  <cit> .
of course, any criteria used to select which interfaces are included in the training data will affect the relative contribution of each interface property to the prediction accuracy.
as mentioned in the methods section, all interfaces were required to have at least  <dig> intermolecular residue contacts.
this excludes many interfaces with low interface area, but is still quite permissive.
if the cutoff on the number of residue contacts were increased or if a high cutoff on the interface area were applied, it is expected that the importance of the interface area would decrease because this would exclude small interfaces with low surface area, most of which are non-specific.
although specific interfaces in dimers typically have an area of at least  <dig> Å <dig>  <cit> , smaller interfaces are often present in higher order complexes.
the motivation for applying a relatively lax cutoff on interface size is to avoid removing small specific interfaces and to allow the random forest classifier to select the specific interfaces based on interface area, in addition to the other interface properties, rather than employing a hard cutoff.
the number of intermolecular hydrogen bonds gives the second largest contribution  to the prediction accuracy.
this is expected since it is highly correlated with the interface surface area  <cit> , with a correlation coefficient of  <dig>  for the benchmark set data.
hydrogen bonds provide both favorable energetic contributions as well as specificity to the interaction  <cit> .
the  <dig> residue contacting pair counts and the  <dig> residue propensities, each considered as groups of variables, contributed  <dig> % and  <dig> %, respectively.
examining the importance the propensities for each residue type reveals that the largest contributions are from leucine, phenylalanine, isoleucine, tyrosine, and valine, in decreasing order of importance.
a previous study that used the same statistic as a measure of the propensity of particular residue types to appear in protein-protein interfaces also found that these were some of the most prevalent in interfaces  <cit> .
the contacting residue pairs that contributed the most to the prediction accuracy were l-v, l-q, l-l, d-r, a-y, l-y, v-v, f-i, r-y, and l-p, in decreasing order of importance.
all of these contacts involve at least one of the important residue types, except for d-r, which can potentially form a salt bridge.
protein complex prediction performance
the performances of different prediction methods were evaluated by counting the number of correctly predicted protein complexes having the correct stoichiometry, or oligomeric state.
a total of  <dig> out of the  <dig> benchmark set complexes were incorrectly predicted, resulting in an error rate of only about 11% for our method.
the error rate for the subset of  <dig> benchmark set complexes taken from the ponstingl et al.
<dig> set was 13%.
this is slightly lower than the 16% error rate reported in that study.
we also calculated the error rates for pqs and pisa predictions for comparison.
one potential difficulty with this is that both of these databases contain multiple predictions for some pdb entries.
this is not a significant problem for pqs since only  <dig> of the  <dig> pdb entries in the benchmark set with multiple predicted complexes had different oligomeric states, which is the basis for our evaluation of prediction results.
only the most stable predicted complex for each pdb entry was used to calculate the error rate for pisa, and furthermore only the total number of subunits in each complex was compared, because only these results were available for automatic download.
there were between  <dig> and  <dig> incorrect predictions for pqs, depending on which of the multiple predicted complexes were chosen for comparison, yielding an error rate of approximately 17%–18%.
a total of  <dig> of the predicted pisa complexes disagreed, giving an error rate of approximately 24%.
unfortunately, this value is not directly comparable with that for our method for the reasons mentioned above.
however, the pqs error rate is significantly higher, even after accounting for the few pdb entries with multiple predicted structures.
a comparison of the predicted protein complexes with those generated from the pdb annotation revealed that a total of 17% of the predicted complexes are different, i.e.
have different stoichiometry.
a further breakdown of these complexes by type is shown in table  <dig>  it is apparent that there are considerably more complexes that are predicted to be homomultimers but in the biomt record they are annotated as monomers than the converse.
one possible explanation is that x-ray structures of a single protein are annotated as a monomer by default if no experimental information on their oligomeric state is available.
figure  <dig> shows an example of one such case in which the complex structure was successfully predicted but the pdb annotation was incorrect.
unfortunately, the large number of pdb entries with disagreements between the predicted complexes and pdb annotation precludes manual verification of their correctness.
each complex is classified as either monomer, homomultimer , or heteromultimer .
analysis of domain contacts in predicted biological complexes
the prediction method for protein complexes also yields clusters of related protein-protein interfaces found in biological complexes.
these predicted pfam-a domain-domain contacts were compared with those in the ipfam  <cit>  and 3did databases.
the overlap between the different sets of domain-domain contacts in each database is shown in figure  <dig>  this figure does not include the additional  <dig> distinct pfam contacts containing a pfam-b domain that are present in the predicted biological complexes but not included in either ipfam or 3did.
interestingly, pfam domain-domain contacts are predicted very differently in the ipfam and 3did databases.
this difference alone is a strong indication that further analysis is needed.
indeed, the ipfam database includes all contacts, both specific and non-specific and the 3did database used an empirical residue contact score to remove possible non-specific contacts.
even more importantly, neither of these databases includes symmetry-related chains so that many specific contacts are necessarily missing as they simply are not included for consideration.
our algorithm aims to include only specific contacts in predicted biological complexes, and we take special care to enumerate all contacts observed in the x-ray crystal structures by applying the necessary symmetry operations.
of course, biological applications relying on these databases are mostly interested in the biologically relevant domain interactions rather than crystal contacts.
online database of protein complexes
a searchable database of all predicted protein complexes is available online .
search fields include the pdb entry name, text in the complex or subunit description, interface cluster number, or the pfam accession number.
the complex structures matching the query are presented both explicitly as three-dimensional structures and schematically as graphs in which nodes represent subunits and edges represent contacts .
in addition, all data files are directly available for download by ftp.
CONCLUSIONS
high-resolution structures provide unique information about biological complexes, which is not available by any other experimental or theoretical method.
in addition to being the most reliable evidence for the existence of the complex, high-resolution structures give clues about functional mechanisms, elucidate stoichiometry requirements, and allow functional comparisons with orthologs from other species.
in many cases a high-resolution structure can be used to guide further experimental work, e.g.
discovery of small molecules modulating the formation or function of the complex.
the reconstruction of a complete biological subunit proved to be a complex computational problem both due to the amount of the required technical work  and due to fundamental difficulties of differentiating between biological and non-biological contacts.
separate questions arise from the presence of incomplete protein complexes.
in those cases the crystallized assembly is only part of true biological complex.
the pdb biomt annotation is known to contain a large number of incorrect annotations, and two other previously developed approaches  provide alternative annotations.
the validity of this information is very important, as it is utilized in a large number of other databases without modification and without any further critical analysis.
these derived databases are used for comparative genomics studies, reconstruction of cellular pathways, etc.
and the errors introduced at the annotation stage adversely affect all results derived from them.
our method has demonstrated an almost two-fold reduction of the error rate for predictions on a large set of  <dig> protein complexes manually assigned through analysis of available biological literature.
the error rate for our method was 11% as compared with error rates of 17–18% for pqs and approximately 24% for pisa.
there was also a smaller reduction in the error rate for a subset of protein complexes from ponstingl et al.
<dig> from 16% for that method to 13% for the method described here.
another result of our work is the clustering of similar interfaces.
the enforced similarity guarantees that two parts of the interface not only have similar biological sequences, but also have similar spatial arrangements.
the groups are created for all contacts found in the pdb .
the availability of interface clusters opens several possibilities for further analysis.
for example, it is possible to check the literature for biological evidence of a particular interface by using sources related to all pdb complexes containing it.
this could greatly increase our confidence in the annotation of the difficult cases, both on the level of individual interfaces and on the level of complete complexes.
further analysis of these interface groups and how they co-occur in complexes may give insights into the evolutionary history of protein complexes.
an analysis of the contribution of each interface property to the accurate random forest prediction of protein-protein interfaces showed that the interface area, number of intramolecular hydrogen bonds, evolutionary conservation, over-represented  interface residues and residue-residue contacts, and interface packing density contributed the most.
an important advantage of the random forest method over other machine learning methods is that it can use all of these diverse properties, without adjusting their relative normalization, in order to make an accurate prediction.
the observed reduction of the error rate is both significant and valuable for applications, but in our opinion it is also surprising that it remains relatively high.
in our study we used a comprehensive set of interface characteristics, but obviously more has to be done to understand what governs contacts under biological conditions.
several further directions for study are possible.
one of the most interesting would be to combine our machine learning approach with free energy calculations as suggested by the approach used for the pisa database  <cit> .
another possible direction could involve algorithms to integrate information from several interfaces together with "global" information about complex.
in our work we have used biomt stoichiometry as such global information, but many problems remains unresolved, in particular the relative weights assigned to global and local components.
finally, we found relatively little agreement on which pfam domains form contacts in protein complexes among complexes predicted from our method and those in the ipfam and 3did databases.
we attribute this discrepancy mainly to crystal contacts and missing subunits in the other databases due to ignoring symmetry-related chains.
it would be interesting to also compare the set of interacting pfam domains in the complexes identified by our method with those predicted from yeast two-hybrid data  <cit> .
availability and requirements
protein interface server :
authors' contributions
ab conceived the prediction methodology and carried out the calculations.
both authors participated in the analysis of the results, database website design, and drafting the manuscript.
both authors read and approved the final manuscript.
supplementary material
additional file 1
benchmark set of  <dig> protein complex structures with prediction results.
the file is a tab-separated table with the following columns: pdb entry; correct oligomeric state; data source ; oligomeric state of the complex predicted by our method; oligomeric state of the complex predicted by pqs; total number of subunits in the complex predicted by pisa; and oligomeric state of the pdb biomt complex.
click here for file
acknowledgements
the bioenergy science center is a u.s. department of energy bioenergy research center supported by the office of biological and environmental research in the doe office of science.
the work was partially funded by erkp <dig> "an integrated knowledge base for the shewanella federation" from the doe office of biological and environmental research, and the mayo clinic.
we wish to thank jeff holmes for the pins website development.

 proteins usually accomplish their biological functions as components of stable complexes or through transient interactions with other proteins. the most detailed experimental information on protein complexes comes from high-resolution x-ray structures. these structures provide clues on the mechanism by which the complex accomplishes its function, give insights into the physical and evolutionary principles of protein-protein interactions through statistical analysis, and can be used as templates for the computational prediction of protein-protein interactions using docking or threading techniques. because protein crystals contain a regular array of molecules it is a nontrivial task to determine which molecules form the biologically relevant complex. only a subset of the molecules in the asymmetric unit or additional molecules related by space group transformations may be included in the complex. although protein data bank files contain information on generating the biological complex, this information is error prone. an approximate lower bound, which is discussed in the results section, suggests that the error rate for biomt annotation is at least 9%. this means that structural studies, such as those mentioned above, must depend on either small but reliable manually curated sets of protein complex structures or on large but significantly less reliable automatically generated sets. computational methods that predict the biological complex for an x-ray structure can improve the reliability of complex annotations. the earliest methods were applied only to the more limited problem of distinguishing homodimers from monomers by using a variety of differentiating features: interface area and atomic pair contacts, fraction of surface residues in the interface and evolutionary conservation, and a combination of non-polar interface area, fraction of buried interface atoms, and residue propensity score. a more general method, described in, used scores based on atom pairs that contact across interfaces combined with iterative partitioning of the graph representing crystal contacts in order to predict complexes. this method gave a 16% error rate on a non-redundant set of x-ray structures. the protein quaternary structure server discriminates biological and crystal contacts based on a weighted score computed from the interface accessible area, number of interface residues, solvation energy, and the number of salt bridges and disulphide bonds. finally, a new prediction method and web server, pisa, was introduced during the course of this work. that method used an empirical estimate of both enthalpic and entropic contributions to the binding free energy in order to predict stable complexes. small ligands were also included in the free energy calculation. although there are many online databases that contain analyses of protein complex structures obtained from other sources, such as biomt annotation or pqs, there are currently only two other databases that contain predictions of complexes for the entire pdb, namely pqs and pisa. the lack of many independent prediction databases is probably due to the difficulty in predicting complete protein complexes and is one motivation for this work. we have developed a new method for identifying biological relevant protein complexes in x-ray structures and demonstrate a significant reduction in the annotation error rate. in addition, our database, see availability and requirements section for url), contains a useful byproduct – a new classification of all protein contacts found in the pdb. first, protein-protein interfaces are grouped by similarity and all interfaces in a particular cluster are either all predicted to be specific contacts or non-specific contacts. crystal contacts are defined to be protein-protein interfaces that only occur in the non-physiological environment of the crystal. because all interfaces in a cluster containing biological interfaces are between proteins with similar amino acid sequences and have similar binding geometry, they presumably arose through evolutionary divergence. thus they provide a valuable resource for studying how similar interfaces appear in different complexes of diverse functions. second, the protein-protein interface clusters are classified by a machine learning method that utilizes a robust set of diverse interface properties. previously we demonstrated that a similar set of properties was sufficient to distinguish near-native docked conformations in a large set of decoys. the combination of a large set of properties and a more sophisticated statistical model is expected to yield more accurate interface predictions. third, the prediction method incorporates all pdb structures rather that making a separate prediction on individual structures. this means that information from multiple structures is combined to make the prediction of each complex. finally, we derive the overall complex structure by a rigorous probabilistic framework that combines the probability scores from the interface predictions with probabilities derived from the pdb annotation. methods benchmark set of protein complex structures a non-redundant benchmark set of complex structures was created by combining the sets of and, removing redundant complexes, and adding an additional unrelated complexes, where all annotations were manually verified from an extensive search of the literature. pdb entry 1mda from the ponstingl et al. set was not included because four chains were found to have incorrect amino acid sequences. the additional complexes were iteratively added by randomly choosing a complex such that no two complexes in the combined set had corresponding subunits with > 25% sequence identity. the best quality structure, with the fewest chain breaks and mutations and highest resolution, was chosen among all pdb structures of the same complex. furthermore, the literature, starting from the original article for the x-ray structure, was examined in order to identify the structure of the relevant protein complex and to insure that the prevalent oligomeric state of the complex in solution was experimentally verified and agreed with the structure. this set was used for training and validating the random forest classifier for protein-protein interface prediction and for assessing the overall prediction accuracy for complexes. the set is available, together with the annotations and prediction results. protein-protein interface prediction data protein-protein interfaces were predicted to be either biologically relevant contacts or crystal contacts using a random forest classifier trained on diverse interface properties. the interface properties are the following: contacting residue pair counts, residue propensity log values, evolutionary conservation log, interface area, number of intermolecular hydrogen bonds and disulfide bonds, packing density, homo- or hetero-interface, and symmetric or non-symmetric interface. both the residue-level and atomic-level properties were previously shown to distinguish protein-protein interfaces. contacting residues had at least one pair of non-hydrogen atoms, one in each residue, separated by less than Å. only interfaces with at least intermolecular residue contacts were included in the prediction data. the residue propensity log values reflect the number of each residue type occurring in the interface compared with the number expected from a random reshuffling of residue types on the surface. this results in a probability that is calculated from a hypergeometric null distribution, as described in. the interface area was defined as, in which the solvent accessible surface area was calculated with the dssp program. the number of intermolecular hydrogen bonds was determined by adding hydrogen atoms and optimizing their geometry using the icm program and counting the number of potential hydrogen donor/acceptor pairs within Å of each other. intermolecular disulfide bonds were defined by two cysteine residues with s-s separations between Å and Å. the packing density was calculated as sasa0/, in which sasa is the sasa with a zero probe sphere radius and the solvent excluded surface is calculated using a Å radius probe sphere. the evolutionary conservation of each residue was defined as the column entropy s for a multiple alignment of similar sequences s=−∑i=120filog⁡fi in which fi are the residue frequencies in the corresponding alignment column. the multiple sequence alignment was generated by collecting similar sequences from the ncbi nr database using blast with the protein sequence of interest as a query and an e-value cutoff of, removing redundant sequences with > 90% sequence identity using the cd-hit program, and finally aligning them using muscle. the evolutionary conservation p-value, which reflects the probability of observing more highly conserved residues in the interface than in the remaining protein surface by chance, was calculated with the wilcoxon rank-sum test. finally, whether or not the interface was symmetric, i.e. possesses two-fold crystallographic symmetry, was included in the interface properties because it is a common feature of homodimers. clustering similar interfaces similar protein-protein interfaces were clustered into groups. essentially those groups are groups of identical structures, where corresponding residues are globally aligned. all interfaces in a particular group are assigned to be either all crystal contacts or all biological interfaces. previous studies have used various criteria to cluster protein-protein interfaces by similarity, but one important innovation in our method is the use of such clusters to make consistent predictions of biological interfaces and consequently consistent predictions of biological complexes across the pdb. assigning pfam residue-residue contacts pdb residue numbers are inconsistent in general, i.e. the same residue in different structures of the same protein may have different numbers. because of this, they cannot be used directly in order to compare residue-residue contacts in different structures. therefore residue numbers were made consistent by mapping them to either the corresponding pfam alignment column number or, if no pfam assignment is possible, by the residue index of the most similar uniprot sequence. hereafter the combination of the pfam family accession number and alignment column number is denoted as the uniform residue number. this also insures that aligned residues in homologous protein sequences are designated by the same number. pdb sequences were first aligned to the most similar uniprot sequence, which was determined by performing a blast search of uniprot amino acid sequences and choosing the uniprot sequence with highest sequence identity to the query pdb sequence. next the correspondence between the uniprot and pfam sequence was deduced from the full multiple alignment of uniprot sequences used to define each pfam family. because breaks in the protein sequence in a pdb structure may lead to alignment errors near the breaks, each contiguous segment of the protein chain was separately aligned to the corresponding uniprot sequence using the emboss program needle for global pairwise sequence alignment. next the set of contacting residue pairs in each protein-protein interface was calculated with the residues referred to by their uniform residue number. all original protein chains as well as symmetry-related chains within Å of any of the original chains, with the inter-chain separation defined by the minimum distance between non-hydrogen atoms in each chain, were included in order to insure all interfaces for the complete biological complex are present. the symmetry-related molecules were generated using pymol. clustering procedure interfaces were then clustered so that the minimum fractional residue contact overlap o, defined by o=nmin⁡,n) was at least between any two interfaces in the same cluster. n denotes the number of contacting residue pairs in interface i and the numerator is the number of common contacting residue pairs. this overlap cutoff value is actually a rather strict requirement as residues in the interfaces make multiple contacts with each other, so that when 30% of all contacts are the same between two interfaces it is very unlikely that the interfaces are unrelated. although clustering a large number of interfaces would be computationally expensive, the clustering problem can be subdivided into manageable subproblems. first identical interfaces, with the same proteins and same relative space transformation, within each pdb complex were rapidly identified and grouped. next, all non-identical interfaces throughout the pdb were clustered using hierarchical complete linkage clustering with distance measure 1-o and the largest clusters with o ≥ were selected. this task was subdivided by clustering only groups of interfaces with the same pair of pfam accession numbers since the overlap between interfaces with different pfam numbers is zero by definition. this clustering reduced the non-identical protein-protein interfaces into clusters. identical protein-protein interfaces, which have the same residue-residue contacts between the same proteins, have fractional residue contact overlap o = and are therefore trivially assigned to the same cluster. random forest classifier the random forest method uses the consensus prediction from an ensemble of randomized decision trees for classification. it was chosen for interface prediction because of several desirable properties: resistance to overfitting, speed, the ability to use combinations of continuous and discrete data, and insensitivity to data normalization. the randomforest package in r was used. approximately 15% of the benchmark set interfaces had missing evolutionary conservation data because a sufficient number of homologous sequences could not be found. missing data values were first imputed by the median value of that variable. the input data included all interface properties described in protein-protein interface prediction data. each protein-protein interface was classified as either a specific contact appearing in a biological complex or a non-specific crystal contact. the variation of the random forest score within each cluster was estimated by calculating the standard deviation in the score within a sample of interfaces of intermediate size. all clusters containing exactly interfaces were chosen for this purpose. the average of the standard deviation in the scores within each cluster was found to be only. because the intra-cluster score variation is so small and also to speed up the calculation, predictions were made for only a single randomly chosen interface in each cluster and all interfaces in the cluster were assigned to the same class, as described above. a total of classification trees generated from random chosen variables were used in the random forest classifier. as expected, the prediction accuracy was largely insensitive to these model parameters. a random forest score was calculated as the fraction of trees that classify the interface as a biological interface. all other interfaces in the same cluster, which were not used with the random forest classifier, were then also assigned this score. cross-validation procedure prediction performance was assessed using 10-fold cross-validation. the interface clusters appearing in the benchmark set were randomly divided into approximately equal size test sets. predictions were then made for each test set in turn using a random forest classifier trained on the remaining interface data in the other sets and the prediction statistics calculated. this procedure prevents overly optimistic performance estimates due to overfitting. predictions for structures not included in the benchmark set were made using a random forest classifier trained on data for all interface clusters in the benchmark set. estimating the contribution of each interface property to prediction accuracy one further advantage of the random forest classifier is the ability to quickly estimate the contribution of each input variable to the overall prediction accuracy. this is accomplished by calculating the average decrease in accuracy for data upon permuting the values for the variable of interest. this can be efficiently calculated because only the so-called out-of-bag data is used. because the benchmark set data is significantly unbalanced, the variable importance was calculated using a balanced set of data, containing all specific interface examples and an equal number of randomly selected non-specific interface examples. the importance for two groups of variables, all residue propensity log values and all contacting residue pair counts was calculated using an alternative procedure because importance for groups of variables is not implemented in the randomforest package. in this case, the 10-fold cross-validation accuracy was compared with the accuracy obtained by permuting the variables of interest in the cross-validation test data sets. the accuracy difference was then averaged over independent calculations. prediction of the protein complex overall, the prediction procedure for the protein complexes combines local information from the random forest interface prediction scores with global information from the number of subunits in the biomt complex using a consistent probabilistic framework. the prediction is performed by maximizing the total probability over all structures simultaneously so that, in general, information from multiple structures contributes to the prediction of each individual complex. interface contribution to the total probability the random forest scores for each interface in a predicted complex need to be converted into probabilities in order to calculate the total likelihood that the complex is correct. this was accomplished by separately fitting the score distributions for biological interfaces ) and crystal contact interfaces ) in the benchmark set using gaussian kernel density estimation. the resulting smooth distributions are shown in figure the local interface component of the score for each particular complex can be obtained for each possible interface assignment by computing the following product over all unique interface clusters in the predicted complex. p=∏ci∈ specificp specific∏ci∈ non− specificp non-specific this equation assumes that the probabilities for each unique interface are independent. this is a very good approximation, because we cluster all similar interfaces together, and interfaces in a cluster are either all assigned as specific or all assigned as non-specific. it is not possible to consider as independent closely related interfaces within clusters. biomt contribution to the total probability even though the biomt annotation in the pdb files, which specifies how to generate the biological complex, is error-prone, it is still often correct and thus provides valuable information for predicting the complex. therefore a predicted complex whose oligomeric state agrees with the biomt annotation should be assigned a higher likelihood to be correct than one with a different oligomeric state. we have chosen the number of subunits in the complex as a criterion of such agreement because often the only independent experimental information on the complex, aside from the crystal structure itself, is its oligomeric state as measured by, for example, chromatography. the probability that the number of subunits in the biomt complex agrees with the number of subunits in the actual complex is p = p + pp if the probability of observing nbiomt subunits by chance is estimated by the fraction of all possible complexes, resulting from all 2nclusters different possible interface assignments, that have nbiomt subunits then equation becomes p≈p+)n∑in in which n is the number of predicted complexes with i subunits out of all possible predicted complexes. there are two different ways in which n can agree with nbiomt: either the biomt complex is correct or the biomt complex is incorrect and the number of subunits agrees by chance. the value of p is approximated by its upper bound due to consistency discussed above. the biomt contribution, pbiomt, to the overall likelihood of the predicted complex can be then calculated based on the number of unique subunits observed in the prediction as p from equation if n = nbiomt, or - p, if n ≠ nbiomt. total probability for each predicted complex the probability for a particular complex is calculated as the product of the biomt contribution, pbiomt, and the local interface contribution, p, in equation the total likelihood of a particular interface assignment is the product of the probabilities over all complexes considered. the set of protein complex subunits and resulting protein complexes may be represented by a graph in which each node corresponds to a particular subunit and edges join contacting subunits. there are two types of edges in the graph: specific or non-specific interfaces between the two corresponding subunits. for a particular assignment of the interfaces, the component of the graph that is connected by specific contacts, contains at least one subunit in the asymmetric unit, and contains all unique subunits is the predicted complex. because the interfaces in a cluster are considered either all specific or all non-specific there are 2nclusters different possible interface assignments in which nclusters is the total number of clusters. a constraint is imposed so that each predicted complex is required to include each non-redundant protein chain in the x-ray structure at least once. this is required because presumably each structure contains a single biologically relevant complex and not a collection of proteins that form multiple non-interacting complexes. in the few cases in which a consistent assignment of interfaces clusters that satisfies this constraint does not exist, only the assignments that minimally violate the constraint are considered. prediction of protein complexes using maximization of the total likelihood the assignment of interface clusters as either specific or non-specific and the resulting predictions of biological complexes are then accomplished by maximizing the total likelihood over all possible interface cluster assignments subject to the aforementioned constraint. because there are clusters and the number of possible interface assignments is 2nclusters, it is fortunate that the optimization problem can be broken down into independent subproblems. this is done by generating a graph in which each node represents a cluster and edges are placed between two nodes for clusters co-occurring in any structure. next, all connected components in this graph are determined. independent optimizations are then performed for each set of interface clusters corresponding to nodes present in a single connected component. the optimization was done by exhaustive enumeration of all interface cluster assignments in subproblems with ≤ interface clusters and otherwise using a monte carlo algorithm employing metropolis sampling with a temperature parameter of. the vast majority of subproblems could be exactly solved by the former method.  protein-protein interface prediction performance the performance of the random forest classifier in predicting protein-protein interfaces was assessed by plotting the receiver operator characteristic curve for the 10-fold cross validation results on the benchmark set. the roc curve, shown in figure displays the tradeoff between prediction sensitivity and specificity. the random forest score cutoff is the parameter that is varied along the curve. the value of for the area under the roc curve is near the maximum value of and demonstrates the high prediction accuracy. contributions of interface properties to prediction accuracy as described in the methods section, the importance of each interface property to the overall random forest prediction accuracy can easily be calculated. this can give insight into which properties are most useful in discriminating specific protein-protein interfaces from non-specific interfaces and provide guidance for future prediction efforts. first we compare the relative importance of individual properties using the out-of-bag data. the properties making the largest contribution to the prediction accuracy, along with their relative importance, are listed in table all properties with a relative importance of at least are shown. an asterisk indicates a group rather than individual properties. the interface area makes the largest contribution to the prediction accuracy. its importance in discriminating specific protein-protein interfaces has been noted in earlier studies. of course, any criteria used to select which interfaces are included in the training data will affect the relative contribution of each interface property to the prediction accuracy. as mentioned in the methods section, all interfaces were required to have at least intermolecular residue contacts. this excludes many interfaces with low interface area, but is still quite permissive. if the cutoff on the number of residue contacts were increased or if a high cutoff on the interface area were applied, it is expected that the importance of the interface area would decrease because this would exclude small interfaces with low surface area, most of which are non-specific. although specific interfaces in dimers typically have an area of at least Å, smaller interfaces are often present in higher order complexes. the motivation for applying a relatively lax cutoff on interface size is to avoid removing small specific interfaces and to allow the random forest classifier to select the specific interfaces based on interface area, in addition to the other interface properties, rather than employing a hard cutoff. the number of intermolecular hydrogen bonds gives the second largest contribution to the prediction accuracy. this is expected since it is highly correlated with the interface surface area, with a correlation coefficient of for the benchmark set data. hydrogen bonds provide both favorable energetic contributions as well as specificity to the interaction. the residue contacting pair counts and the residue propensities, each considered as groups of variables, contributed % and %, respectively. examining the importance the propensities for each residue type reveals that the largest contributions are from leucine, phenylalanine, isoleucine, tyrosine, and valine, in decreasing order of importance. a previous study that used the same statistic as a measure of the propensity of particular residue types to appear in protein-protein interfaces also found that these were some of the most prevalent in interfaces. the contacting residue pairs that contributed the most to the prediction accuracy were l-v, l-q, l-l, d-r, a-y, l-y, v-v, f-i, r-y, and l-p, in decreasing order of importance. all of these contacts involve at least one of the important residue types, except for d-r, which can potentially form a salt bridge. protein complex prediction performance the performances of different prediction methods were evaluated by counting the number of correctly predicted protein complexes having the correct stoichiometry, or oligomeric state. a total of out of the benchmark set complexes were incorrectly predicted, resulting in an error rate of only about 11% for our method. the error rate for the subset of benchmark set complexes taken from the ponstingl et al. set was 13%. this is slightly lower than the 16% error rate reported in that study. we also calculated the error rates for pqs and pisa predictions for comparison. one potential difficulty with this is that both of these databases contain multiple predictions for some pdb entries. this is not a significant problem for pqs since only of the pdb entries in the benchmark set with multiple predicted complexes had different oligomeric states, which is the basis for our evaluation of prediction results. only the most stable predicted complex for each pdb entry was used to calculate the error rate for pisa, and furthermore only the total number of subunits in each complex was compared, because only these results were available for automatic download. there were between and incorrect predictions for pqs, depending on which of the multiple predicted complexes were chosen for comparison, yielding an error rate of approximately 17%–18%. a total of of the predicted pisa complexes disagreed, giving an error rate of approximately 24%. unfortunately, this value is not directly comparable with that for our method for the reasons mentioned above. however, the pqs error rate is significantly higher, even after accounting for the few pdb entries with multiple predicted structures. a comparison of the predicted protein complexes with those generated from the pdb annotation revealed that a total of 17% of the predicted complexes are different, i.e. have different stoichiometry. a further breakdown of these complexes by type is shown in table it is apparent that there are considerably more complexes that are predicted to be homomultimers but in the biomt record they are annotated as monomers than the converse. one possible explanation is that x-ray structures of a single protein are annotated as a monomer by default if no experimental information on their oligomeric state is available. figure shows an example of one such case in which the complex structure was successfully predicted but the pdb annotation was incorrect. unfortunately, the large number of pdb entries with disagreements between the predicted complexes and pdb annotation precludes manual verification of their correctness. each complex is classified as either monomer, homomultimer, or heteromultimer. analysis of domain contacts in predicted biological complexes the prediction method for protein complexes also yields clusters of related protein-protein interfaces found in biological complexes. these predicted pfam-a domain-domain contacts were compared with those in the ipfam and 3did databases. the overlap between the different sets of domain-domain contacts in each database is shown in figure this figure does not include the additional distinct pfam contacts containing a pfam-b domain that are present in the predicted biological complexes but not included in either ipfam or 3did. interestingly, pfam domain-domain contacts are predicted very differently in the ipfam and 3did databases. this difference alone is a strong indication that further analysis is needed. indeed, the ipfam database includes all contacts, both specific and non-specific and the 3did database used an empirical residue contact score to remove possible non-specific contacts. even more importantly, neither of these databases includes symmetry-related chains so that many specific contacts are necessarily missing as they simply are not included for consideration. our algorithm aims to include only specific contacts in predicted biological complexes, and we take special care to enumerate all contacts observed in the x-ray crystal structures by applying the necessary symmetry operations. of course, biological applications relying on these databases are mostly interested in the biologically relevant domain interactions rather than crystal contacts. online database of protein complexes a searchable database of all predicted protein complexes is available online. search fields include the pdb entry name, text in the complex or subunit description, interface cluster number, or the pfam accession number. the complex structures matching the query are presented both explicitly as three-dimensional structures and schematically as graphs in which nodes represent subunits and edges represent contacts. in addition, all data files are directly available for download by ftp.  high-resolution structures provide unique information about biological complexes, which is not available by any other experimental or theoretical method. in addition to being the most reliable evidence for the existence of the complex, high-resolution structures give clues about functional mechanisms, elucidate stoichiometry requirements, and allow functional comparisons with orthologs from other species. in many cases a high-resolution structure can be used to guide further experimental work, e.g. discovery of small molecules modulating the formation or function of the complex. the reconstruction of a complete biological subunit proved to be a complex computational problem both due to the amount of the required technical work and due to fundamental difficulties of differentiating between biological and non-biological contacts. separate questions arise from the presence of incomplete protein complexes. in those cases the crystallized assembly is only part of true biological complex. the pdb biomt annotation is known to contain a large number of incorrect annotations, and two other previously developed approaches provide alternative annotations. the validity of this information is very important, as it is utilized in a large number of other databases without modification and without any further critical analysis. these derived databases are used for comparative genomics studies, reconstruction of cellular pathways, etc. and the errors introduced at the annotation stage adversely affect all results derived from them. our method has demonstrated an almost two-fold reduction of the error rate for predictions on a large set of protein complexes manually assigned through analysis of available biological literature. the error rate for our method was 11% as compared with error rates of 17–18% for pqs and approximately 24% for pisa. there was also a smaller reduction in the error rate for a subset of protein complexes from ponstingl et al. from 16% for that method to 13% for the method described here. another result of our work is the clustering of similar interfaces. the enforced similarity guarantees that two parts of the interface not only have similar biological sequences, but also have similar spatial arrangements. the groups are created for all contacts found in the pdb. the availability of interface clusters opens several possibilities for further analysis. for example, it is possible to check the literature for biological evidence of a particular interface by using sources related to all pdb complexes containing it. this could greatly increase our confidence in the annotation of the difficult cases, both on the level of individual interfaces and on the level of complete complexes. further analysis of these interface groups and how they co-occur in complexes may give insights into the evolutionary history of protein complexes. an analysis of the contribution of each interface property to the accurate random forest prediction of protein-protein interfaces showed that the interface area, number of intramolecular hydrogen bonds, evolutionary conservation, over-represented interface residues and residue-residue contacts, and interface packing density contributed the most. an important advantage of the random forest method over other machine learning methods is that it can use all of these diverse properties, without adjusting their relative normalization, in order to make an accurate prediction. the observed reduction of the error rate is both significant and valuable for applications, but in our opinion it is also surprising that it remains relatively high. in our study we used a comprehensive set of interface characteristics, but obviously more has to be done to understand what governs contacts under biological conditions. several further directions for study are possible. one of the most interesting would be to combine our machine learning approach with free energy calculations as suggested by the approach used for the pisa database. another possible direction could involve algorithms to integrate information from several interfaces together with "global" information about complex. in our work we have used biomt stoichiometry as such global information, but many problems remains unresolved, in particular the relative weights assigned to global and local components. finally, we found relatively little agreement on which pfam domains form contacts in protein complexes among complexes predicted from our method and those in the ipfam and 3did databases. we attribute this discrepancy mainly to crystal contacts and missing subunits in the other databases due to ignoring symmetry-related chains. it would be interesting to also compare the set of interacting pfam domains in the complexes identified by our method with those predicted from yeast two-hybrid data. availability and requirements protein interface server: authors' contributions ab conceived the prediction methodology and carried out the calculations. both authors participated in the analysis of the results, database website design, and drafting the manuscript. both authors read and approved the final manuscript. supplementary material additional file 1 benchmark set of protein complex structures with prediction results. the file is a tab-separated table with the following columns: pdb entry; correct oligomeric state; data source; oligomeric state of the complex predicted by our method; oligomeric state of the complex predicted by pqs; total number of subunits in the complex predicted by pisa; and oligomeric state of the pdb biomt complex. click here for file acknowledgements the bioenergy science center is a u.s. department of energy bioenergy research center supported by the office of biological and environmental research in the doe office of science. the work was partially funded by erkp "an integrated knowledge base for the shewanella federation" from the doe office of biological and environmental research, and the mayo clinic. we wish to thank jeff holmes for the pins website development.
we have developed a method for identifying protein complexes in the pdb x-ray structures by a four step procedure: comprehensively collecting all protein-protein interfaces; clustering similar protein-protein interfaces together; estimating the probability that each cluster is relevant based on a diverse set of properties; and combining these scores for each pdb entry in order to predict the complex structure. our method demonstrates an almost two-fold reduction of the annotation error rate as evaluated on a large benchmark set of complexes validated from the literature. high-resolution x-ray crystallographic structures of protein complexes can reveal the details of their function and provide a basis for many computational and experimental approaches. these interfaces, as well as the predicted protein complexes, are available from the protein interface server website. protein-protein interactions are ubiquitous and essential for all cellular processes. the resulting clusters of biologically relevant interfaces provide a reliable catalog of evolutionary conserved protein-protein interactions. we also estimate relative contributions of each interface property to the accurate discrimination of biologically relevant interfaces and discuss possible directions for further improving the prediction method. differentiation between biological and non-biological contacts and reconstruction of the intact complex is a challenging computational problem.
 protein-protein interactions are ubiquitous and essential for all cellular processes. high-resolution x-ray crystallographic structures of protein complexes can reveal the details of their function and provide a basis for many computational and experimental approaches. differentiation between biological and non-biological contacts and reconstruction of the intact complex is a challenging computational problem. a successful solution can provide additional insights into the fundamental principles of biological recognition and reduce errors in many algorithms and databases utilizing interaction information extracted from the protein data bank.  we have developed a method for identifying protein complexes in the pdb x-ray structures by a four step procedure: comprehensively collecting all protein-protein interfaces; clustering similar protein-protein interfaces together; estimating the probability that each cluster is relevant based on a diverse set of properties; and combining these scores for each pdb entry in order to predict the complex structure. the resulting clusters of biologically relevant interfaces provide a reliable catalog of evolutionary conserved protein-protein interactions. these interfaces, as well as the predicted protein complexes, are available from the protein interface server website.  our method demonstrates an almost two-fold reduction of the annotation error rate as evaluated on a large benchmark set of complexes validated from the literature. we also estimate relative contributions of each interface property to the accurate discrimination of biologically relevant interfaces and discuss possible directions for further improving the prediction method. 