Biologically enhanced sampling geometric docking and backbone flexibility treatment with multiconformational superposition

An efficient biologically enhanced sampling geometric docking method is presented based on the FTDock algorithm to predict the protein-protein binding modes. The active site data from different sources, such as biochemical and biophysical experiments or theoretical analyses of sequence data, can be incorporated in the rotation-translation scan. When discretizing a protein onto a 3-dimensional (3D) grid, a zero value is given to grid points outside a sphere centered on the geometric center of specified residues. In this way, docking solutions are biased toward modes where the interface region is inside the sphere. We also adopt a multiconformational superposition scheme to represent backbone flexibility in the proteins. When these procedures were applied to the targets of CAPRI, a larger number of hits and smaller ligand root-mean-square deviations (RMSDs) were obtained at the conformational search stage in all cases, and especially Target 19. With Target 18, only 1 near-native structure was retained by the biologically enhanced sampling geometric docking method, but this number increased to 53 and the least ligand RMSD decreased from 8.1 A to 2.9 A after performing multiconformational superposition. These results were obtained after the CAPRI prediction deadlines.     

RosettaDock in CAPRI rounds 6-12

A challenge in protein-protein docking is to account for the conformational changes in the monomers that occur upon binding. The RosettaDock method, which incorporates sidechain flexibility but keeps the backbone fixed, was found in previous CAPRI rounds (4 and 5) to generate docking models with atomic accuracy, provided that conformational changes were mainly restricted to protein sidechains. In the recent rounds of CAPRI (6-12), large backbone conformational changes occur upon binding for several target complexes. To address these challenges, we explicitly introduced backbone flexibility in our modeling procedures by combining rigid-body docking with protein structure prediction techniques such as modeling variable loops and building homology models. Encouragingly, using this approach we were able to correctly predict a significant backbone conformational change of an interface loop for Target 20 (12 A rmsd between those in the unbound monomer and complex structures), but accounting for backbone flexibility in protein-protein docking is still very challenging because of the significantly larger conformational space, which must be surveyed. Motivated by these CAPRI challenges, we have made progress in reformulating RosettaDock using a "fold-tree" representation, which provides a general framework for treating a wide variety of flexible-backbone docking problems.     

Performance of human and server prediction in CAPRI rounds 38-45

CAPRI challenges offer a variety of blind tests for protein-protein interaction prediction. In CAPRI Rounds 38-45, we generated a set of putative binding modes for each target with an FFT-based docking algorithm, and then scored and ranked these binding modes with a proprietary scoring function, ITScorePP. We have also developed a novel web server, Rebipp. The algorithm utilizes information retrieval to identify relevant biological information to significantly reduce the search space for a particular protein. In parallel, we have also constructed a GPU-based docking server, MDockPP, for protein-protein complex structure prediction. Here, the performance of our protocol in CAPRI rounds 38-45 is reported, which include 16 docking and scoring targets. Among them, three targets contain multiple interfaces: Targets 124, 125, and 136 have 2, 4, and 3 interfaces, respectively. In the predictor experiments, we predicted correct binding modes for nine targets, including one high-accuracy interface, six medium-accuracy binding modes, and six acceptable-accuracy binding modes. For the docking server prediction experiments, we predicted correct binding modes for eight targets, including one high-accuracy, three medium-accuracy, and five acceptable-accuracy binding modes.     

Template-based modeling of diverse protein interactions in CAPRI rounds 38-45

Structures of proteins complexed with other proteins, peptides, or ligands are essential for investigation of molecular mechanisms. However, the experimental structures of protein complexes of interest are often not available. Therefore, computational methods are widely used to predict these structures, and, of those methods, template-based modeling is the most successful. In the rounds 38-45 of the Critical Assessment of PRediction of Interactions (CAPRI), we applied template-based modeling for 9 of 11 protein-protein and protein-peptide interaction targets, resulting in medium and high-quality models for six targets. For the protein-oligosaccharide docking targets, we used constraints derived from template structures, and generated models of at least acceptable quality for most of the targets. Apparently, high flexibility of oligosaccharide molecules was the main cause preventing us from obtaining models of higher quality. We also participated in the CAPRI scoring challenge, the goal of which was to identify the highest quality models from a large pool of decoys. In this experiment, we tested VoroMQA, a scoring method based on interatomic contact areas. The results showed VoroMQA to be quite effective in scoring strongly binding and obligatory protein complexes, but less successful in the case of transient interactions. We extensively used manual intervention in both CAPRI modeling and scoring experiments. This oftentimes allowed us to select the correct templates from available alternatives and to limit the search space during the model scoring.     

