An iterative knowledge-based scoring function for protein-protein recognition

Using an efficient iterative method, we have developed a distance-dependent knowledge-based scoring function to predict protein-protein interactions. The function, referred to as ITScore-PP, was derived using the crystal structures of a training set of 851 protein-protein dimeric complexes containing true biological interfaces. The key idea of the iterative method for deriving ITScore-PP is to improve the interatomic pair potentials by iteration, until the pair potentials can distinguish true binding modes from decoy modes for the protein-protein complexes in the training set. The iterative method circumvents the challenging reference state problem in deriving knowledge-based potentials. The derived scoring function was used to evaluate the ligand orientations generated by ZDOCK 2.1 and the native ligand structures on a diverse set of 91 protein-protein complexes. For the bound test cases, ITScore-PP yielded a success rate of 98.9% if the top 10 ranked orientations were considered. For the more realistic unbound test cases, the corresponding success rate was 40.7%. Furthermore, for faster orientational sampling purpose, several residue-level knowledge-based scoring functions were also derived following the similar iterative procedure. Among them, the scoring function that uses the side-chain center of mass (SCM) to represent a residue, referred to as ITScore-PP(SCM), showed the best performance and yielded success rates of 71.4% and 30.8% for the bound and unbound cases, respectively, when the top 10 orientations were considered. ITScore-PP was further tested using two other published protein-protein docking decoy sets, the ZDOCK decoy set and the RosettaDock decoy set. In addition to binding mode prediction, the binding scores predicted by ITScore-PP also correlated well with the experimentally determined binding affinities, yielding a correlation coefficient of R = 0.71 on a test set of 74 protein-protein complexes with known affinities. ITScore-PP is computationally efficient. The average run time for ITScore-PP was about 0.03 second per orientation (including optimization) on a personal computer with 3.2 GHz Pentium IV CPU and 3.0 GB RAM. The computational speed of ITScore-PP(SCM) is about an order of magnitude faster than that of ITScore-PP. ITScore-PP and/or ITScore-PP(SCM) can be combined with efficient protein docking software to study protein-protein recognition.     

A combination of rescoring and refinement significantly improves protein docking performance

To determine the structures of protein-protein interactions, protein docking is a valuable tool that complements experimental methods to characterize protein complexes. Although protein docking can often produce a near-native solution within a set of global docking predictions, there are sometimes predictions that require refinement to elucidate correct contacts and conformation. Previously, we developed the ZRANK algorithm to rerank initial docking predictions from ZDOCK, a docking program developed by our lab. In this study, we have applied the ZRANK algorithm toward refinement of protein docking models in conjunction with the protein docking program RosettaDock. This was performed by reranking global docking predictions from ZDOCK, performing local side chain and rigid-body refinement using RosettaDock, and selecting the refined model based on ZRANK score. For comparison, we examined using RosettaDock score instead of ZRANK score, and a larger perturbation size for the RosettaDock search, and determined that the larger RosettaDock perturbation size with ZRANK scoring was optimal. This method was validated on a protein-protein docking benchmark. For refining docking benchmark predictions from the newest ZDOCK version, this led to improved structures of top-ranked hits in 20 of 27 cases, and an increase from 23 to 27 cases with hits in the top 20 predictions. Finally, we optimized the ZRANK energy function using refined models, which provides a significant improvement over the original ZRANK energy function. Using this optimized function and the refinement protocol, the numbers of cases with hits ranked at number one increased from 12 to 19 and from 7 to 15 for two different ZDOCK versions. This shows the effective combination of independently developed docking protocols (ZDOCK/ZRANK, and RosettaDock), indicating that using diverse search and scoring functions can improve protein docking results.     

Docking unbound proteins using shape complementarity, desolvation, and electrostatics

