A protein-RNA docking benchmark (I): nonredundant cases

We have developed a nonredundant protein-RNA docking benchmark dataset, which is derived from the available bound and unbound structures in the Protein Data Bank involving polypeptide and nucleic acid chains. It consists of nine unbound-unbound cases where both the protein and the RNA are available in the free form. The other 36 cases are of unbound-bound type where only the protein is available in the free form. The conformational change upon complex formation is calculated by a distance matrix alignment method, and based on that, complexes are classified into rigid, semi-flexible, and full flexible. Although in the rigid body category, no significant conformational change accompanies complex formation, the fully flexible test cases show large domain movements, RNA base flips, etc. The benchmark covers four major groups of RNA, namely, t-RNA, ribosomal RNA, duplex RNA, and single-stranded RNA. We find that RNA is generally more flexible than the protein in the complexes, and the interface region is as flexible as the molecule as a whole. The structural diversity of the complexes in the benchmark set should provide a common ground for the development and comparison of the protein-RNA docking methods. The benchmark can be freely downloaded from the internet.     

A non‐redundant protein–RNA docking benchmark version 2.0

We present an updated version of the protein–RNA docking benchmark, which we first published four years back. The non‐redundant protein–RNA docking benchmark version 2.0 consists of 126 test cases, a threefold increase in number compared to its previous version. The present version consists of 21 unbound–unbound cases, of which, in 12 cases, the unbound RNAs are taken from another complex. It also consists of 95 unbound–bound cases where only the protein is available in the unbound state. Besides, we introduce 10 new bound–unbound cases where only the RNA is found in the unbound state. Based on the degree of conformational change of the interface residues upon complex formation the benchmark is classified into 72 rigid‐body cases, 25 semiflexible cases and 19 full flexible cases. It also covers a wide range of conformational flexibility including small side chain movement to large domain swapping in protein structures as well as flipping and restacking in RNA bases. This benchmark should provide the docking community with more test cases for evaluating rigid‐body as well as flexible docking algorithms. Besides, it will also facilitate the development of new algorithms that require large number of training set. The protein–RNA docking benchmark version 2.0 can be freely downloaded from http://www.csb.iitkgp.ernet.in/applications/PRDBv2 . Proteins 2017; 85:256–267. © 2016 Wiley Periodicals, Inc.     

Evaluating conformational changes in protein structures binding RNA

Many protein-RNA recognition events are known to exhibit conformational changes from qualitative observations of individual complexes. However, a quantitative estimation of conformational changes is required if protein-RNA docking and template-based methods for RNA binding site prediction are to be developed. This study presents the first quantitative evaluation of conformational changes that occur when proteins bind RNA. The analysis of twelve RNA-binding proteins in the bound and unbound states using error-scaled difference distance matrices is presented. The binding site residues are mapped to each structure, and the conformational changes that affect these residues are evaluated. Of the twelve proteins four exhibit greater movements in nonbinding site residues, and a further four show the greatest movements in binding site residues. The remaining four proteins display no significant conformational change. When interface residues are found to be in conformationally variable regions of the protein they are typically seen to move less than 2 A between the bound and unbound conformations. The current data indicate that conformational changes in the binding site residues of RNA binding proteins may not be as significant as previously suggested, but a larger data set is required before wider conclusions may be drawn. The implications of the observed conformational changes for protein function prediction are discussed.     

Protein-RNA Complexes and Efficient Automatic Docking: Expanding RosettaDock Possibilities

Protein-RNA complexes provide a wide range of essential functions in the cell. Their atomic experimental structure solving, despite essential to the understanding of these functions, is often difficult and expensive. Docking approaches that have been developed for proteins are often challenging to adapt for RNA because of its inherent flexibility and the structural data available being relatively scarce. In this study we adapted the RosettaDock protocol for protein-RNA complexes both at the nucleotide and atomic levels. Using a genetic algorithm-based strategy, and a non-redundant protein-RNA dataset, we derived a RosettaDock scoring scheme able not only to discriminate but also score efficiently docking decoys. The approach proved to be both efficient and robust for generating and identifying suitable structures when applied to two protein-RNA docking benchmarks in both bound and unbound settings. It also compares well to existing strategies. This is the first approach that currently offers a multi-level optimized scoring approach integrated in a full docking suite, leading the way to adaptive fully flexible strategies.     

DOCKGROUND protein-protein docking decoy set

A protein-protein docking decoy set is built for the Dockground unbound benchmark set. The GRAMM-X docking scan was used to generate 100 non-native and at least one near-native match per complex for 61 complexes. The set is a publicly available resource for the development of scoring functions and knowledge-based potentials for protein docking methodologies. AVAILABILITY: The decoys are freely available for download at http://dockground.bioinformatics.ku.edu/UNBOUND/decoy/decoy.php     

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.     

PRI-Modeler: extracting RNA structural elements from PDB files of protein-RNA complexes