Finding needles in haystacks: Reranking DOT results by using shape complementarity,cluster analysis,and biological information

We present an evaluation of our results for the first Critical Assessment of PRedicted Interaction (CAPRI). The methods used include the molecular docking program DOT, shape analysis tool FADE, cluster analysis and filtering based on biological data. Good results were obtained for most of the seven CAPRI targets, and for two systems, submissions having the highest number of correctly predicted contacts were produced.     

Docking essential dynamics eigenstructures

This article describes our attempts to dock the targets in CAPRI Rounds 3-5 using Hex 4.2, and it introduces a novel essential dynamics approach to generate multiple feasible conformations for docking. In the blind trial, the basic Hex algorithm found 1 high-accuracy solution for CAPRI Target 12, and several further medium- and low-accuracy solutions for Targets 11, 12, 13, and 14. Subsequent a posteriori docking of the targets using essential dynamics "eigenstructures" was found to give consistently better predictions than rigidly docking only the unbound or model-built starting structures. Some suggestions to improve this promising new approach are presented.     

Docking of protein molecular surfaces with evolutionary trace analysis

We have developed a new method to predict protein- protein complexes based on the shape complementarity of the molecular surfaces, along with sequence conservation obtained by evolutionary trace (ET) analysis. The docking is achieved by optimization of an object function that evaluates the degree of shape complementarity weighted by the conservation of the interacting residues. The optimization is carried out using a genetic algorithm in combination with Monte Carlo sampling. We applied this method to CAPRI targets and evaluated the performance systematically. Consequently, our method could achieve native-like predictions in several cases. In addition, we have analyzed the feasibility of the ET method for docking simulations, and found that the conservation information was useful only in a limited category of proteins (signal related proteins and enzymes).     

Approaching the CAPRI challenge with an efficient geometry-based docking

The last 3 rounds (3-5) of CAPRI included a wide range of docking targets. Several targets were especially challenging, since they involved large-scale movements and symmetric rearrangement, while others were based on homology models. We have approached the targets with a variety of geometry-based docking algorithms that include rigid docking, symmetric docking, and flexible docking with symmetry constraints. For all but 1 docking target, we were able to submit at least 1 acceptable quality prediction. Here, we detail for each target the prediction methods used and the specific biological data employed, and supply a retrospective analysis of the results. We highlight the advantages of our techniques, which efficiently exploit the geometric shape complementarity properties of the interaction. These enable them to run only few minutes on a standard PC even for flexible docking, thus proving their scalability toward computational genomic scale experiments. We also outline the major required enhancements, such as the introduction of side-chain position refinement and the introduction of flexibility for both docking partners.     

Template-based modeling and ab-initio docking using CoDock in CAPRI

Integration of template-based modeling, global sampling and precise scoring is crucial for the development of molecular docking programs with improved accuracy. We combined template-based modeling and ab-initio docking protocol as hybrid docking strategy called CoDock for the docking and scoring experiments of the seventh CAPRI edition. For CAPRI rounds 38-45, we obtained acceptable or better models in the top 10 submissions for eight out of the 16 evaluated targets as predictors, nine out of the 16 targets as scorers. Especially, we submitted acceptable models for all of the evaluated protein-oligosaccharide targets. For the CASP13-CAPRI experiment (round 46), we obtained acceptable or better models in the top 5 submissions for 10 out of the 20 evaluated targets as predictors, 11 out of the 20 targets as scorers. The failed cases for our group were mainly the difficult targets and the protein-peptide systems in CAPRI and CASP13-CAPRI experiments. In summary, this CAPRI edition showed that our hybrid docking strategy can be efficiently adapted to the increasing variety of challenges in the field of molecular interactions.     

Challenges and opportunities of automated protein-protein docking: HDOCK server vs human predictions in CAPRI Rounds 38-46

Protein-protein docking plays an important role in the computational prediction of the complex structure between two proteins. For years, a variety of docking algorithms have been developed, as witnessed by the critical assessment of prediction interactions (CAPRI) experiments. However, despite their successes, many docking algorithms often require a series of manual operations like modeling structures from sequences, incorporating biological information, and selecting final models. The difficulties in these manual steps have significantly limited the applications of protein-protein docking, as most of the users in the community are nonexperts in docking. Therefore, automated docking like a web server, which can give a comparable performance to human docking protocol, is pressingly needed. As such, we have participated in the blind CAPRI experiments for Rounds 38-45 and CASP13-CAPRI challenge for Round 46 with both our HDOCK automated docking web server and human docking protocol. It was shown that our HDOCK server achieved an “acceptable” or higher CAPRI-rated model in the top 10 submitted predictions for 65.5% and 59.1% of the targets in the docking experiments of CAPRI and CASP13-CAPRI, respectively, which are comparable to 66.7% and 54.5% for human docking protocol. Similar trends can also be observed in the scoring experiments. These results validated our HDOCK server as an efficient automated docking protocol for nonexpert users. Challenges and opportunities of automated docking are also discussed.     