A comprehensive docking study was performed on 27 distinct protein-protein complexes. For 13 test systems, docking was performed with the unbound X-ray structures of both the receptor and the ligand. For the remaining systems, the unbound X-ray structure of only molecule was available; therefore the bound structure for the other molecule was used. Our method optimizes desolvation, shape complementarity, and electrostatics using a Fast Fourier Transform algorithm. A global search in the rotational and translational space without any knowledge of the binding sites was performed for all proteins except nine antibodies recognizing antigens. For these antibodies, we docked their well-characterized binding site-the complementarity-determining region defined without information of the antigen-to the entire surface of the antigen. For 24 systems, we were able to find near-native ligand orientations (interface C(alpha) root mean square deviation less than 2.5 A from the crystal complex) among the top 2,000 choices. For three systems, our algorithm could identify the correct complex structure unambiguously. For 13 other complexes, we either ranked a near-native structure in the top 20 or obtained 20 or more near-native structures in the top 2,000 or both. The key feature of our algorithm is the use of target functions that are highly tolerant to conformational changes upon binding. If combined with a post-processing method, our algorithm may provide a general solution to the unbound docking problem. Our program, called ZDOCK, is freely available to academic users (http://zlab.bu.edu/~rong/dock/).     

Identification of near-native structures by clustering protein docking conformations

Most state-of-the-art protein-protein docking algorithms use the Fast Fourier Transform (FFT) technique to sample the six-dimensional translational and rotational space. Scoring functions including shape complementarity, electrostatics, and desolvation are usually exploited in ranking the docking conformations. While these rigid-body docking methods provide good performance in bound docking, using unbound structures as input frequently leads to a high number of false positive hits. For the purpose of better selecting correct docking conformations, we structurally cluster the docking decoys generated by four widely-used FFT-based protein-protein docking methods. In all cases, the selection based on cluster size outperforms the ranking based on the inherent scoring function. If we cluster decoys from different servers together, only marginal improvement is obtained in comparison with clustering decoys from the best individual server. A collection of multiple decoy sets of comparable quality will be the key to improve the clustering result from meta-docking servers.     

RDOCK: refinement of rigid-body protein docking predictions

We present a simple and effective algorithm RDOCK for refining unbound predictions generated by a rigid-body docking algorithm ZDOCK, which has been developed earlier by our group. The main component of RDOCK is a three-stage energy minimization scheme, followed by the evaluation of electrostatic and desolvation energies. Ionic side chains are kept neutral in the first two stages of minimization, and reverted to their full charge states in the last stage of brief minimization. Without side chain conformational search or filtering/clustering of resulting structures, RDOCK represents the simplest approach toward refining unbound docking predictions. Despite its simplicity, RDOCK makes substantial improvement upon the top predictions by ZDOCK with all three scoring functions and the improvement is observed across all three categories of test cases in a large benchmark of 49 non-redundant unbound test cases. RDOCK makes the most powerful combination with ZDOCK2.1, which uses pairwise shape complementarity as the scoring function. Collectively, they rank a near-native structure as the number-one prediction for 18 test cases (37% of the benchmark), and within the top 4 predictions for 24 test cases (49% of the benchmark). To various degrees, funnel-like energy landscapes are observed for these 24 test cases. To the best of our knowledge, this is the first report of binding funnels starting from global searches for a broad range of test cases. These results are particularly exciting, given that we have not used any biological information that is specific to individual test cases and the whole process is entirely automated. Among three categories of test cases, the best results are seen for enzyme/inhibitor, with a near-native structure ranked as the number-one prediction for 48% test cases, and within the top 10 predictions for 78% test cases. RDOCK is freely available to academic users at http://zlab.bu.edu/ approximately rong/dock.     

DOCKGROUND system of databases for protein recognition studies: unbound structures for docking

Computational docking approaches are important as a source of protein-protein complexes structures and as a means to understand the principles of protein association. A key element in designing better docking approaches, including search procedures, potentials, and scoring functions is their validation on experimentally determined structures. Thus, the databases of such structures (benchmark sets) are important. The previous, first release of the DOCKGROUND resource (Douguet et al., Bioinformatics 2006; 22:2612-2618) implemented a comprehensive database of cocrystallized (bound) protein-protein complexes in a relational database of annotated structures. The current release adds important features to the set of bound structures, such as regularly updated downloadable datasets: automatically generated nonredundant set, built according to most common criteria, and a manually curated set that includes only biological nonobligate complexes along with a number of additional useful characteristics. The main focus of the current release is unbound (experimental and simulated) protein-protein complexes. Complexes from the bound dataset are used to identify crystallized unbound analogs. If such analogs do not exist, the unbound structures are simulated by rotamer library optimization. Thus, the database contains comprehensive sets of complexes suitable for large scale benchmarking of docking algorithms. Advanced methodologies for simulating unbound conformations are being explored for the next release. The future releases will include datasets of modeled protein-protein complexes, and systematic sets of docking decoys obtained by different docking algorithms. The growing DOCKGROUND resource is designed to become a comprehensive public environment for developing and validating new docking methodologies.     

Protein-protein docking with a reduced protein model accounting for side-chain flexibility

A protein-protein docking approach has been developed based on a reduced protein representation with up to three pseudo atoms per amino acid residue. Docking is performed by energy minimization in rotational and translational degrees of freedom. The reduced protein representation allows an efficient search for docking minima on the protein surfaces within. During docking, an effective energy function between pseudo atoms has been used based on amino acid size and physico-chemical character. Energy minimization of protein test complexes in the reduced representation results in geometries close to experiment with backbone root mean square deviations (RMSDs) of approximately 1 to 3 A for the mobile protein partner from the experimental geometry. For most test cases, the energy-minimized experimental structure scores among the top five energy minima in systematic docking studies when using both partners in their bound conformations. To account for side-chain conformational changes in case of using unbound protein conformations, a multicopy approach has been used to select the most favorable side-chain conformation during the docking process. The multicopy approach significantly improves the docking performance, using unbound (apo) binding partners without a significant increase in computer time. For most docking test systems using unbound partners, and without accounting for any information about the known binding geometry, a solution within approximately 2 to 3.5 A RMSD of the full mobile partner from the experimental geometry was found among the 40 top-scoring complexes. The approach could be extended to include protein loop flexibility, and might also be useful for docking of modeled protein structures.     

Flexible relaxation of rigid-body docking solutions

Molecular Dynamics (MD) simulations have been performed on a set of rigid-body docking poses, carried out over 25 protein-protein complexes. The results show that fully flexible relaxation increases the fraction of native contacts (NC) by up to 70% for certain docking poses. The largest increase in the fraction of NC is observed for docking poses where anchor residues are able to sample their bound conformation. For each MD simulation, structural snap-shots were clustered and the centre of each cluster used as the MD-relaxed docking pose. A comparison between two energy-based scoring schemes, the first calculated for the MD-relaxed poses, the second for energy minimized poses, shows that the former are better in ranking complexes with large hydrophobic interfaces. Furthermore, complexes with large interfaces are generally ranked well, regardless of the type of relaxation method chosen, whereas complexes with small hydrophobic interfaces remain difficult to rank. In general, the results indicate that current force-fields are able to correctly describe direct intermolecular interactions between receptor and ligand molecules. However, these force-fields still fail in cases where protein-protein complexes are stabilized by subtle energy contributions.     

Assessment of CAPRI predictions in rounds 3-5 shows progress in docking procedures

The current status of docking procedures for predicting protein-protein interactions starting from their three-dimensional (3D) structure is reassessed by evaluating blind predictions, performed during 2003-2004 as part of Rounds 3-5 of the community-wide experiment on Critical Assessment of PRedicted Interactions (CAPRI). Ten newly determined structures of protein-protein complexes were used as targets for these rounds. They comprised 2 enzyme-inhibitor complexes, 2 antigen-antibody complexes, 2 complexes involved in cellular signaling, 2 homo-oligomers, and a complex between 2 components of the bacterial cellulosome. For most targets, the predictors were given the experimental structures of 1 unbound and 1 bound component, with the latter in a random orientation. For some, the structure of the free component was derived from that of a related protein, requiring the use of homology modeling. In some of the targets, significant differences in conformation were displayed between the bound and unbound components, representing a major challenge for the docking procedures. For 1 target, predictions could not go to completion. In total, 1866 predictions submitted by 30 groups were evaluated. Over one-third of these groups applied completely novel docking algorithms and scoring functions, with several of them specifically addressing the challenge of dealing with side-chain and backbone flexibility. The quality of the predicted interactions was evaluated by comparison to the experimental structures of the targets, made available for the evaluation, using the well-agreed-upon criteria used previously. Twenty-four groups, which for the first time included an automatic Web server, produced predictions ranking from acceptable to highly accurate for all targets, including those where the structures of the bound and unbound forms differed substantially. These results and a brief survey of the methods used by participants of CAPRI Rounds 3-5 suggest that genuine progress in the performance of docking methods is being achieved, with CAPRI acting as the catalyst.     

Electrostatic contributions to protein-protein interactions: fast energetic filters for docking and their physical basis

The methods of continuum electrostatics are used to calculate the binding free energies of a set of protein-protein complexes including experimentally determined structures as well as other orientations generated by a fast docking algorithm. In the native structures, charged groups that are deeply buried were often found to favor complex formation (relative to isosteric nonpolar groups), whereas in nonnative complexes generated by a geometric docking algorithm, they were equally likely to be stabilizing as destabilizing. These observations were used to design a new filter for screening docked conformations that was applied, in conjunction with a number of geometric filters that assess shape complementarity, to 15 antibody-antigen complexes and 14 enzyme-inhibitor complexes. For the bound docking problem, which is the major focus of this paper, native and near-native solutions were ranked first or second in all but two enzyme-inhibitor complexes. Less success was encountered for antibody-antigen complexes, but in all cases studied, the more complete free energy evaluation was able to identify native and near-native structures. A filter based on the enrichment of tyrosines and tryptophans in antibody binding sites was applied to the antibody-antigen complexes and resulted in a native and near-native solution being ranked first and second in all cases. A clear improvement over previously reported results was obtained for the unbound antibody-antigen examples as well. The algorithm and various filters used in this work are quite efficient and are able to reduce the number of plausible docking orientations to a size small enough so that a final more complete free energy evaluation on the reduced set becomes computationally feasible.     

Use of pair potentials across protein interfaces in screening predicted docked complexes.

Empirical residue-residue pair potentials are used to screen possible complexes for protein-protein dockings. A correct docking is defined as a complex with not more than 2.5 A root-mean-square distance from the known experimental structure. The complexes were generated by "ftdock" (Gabb et al. J Mol Biol 1997;272:106-120) that ranks using shape complementarity. The complexes studied were 5 enzyme-inhibitors and 2 antibody-antigens, starting from the unbound crystallographic coordinates, with a further 2 antibody-antigens where the antibody was from the bound crystallographic complex. The pair potential functions tested were derived both from observed intramolecular pairings in a database of nonhomologous protein domains, and from observed intermolecular pairings across the interfaces in sets of nonhomologous heterodimers and homodimers. Out of various alternate strategies, we found the optimal method used a mole-fraction calculated random model from the intramolecular pairings. For all the systems, a correct docking was placed within the top 12% of the pair potential score ranked complexes. A combined strategy was developed that incorporated "multidock," a side-chain refinement algorithm (Jackson et al. J Mol Biol 1998;276:265-285). This placed a correct docking within the top 5 complexes for enzyme-inhibitor systems, and within the top 40 complexes for antibody-antigen systems.     

A protein-protein docking benchmark

We have developed a nonredundant benchmark for testing protein-protein docking algorithms. Currently it contains 59 test cases: 22 enzyme-inhibitor complexes, 19 antibody-antigen complexes, 11 other complexes, and 7 difficult test cases. Thirty-one of the test cases, for which the unbound structures of both the receptor and ligand are available, are classified as follows: 16 enzyme-inhibitor, 5 antibody-antigen, 5 others, and 5 difficult. Such a centralized resource should benefit the docking community not only as a large curated test set but also as a common ground for comparing different algorithms. The benchmark is available at (http://zlab.bu.edu/~rong/dock/benchmark.shtml).     

A knowledge-based scoring function for protein-RNA interactions derived from a statistical mechanics-based iterative method

Protein-RNA interactions play important roles in many biological processes. Given the high cost and technique difficulties in experimental methods, computationally predicting the binding complexes from individual protein and RNA structures is pressingly needed, in which a reliable scoring function is one of the critical components. Here, we have developed a knowledge-based scoring function, referred to as ITScore-PR, for protein-RNA binding mode prediction by using a statistical mechanics-based iterative method. The pairwise distance-dependent atomic interaction potentials of ITScore-PR were derived from experimentally determined protein–RNA complex structures. For validation, we have compared ITScore-PR with 10 other scoring methods on four diverse test sets. For bound docking, ITScore-PR achieved a success rate of up to 86% if the top prediction was considered and up to 94% if the top 10 predictions were considered, respectively. For truly unbound docking, the respective success rates of ITScore-PR were up to 24 and 46%. ITScore-PR can be used stand-alone or easily implemented in other docking programs for protein–RNA recognition.     

Scoring protein interaction decoys using exposed residues (SPIDER): a novel multibody interaction scoring function based on frequent geometric patterns of interfacial residues

Accurate prediction of the structure of protein-protein complexes in computational docking experiments remains a formidable challenge. It has been recognized that identifying native or native-like poses among multiple decoys is the major bottleneck of the current scoring functions used in docking. We have developed a novel multibody pose-scoring function that has no theoretical limit on the number of residues contributing to the individual interaction terms. We use a coarse-grain representation of a protein-protein complex where each residue is represented by its side chain centroid. We apply a computational geometry approach called Almost-Delaunay tessellation that transforms protein-protein complexes into a residue contact network, or an undirectional graph where vertex-residues are nodes connected by edges. This treatment forms a family of interfacial graphs representing a dataset of protein-protein complexes. We then employ frequent subgraph mining approach to identify common interfacial residue patterns that appear in at least a subset of native protein-protein interfaces. The geometrical parameters and frequency of occurrence of each "native" pattern in the training set are used to develop the new SPIDER scoring function. SPIDER was validated using standard "ZDOCK" benchmark dataset that was not used in the development of SPIDER. We demonstrate that SPIDER scoring function ranks native and native-like poses above geometrical decoys and that it exceeds in performance a popular ZRANK scoring function. SPIDER was ranked among the top scoring functions in a recent round of CAPRI (Critical Assessment of PRedicted Interactions) blind test of protein-protein docking methods.     

A combinatorial scoring function for protein–RNA docking

Protein–RNA docking is still an open question. One of the main challenges is to develop an effective scoring function that can discriminate near‐native structures from the incorrect ones. To solve the problem, we have constructed a knowledge‐based residue‐nucleotide pairwise potential with secondary structure information considered for nonribosomal protein–RNA docking. Here we developed a weighted combined scoring function RpveScore that consists of the pairwise potential and six physics‐based energy terms. The weights were optimized using the multiple linear regression method by fitting the scoring function to L_rmsd for the bound docking decoys from Benchmark II. The scoring functions were tested on 35 unbound docking cases. The results show that the scoring function RpveScore including all terms performs best. Also RpveScore was compared with the statistical mechanics‐based method derived potential ITScore‐PR, and the united atom‐based statistical potentials QUASI‐RNP and DARS‐RNP. The success rate of RpveScore is 71.6% for the top 1000 structures and the number of cases where a near‐native structure is ranked in top 30 is 25 out of 35 cases. For 32 systems (91.4%), RpveScore can find the binding mode in top 5 that has no lower than 50% native interface residues on protein and nucleotides on RNA. Additionally, it was found that the long‐range electrostatic attractive energy plays an important role in distinguishing near‐native structures from the incorrect ones. This work can be helpful for the development of protein–RNA docking methods and for the understanding of protein–RNA interactions. RpveScore program is available to the public at http://life.bjut.edu.cn/kxyj/kycg/2017116/14845362285362368_1.html Proteins 2017; 85:741–752. © 2016 Wiley Periodicals, Inc.     

Improving ranking of models for protein complexes with side chain modeling and atomic potentials

An atomically detailed potential for docking pairs of proteins is derived using mathematical programming. A refinement algorithm that builds atomically detailed models of the complex and combines coarse grained and atomic scoring is introduced. The refinement step consists of remodeling the interface side chains of the top scoring decoys from rigid docking followed by a short energy minimization. The refined models are then re‐ranked using a combination of coarse grained and atomic potentials. The docking algorithm including the refinement and re‐ranking, is compared favorably to other leading docking packages like ZDOCK, Cluspro, and PATCHDOCK, on the ZLAB 3.0 Benchmark and a test set of 30 novel complexes. A detailed analysis shows that coarse grained potentials perform better than atomic potentials for realistic unbound docking (where the exact structures of the individual bound proteins are unknown), probably because atomic potentials are more sensitive to local errors. Nevertheless, the atomic potential captures a different signal from the residue potential and as a result a combination of the two scores provides a significantly better prediction than each of the approaches alone. Proteins 2013. © 2012 Wiley Periodicals, Inc.     

H‐bond network optimization in protein–protein complexes: Are all‐atom force field scores enough?

Structural prediction of protein-protein complexes given the structures of the two interacting compounds in their unbound state is a key problem in biophysics. In addition to the problem of sampling of near-native orientations, one of the modeling main difficulties is to discriminate true from false positives. Here, we present a hierarchical protocol for docking refinement able to discriminate near native poses from a group of docking candidates. The main idea is to combine an efficient sampling of the full system hydrogen bond network and side chains, together with an all-atom force field and a surface generalized born implicit solvent. We tested our method on a set of twenty two complexes containing a near-native solution within the top 100 docking poses, obtaining a near native solution as the top pose in 70% of the cases. We show that all atom force fields optimized H-bond networks do improve significantly state of the art scoring functions.     

Docking enzyme-inhibitor complexes using a preference-based free-energy surface

We present a docking scheme that utilizes both a surface complementarity screen as well as an energetic criterion based on surface area burial. Twenty rigid enzyme/inhibitor complexes with known coordinate sets are arbitrarily separated and reassembled to an average all-atom rms (root mean square) deviation of 1.0 Å from the native complexes. Docking is accomplished by a hierarchical search of geometrically compatible triplets of surface normals on each molecule. A pruned tree of possible bound configurations is built up using successive consideration of larger and larger triplets. The best scoring configurations are then passed through a free-energy screen where the lowest energy member is selected as the predicted native state. The free energy approximation is derived from observations of surface burial by atom pairs across the interface of known enzyme/inhibitor complexes. The occurrence of specific atom-atom surface burial, for a set of complexes with well-defined secondary structure both in the bound and unbound states, is parameterized to mimic the free energy of binding. The docking procedure guides the inhibitor into its native state using orientation and distance-dependent functions that reproduce the ideal model of free energies with an average rms deviation of 0.9 kcal/mol. For all systems studied, this docking procedure identifies a single, unique minimum energy configuration that is highly compatible with the native state. © 1996 Wiley-Liss, Inc.     

Automated docking of peptides and proteins by using a genetic algorithm combined with a tabu search.

A genetic algorithm (GA) combined with a tabu search (TA) has been applied as a minimization method to rake the appropriate associated sites for some biomolecular systems. In our docking procedure, surface complementarity and energetic complementarity of a ligand with its receptor have been considered separately in a two-stage docking method. The first stage was to find a set of potential associated sites mainly based on surface complementarity using a genetic algorithm combined with a tabu search. This step corresponds with the process of finding the potential binding sites where pharmacophores will bind. In the second stage, several hundreds of GA minimization steps were performed for each associated site derived from the first stage mainly based on the energetic complementarity. After calculations for both of the two stages, we can offer several solutions of associated sites for every complex. In this paper, seven biomolecular systems, including five bound complexes and two unbound complexes, were chosen from the Protein Data Bank (PDB) to test our method. The calculated results were very encouraging-the hybrid minimization algorithm successfully reaches the correct solutions near the best binded modes for these protein complexes. The docking results not only predict the bound complexes very well, but also get a relatively accurate complexed conformation for unbound systems. For the five bound complexes, the results show that surface complementarity is enough to find the precise binding modes, the top solution from the tabu list generally corresponds to the correct binding mode. For the two unbound complexes, due to the conformational changes upon binding, it seems more difficult to get their correct binding conformations. The predicted results show that the correct binding mode also corresponds to a relatively large surface complementarity score. In these two test cases, the correct solution can be found in the top several solutions from the tabu list. For unbound complexes, the interaction energy from energetic complementarity is very important, it can be used to filter these solutions from the surface complementarity. After the evaluation of the energetic complementarity, the conformations and orientations close to the crystallographically determined structures are resolved. In most cases, the smallest root mean square distance (r.m.s.d.) from the GA combined with TA solutions is in a relatively small region. Our program of automatic docking is really a universal one among the procedures used for the theoretical study of molecular recognition.     

Refinement of unbound protein docking studies using biological knowledge

In this work we present two methods for the reranking of protein-protein docking studies. One scoring method searches the InterDom database for domains that are available in the proteins to be docked and evaluates the interaction of these domains in other complexes of known structure. The second one analyzes the interface of each proposed conformation with regard to the conservation of Phe, Met, and Trp and their polar neighbor residues. The special relevance of these residues is based on a publication by Ma et al. (Proc Natl Acad Sci USA 2003;100:5772-5777), who compared the conservation of all residues in the interface region to the conservation on the rest of the protein's surface. The scoring functions were tested on 30 unbound docking test cases. The evaluation of the methods is based on the ability to rerank the output of a Fast Fourier Transformation (FFT) docking. Both were able to improve the ranking of the docking output. The best improvement was achieved for enzyme-inhibitor examples. Especially the domain-based scoring function was successful and able to place a near-native solution on one of the first six ranks for 13 of 17 (76%) enzyme-inhibitor complexes [in 53% (nine complexes) even on the first rank]. The method evaluating residue conservation allowed us to increase the number of good solutions within the first 100 ranks out of approximately 9000 in 82% of the 17 enzyme-inhibitor test cases, and for seven (41%) out of 17 enzyme-inhibitor complexes, a near native solution was placed within the first seven ranks.