A complete understanding of protein and RNA structures and their interactions is important for determining the binding sites in protein-RNA complexes. Computational approaches exist for identifying secondary structural elements in proteins from atomic coordinates. However, similar methods have not been developed for RNA, due in part to the very limited structural data so far available. We have developed a set of algorithms for extracting and visualizing secondary and tertiary structures of RNA and for analyzing protein-RNA complexes. These algorithms have been implemented in a web-based program called PRI-Modeler (protein-RNA interaction modeler). Given one or more protein data bank files of protein-RNA complexes, PRI-Modeler analyzes the conformation of the RNA, calculates the hydrogen bond (H bond) and van der Waals interactions between amino acids and nucleotides, extracts secondary and tertiary RNA structure elements, and identifies the patterns of interactions between the proteins and RNAs. This paper presents PRI-Modeler and its application to the hydrogen bond and van der Waals interactions in the most representative set of protein-RNA complexes. The analysis reveals several interesting interaction patterns at various levels. The information provided by PRI-Modeler should prove useful for determining the binding sites in protein-RNA complexes. PRI-Modeler is accessible at http://wilab.inha.ac.kr/primodeler/, and supplementary materials are available in the analysis results section at http://wilab.inha.ac.kr/primodeler/.     

SymmRef: a flexible refinement method for symmetric multimers

Symmetric protein complexes are abundant in the living cell. Predicting their atomic structure can shed light on the mechanism of many important biological processes. Symmetric docking methods aim to predict the structure of these complexes given the unbound structure of a single monomer, or its model. Symmetry constraints reduce the search-space of these methods and make the prediction easier compared to asymmetric protein-protein docking. However, the challenge of modeling the conformational changes that the monomer might undergo is a major obstacle. In this article, we present SymmRef, a novel method for refinement and reranking of symmetric docking solutions. The method models backbone and side-chain movements and optimizes the rigid-body orientations of the monomers. The backbone movements are modeled by normal modes minimization and the conformations of the side-chains are modeled by selecting optimal rotamers. Since solved structures of symmetric multimers show asymmetric side-chain conformations, we do not use symmetry constraints in the side-chain optimization procedure. The refined models are re-ranked according to an energy score. We tested the method on a benchmark of unbound docking challenges. The results show that the method significantly improves the accuracy and the ranking of symmetric rigid docking solutions. SymmRef is available for download at http:// bioinfo3d.cs.tau.ac.il/SymmRef/download.html.     

The dataset for protein–RNA binding affinity

We have developed a non‐redundant protein–RNA binding benchmark dataset derived from the available protein–RNA structures in the Protein Database Bank. It consists of 73 complexes with measured binding affinity. The experimental conditions (pH and temperature) for binding affinity measurements are also listed in our dataset. This binding affinity dataset can be used to compare and develop protein–RNA scoring functions. The predicted binding free energy of the 73 complexes from three available scoring functions for protein–RNA docking has a low correlation with the binding Gibbs free energy calculated from K_d. © 2013 The Protein Society     

ZDOCK: an initial-stage protein-docking algorithm

The development of scoring functions is of great importance to protein docking. Here we present a new scoring function for the initial stage of unbound docking. It combines our recently developed pairwise shape complementarity with desolvation and electrostatics. We compare this scoring function with three other functions on a large benchmark of 49 nonredundant test cases and show its superior performance, especially for the antibody-antigen category of test cases. For 44 test cases (90% of the benchmark), we can retain at least one near-native structure within the top 2000 predictions at the 6 degrees rotational sampling density, with an average of 52 near-native structures per test case. The remaining five difficult test cases can be explained by a combination of poor binding affinity, large backbone conformational changes, and our algorithm's strong tendency for identifying large concave binding pockets. All four scoring functions have been integrated into our Fast Fourier Transform based docking algorithm ZDOCK, which is freely available to academic users at http://zlab.bu.edu/~ rong/dock.     

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.     

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).     

Cross‐docking benchmark for automated pose and ranking prediction of ligand binding

Significant efforts have been devoted in the last decade to improving molecular docking techniques to predict both accurate binding poses and ranking affinities. Some shortcomings in the field are the limited number of standard methods for measuring docking success and the availability of widely accepted standard data sets for use as benchmarks in comparing different docking algorithms throughout the field. In order to address these issues, we have created a Cross‐Docking Benchmark server. The server is a versatile cross‐docking data set containing 4,399 protein‐ligand complexes across 95 protein targets intended to serve as benchmark set and gold standard for state‐of‐the‐art pose and ranking prediction in easy, medium, hard, or very hard docking targets. The benchmark along with a customizable cross‐docking data set generation tool is available at http://disco.csb.pitt.edu . We further demonstrate the potential uses of the server in questions outside of basic benchmarking such as the selection of the ideal docking reference structure.     

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.     

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.     

Solvated protein–DNA docking using HADDOCK

Interfacial water molecules play an important role in many aspects of protein–DNA specificity and recognition. Yet they have been mostly neglected in the computational modeling of these complexes. We present here a solvated docking protocol that allows explicit inclusion of water molecules in the docking of protein–DNA complexes and demonstrate its feasibility on a benchmark of 30 high-resolution protein–DNA complexes containing crystallographically-determined water molecules at their interfaces. Our protocol is capable of reproducing the solvation pattern at the interface and recovers hydrogen-bonded water-mediated contacts in many of the benchmark cases. Solvated docking leads to an overall improvement in the quality of the generated protein–DNA models for cases with limited conformational change of the partners upon complex formation. The applicability of this approach is demonstrated on real cases by docking a representative set of 6 complexes using unbound protein coordinates, model-built DNA and knowledge-based restraints. As HADDOCK supports the inclusion of a variety of NMR restraints, solvated docking is also applicable for NMR-based structure calculations of protein–DNA complexes.