Ranking multiple docking solutions based on the conservation of inter‐residue contacts

Molecular docking is the method of choice for investigating the molecular basis of recognition in a large number of functional protein complexes. However, correctly scoring the obtained docking solutions (decoys) to rank native‐like (NL) conformations in the top positions is still an open problem. Herein we present CONSRANK, a simple and effective tool to rank multiple docking solutions, which relies on the conservation of inter‐residue contacts in the analyzed decoys ensemble. First it calculates a conservation rate for each inter‐residue contact, then it ranks decoys according to their ability to match the more frequently observed contacts. We applied CONSRANK to 102 targets from three different benchmarks, RosettaDock, DOCKGROUND, and Critical Assessment of PRedicted Interactions (CAPRI). The method performs consistently well, both in terms of NL solutions ranked in the top positions and of values of the area under the receiver operating characteristic curve. Its ideal application is to solutions coming from different docking programs and procedures, as in the case of CAPRI targets. For all the analyzed CAPRI targets where a comparison is feasible, CONSRANK outperforms the CAPRI scorers. The fraction of NL solutions in the top ten positions in the RosettaDock, DOCKGROUND, and CAPRI benchmarks is enriched on average by a factor of 3.0, 1.9, and 9.9, respectively. Interestingly, CONSRANK is also able to specifically single out the high/medium quality (HMQ) solutions from the docking decoys ensemble: it ranks 46.2 and 70.8% of the total HMQ solutions available for the RosettaDock and CAPRI targets, respectively, within the top 20 positions. Proteins 2013. © 2013 Wiley Periodicals, Inc.     

Sampling and scoring: A marriage made in heaven

Most structure prediction algorithms consist of initial sampling of the conformational space, followed by rescoring and possibly refinement of a number of selected structures. Here we focus on protein docking, and show that while decoupling sampling and scoring facilitates method development, integration of the two steps can lead to substantial improvements in docking results. Since decoupling is usually achieved by generating a decoy set containing both non‐native and near‐native docked structures, which can be then used for scoring function construction, we first review the roles and potential pitfalls of decoys in protein–protein docking, and show that some type of decoys are better than others for method development. We then describe three case studies showing that complete decoupling of scoring from sampling is not the best choice for solving realistic docking problems. Although some of the examples are based on our own experience, the results of the CAPRI docking and scoring experiments also show that performing both sampling and scoring generally yields better results than scoring the structures generated by all predictors. Next we investigate how the selection of training and decoy sets affects the performance of the scoring functions obtained. Finally, we discuss pathways to better alignment of the two steps, and show some algorithms that achieve a certain level of integration. Although we focus on protein–protein docking, our observations most likely also apply to other conformational search problems, including protein structure prediction and the docking of small molecules to proteins.Proteins 2013; 81:1874–1884. © 2013 Wiley Periodicals, Inc.     

The targets of CAPRI rounds 6-12

Six protein-protein complexes and two homodimeric proteins involved in a variety of biological processes were offered as targets to CAPRI by crystallographers in Rounds 6-12. CAPRI predictor groups had to predict their structure by docking the free proteins, which they did with a degree of success that depended largely on the amplitude of the conformation changes. In one case at least, the prediction pointed to alternative possibilities of interactions in the crystal of a complex, showing that docking methods have value even when there is an experimental structure.     

Optimal design of protein docking potentials: efficiency and limitations

Protein-protein docking is a challenging computational problem in functional genomics, particularly when one or both proteins undergo conformational change(s) upon binding. The major challenge is to define scoring function soft enough to tolerate these changes and specific enough to distinguish between near-native and "misdocked" conformations. Using a linear programming technique, we derived protein docking potentials (PDPs) that comply with this requirement. We considered a set of 63 nonredundant complexes to this aim, and generated 400,000 putative docked complexes (decoys) based on shape complementarity criterion for each complex. The PDPs were required to yield for the native (correctly docked) structure a potential energy lower than those of all the nonnative (misdocked) structures. The energy constraints applied to all complexes led to ca. 25 million inequalities, the simultaneous solution of which yielded an optimal set of PDPs that discriminated the correctly docked (up to 4.0 A root-mean-square deviation from known complex structure) structure among the 85 top-ranking (0.02%) decoys in 59/63 examined bound-bound cases. The high performance of the potentials was further verified in jackknife tests and by ranking putative docked conformation submitted to CAPRI. In addition to their utility in identifying correctly folded complexes, the PDPs reveal biologically meaningful features that distinguish docking potentials from folding potentials.     

