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.
The heavily used protein–protein docking server ClusPro performs three computational steps as follows: (1) rigid body docking, (2) RMSD based clustering of the 1000 lowest energy structures, and (3) the removal of steric clashes by energy minimization. In response to challenges encountered in recent CAPRI targets, we added three new options to ClusPro. These are (1) accounting for small angle X‐ray scattering data in docking; (2) considering pairwise interaction data as restraints; and (3) enabling discrimination between biological and crystallographic dimers. In addition, we have developed an extremely fast docking algorithm based on 5D rotational manifold FFT, and an algorithm for docking flexible peptides that include known sequence motifs. We feel that these developments will further improve the utility of ClusPro. However, CAPRI emphasized several shortcomings of the current server, including the problem of selecting the right energy parameters among the five options provided, and the problem of selecting the best models among the 10 generated for each parameter set. In addition, results convinced us that further development is needed for docking homology models. Finally, we discuss the difficulties we have encountered when attempting to develop a refinement algorithm that would be computationally efficient enough for inclusion in a heavily used server. Proteins 2017; 85:435–444. © 2016 Wiley Periodicals, Inc.
more » « less- NSF-PAR ID:
- 10037075
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- Proteins: Structure, Function, and Bioinformatics
- Volume:
- 85
- Issue:
- 3
- ISSN:
- 0887-3585
- Page Range / eLocation ID:
- p. 435-444
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract -
Abstract Targets in the protein docking experiment CAPRI (Critical Assessment of Predicted Interactions) generally present new challenges and contribute to new developments in methodology. In rounds 38 to 45 of CAPRI, most targets could be effectively predicted using template‐based methods. However, the server ClusPro required structures rather than sequences as input, and hence we had to generate and dock homology models. The available templates also provided distance restraints that were directly used as input to the server. We show here that such an approach has some advantages. Free docking with template‐based restraints using ClusPro reproduced some interfaces suggested by weak or ambiguous templates while not reproducing others, resulting in correct server predicted models. More recently we developed the fully automated ClusPro TBM server that performs template‐based modeling and thus can use sequences rather than structures of component proteins as input. The performance of the server, freely available for noncommercial use at
https://tbm.cluspro.org , is demonstrated by predicting the protein‐protein targets of rounds 38 to 45 of CAPRI. -
Abstract As a participant in the joint CASP13‐CAPRI46 assessment, the ClusPro server debuted its new template‐based modeling functionality. The addition of this feature, called ClusPro TBM, was motivated by the previous CASP‐CAPRI assessments and by the proven ability of template‐based methods to produce higher‐quality models, provided templates are available. In prior assessments, ClusPro submissions consisted of models that were produced via free docking of pre‐generated homology models. This method was successful in terms of the number of acceptable predictions across targets; however, analysis of results showed that purely template‐based methods produced a substantially higher number of medium‐quality models for targets for which there were good templates available. The addition of template‐based modeling has expanded ClusPro's ability to produce higher accuracy predictions, primarily for homomeric but also for some heteromeric targets. Here we review the newest additions to the ClusPro web server and discuss examples of CASP‐CAPRI targets that continue to drive further development. We also describe ongoing work not yet implemented in the server. This includes the development of methods to improve template‐based models and the use of co‐evolutionary information for data‐assisted free docking.
-
Abstract Summary We present an approach for the efficient docking of peptide motifs to their free receptor structures. Using a motif based search, we can retrieve structural fragments from the Protein Data Bank (PDB) that are very similar to the peptide’s final, bound conformation. We use a Fast Fourier Transform (FFT) based docking method to quickly perform global rigid body docking of these fragments to the receptor. According to CAPRI peptide docking criteria, an acceptable conformation can often be found among the top-ranking predictions.
Availability and Implementation The method is available as part of the protein-protein docking server ClusPro at https://peptidock.cluspro.org/nousername.php.
Supplementary information Supplementary data are available at Bioinformatics online.
-
Abstract Computational modeling of protein–DNA complex structures has important implications in biomedical applications such as structure‐based, computer aided drug design. A key step in developing methods for accurate modeling of protein–DNA complexes is similarity assessment between models and their reference complex structures. Existing methods primarily rely on distance‐based metrics and generally do not consider important functional features of the complexes, such as interface hydrogen bonds that are critical to specific protein–DNA interactions. Here, we present a new scoring function, ComparePD, which takes interface hydrogen bond energy and strength into account besides the distance‐based metrics for accurate similarity measure of protein–DNA complexes. ComparePD was tested on two datasets of computational models of protein–DNA complexes generated using docking (classified as easy, intermediate, and difficult cases) and homology modeling methods. The results were compared with PDDockQ, a modified version of DockQ tailored for protein–DNA complexes, as well as the metrics employed by the community‐wide experiment CAPRI (Critical Assessment of PRedicted Interactions). We demonstrated that ComparePD provides an improved similarity measure over PDDockQ and the CAPRI classification method by considering both conformational similarity and functional importance of the complex interface. ComparePD identified more meaningful models as compared to PDDockQ for all the cases having different top models between ComparePD and PDDockQ except for one intermediate docking case.