Local protein unfolding and pathogenesis of polyglutamine-expansion diseases

The CAPRI Challenge is a blind test of protein-protein-docking algorithms that predict the complex structure from the crystal structures of the interacting proteins. We participated in both rounds of this blind test and submitted predictions for all seven targets, relying mainly on our Fast Fourier Transform based algorithm ZDOCK that combines shape complementarity, desolvation, and electrostatics. Our group made good predictions for three targets and had at least some success with three others. Implications of the treatment of prior biological information as well as contributions of manual inspection to docking predictions are also discussed.     

Protein-protein docking using 3D-Dock in rounds 3, 4, and 5 of CAPRI

In rounds 3-5 of CAPRI, the community-wide experiment on the comparative evaluation of protein-protein docking for structure prediction, we applied the 3D-Dock software package to predict the atomic structures of nine biophysical interactions. This approach starts with an initial grid-based shape complementarity search. The product of this is a large number of potential interacting conformations that are subsequently ranked by interface residue propensities and interaction energies. Refinement through detailed energetics and optimization of side-chain positions using a rotamer library is also performed. For rounds 3, 4, and 5 of the CAPRI evaluation, where possible, we clustered functional residues on the surfaces of the monomers as an indication of binding sites, using sequence based evolutionary conservations. In certain targets this provided a very useful tool for identifying the areas of interaction. During round 5, we also applied the techniques of side-chain trimming and geometrical clustering described in the literature. Of the nine target complexes in rounds 3-5, we predicted conformations that contained at least some correct contact residues for seven of these systems. For two of the targets, we submitted predictions that were considered as medium-quality. These were a nidogen-laminin complex for target 8 (T08) and a serine-threonine phosphatase bound to a targeting subunit (T14). For a further three target systems, we produced models that were rated as acceptable predictions.     

Optimized grid-based protein-protein docking as a global search tool followed by incorporating experimentally derivable restraints

Unbound protein docking, or the computational prediction of the structure of a protein complex from the structures of its separated components, is of importance but still challenging. A practical approach toward reliable results for unbound docking is to incorporate experimentally derived information with computation. To this end, truly systematic search of the global docking space is desirable. The fast Fourier transform (FFT) docking is a systematic search method with high computational efficiency. However, by using FFT to perform unbound docking, possible conformational changes upon binding must be treated implicitly. To better accommodate the implicit treatment of conformational flexibility, we develop a rational approach to optimize "softened" parameters for FFT docking. In connection with the increased "softness" of the parameters in this global search step, we use a revised rule to select candidate models from the search results. For complexes designated as of low and medium difficulty for unbound docking, these adaptations of the original FTDOCK program lead to substantial improvements of the global search results. Finally, we show that models resulted from FFT-based global search can be further filtered with restraints derivable from nuclear magnetic resonance (NMR) chemical shift perturbation or mutagenesis experiments, leading to a small set of models that can be feasibly refined and evaluated using computationally more expensive methods and that still include high-ranking near-native conformations.     

Score_set: A CAPRI benchmark for scoring protein complexes

Critical Assessment of PRedicted Interactions (CAPRI) has proven to be a catalyst for the development of docking algorithms. An essential step in docking is the scoring of predicted binding modes in order to identify stable complexes. In 2005, CAPRI introduced the scoring experiment, where upon completion of a prediction round, a larger set of models predicted by different groups and comprising both correct and incorrect binding modes, is made available to all participants for testing new scoring functions independently from docking calculations. Here we present an expanded benchmark data set for testing scoring functions, which comprises the consolidated ensemble of predicted complexes made available in the CAPRI scoring experiment since its inception. This consolidated scoring benchmark contains predicted complexes for 15 published CAPRI targets. These targets were subjected to 23 CAPRI assessments, due to existence of multiple binding modes for some targets. The benchmark contains more than 19,000 protein complexes. About 10% of the complexes represent docking predictions of acceptable quality or better, the remainder represent incorrect solutions (decoys). The benchmark set contains models predicted by 47 different predictor groups including web servers, which use different docking and scoring procedures, and is arguably as diverse as one may expect, representing the state of the art in protein docking. The data set is publicly available at the following URL: http://cb.iri.univ‐lille1.fr/Users/lensink/Score_set . Proteins 2014; 82:3163–3169. © 2014 Wiley Periodicals, Inc.