Challenges and advances in computational docking: 2009 in review

Docking is a computational technique that places a small molecule (ligand) in the binding site of its macromolecular target (receptor) and estimates its binding affinity. This review addresses methodological developments that have occurred in the docking field in 2009, with a particular focus on the more difficult, and sometimes controversial, aspects of this promising computational discipline. These developments aim to address the main challenges of docking: receptor representation (such aspects as structural waters, side chain protonation, and, most of all, flexibility (from side chain rotation to domain movement)), ligand representation (protonation, tautomerism and stereoisomerism, and the effect of input conformation), as well as accounting for solvation and entropy of binding. This review is strongly focused on docking advances in the context of drug design, specifically in virtual screening and fragment-based drug design.     

Latest developments in molecular docking: 2010–2011 in review

The aim of docking is to accurately predict the structure of a ligand within the constraints of a receptor binding site and to correctly estimate the strength of binding. We discuss, in detail, methodological developments that occurred in the docking field in 2010 and 2011, with a particular focus on the more difficult, and sometimes controversial, aspects of this promising computational discipline. The main developments in docking in this period, covered in this review, are receptor flexibility, solvation, fragment docking, postprocessing, docking into homology models, and docking comparisons. Several new, or at least newly invigorated, advances occurred in areas such as nonlinear scoring functions, using machine‐learning approaches. This review is strongly focused on docking advances in the context of drug design, specifically in virtual screening and fragment‐based drug design. Where appropriate, we refer readers to exemplar case studies. Copyright © 2013 John Wiley & Sons, Ltd.     

Receptor–ligand molecular docking

Docking methodology aims to predict the experimental binding modes and affinities of small molecules within the binding site of particular receptor targets and is currently used as a standard computational tool in drug design for lead compound optimisation and in virtual screening studies to find novel biologically active molecules. The basic tools of a docking methodology include a search algorithm and an energy scoring function for generating and evaluating ligand poses. In this review, we present the search algorithms and scoring functions most commonly used in current molecular docking methods that focus on protein–ligand applications. We summarise the main topics and recent computational and methodological advances in protein–ligand docking. Protein flexibility, multiple ligand binding modes and the free-energy landscape profile for binding affinity prediction are important and interconnected challenges to be overcome by further methodological developments in the docking field.     

Intuitive,but not simple: Including explicit water molecules in protein–protein docking simulations improves model quality

Characterizing the nature of interaction between proteins that have not been experimentally cocrystallized requires a computational docking approach that can successfully predict the spatial conformation adopted in the complex. In this work, the Hydropathic INTeractions (HINT) force field model was used for scoring docked models in a data set of 30 high‐resolution crystallographically characterized “dry” protein–protein complexes and was shown to reliably identify native‐like models. However, most current protein–protein docking algorithms fail to explicitly account for water molecules involved in bridging interactions that mediate and stabilize the association of the protein partners, so we used HINT to illuminate the physical and chemical properties of bridging waters and account for their energetic stabilizing contributions. The HINT water Relevance metric identified the “truly” bridging waters at the 30 protein–protein interfaces and we utilized them in “solvated” docking by manually inserting them into the input files for the rigid body ZDOCK program. By accounting for these interfacial waters, a statistically significant improvement of ～24% in the average hit‐count within the top‐10 predictions the protein–protein dataset was seen, compared to standard “dry” docking. The results also show scoring improvement, with medium and high accuracy models ranking much better than incorrect ones. These improvements can be attributed to the physical presence of water molecules that alter surface properties and better represent native shape and hydropathic complementarity between interacting partners, with concomitantly more accurate native‐like structure predictions. Proteins 2014; 82:916–932. © 2013 Wiley Periodicals, Inc.     

Principles of docking: An overview of search algorithms and a guide to scoring functions

The docking field has come of age. The time is ripe to present the principles of docking, reviewing the current state of the field. Two reasons are largely responsible for the maturity of the computational docking area. First, the early optimism that the very presence of the "correct" native conformation within the list of predicted docked conformations signals a near solution to the docking problem, has been replaced by the stark realization of the extreme difficulty of the next scoring/ranking step. Second, in the last couple of years more realistic approaches to handling molecular flexibility in docking schemes have emerged. As in folding, these derive from concepts abstracted from statistical mechanics, namely, populations. Docking and folding are interrelated. From the purely physical standpoint, binding and folding are analogous processes, with similar underlying principles. Computationally, the tools developed for docking will be tremendously useful for folding. For large, multidomain proteins, domain docking is probably the only rational way, mimicking the hierarchical nature of protein folding. The complexity of the problem is huge. Here we divide the computational docking problem into its two separate components. As in folding, solving the docking problem involves efficient search (and matching) algorithms, which cover the relevant conformational space, and selective scoring functions, which are both efficient and effectively discriminate between native and non-native solutions. It is universally recognized that docking of drugs is immensely important. However, protein-protein docking is equally so, relating to recognition, cellular pathways, and macromolecular assemblies. Proteins function when they are bound to other molecules. Consequently, we present the review from both the computational and the biological points of view. Although large, it covers only partially the extensive body of literature, relating to small (drug) and to large protein-protein molecule docking, to rigid and to flexible. Unfortunately, when reviewing these, a major difficulty in assessing the results is the non-uniformity in the formats in which they are presented in the literature. Consequently, we further propose a way to rectify it here.     

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.     

pyDock: electrostatics and desolvation for effective scoring of rigid-body protein-protein docking

The accurate scoring of rigid-body docking orientations represents one of the major difficulties in protein-protein docking prediction. Other challenges are the development of faster and more efficient sampling methods and the introduction of receptor and ligand flexibility during simulations. Overall, good discrimination of near-native docking poses from the very early stages of rigid-body protein docking is essential step before applying more costly interface refinement to the correct docking solutions. Here we explore a simple approach to scoring of rigid-body docking poses, which has been implemented in a program called pyDock. The scheme is based on Coulombic electrostatics with distance dependent dielectric constant, and implicit desolvation energy with atomic solvation parameters previously adjusted for rigid-body protein-protein docking. This scoring function is not highly dependent on specific geometry of the docking poses and therefore can be used in rigid-body docking sets generated by a variety of methods. We have tested the procedure in a large benchmark set of 80 unbound docking cases. The method is able to detect a near-native solution from 12,000 docking poses and place it within the 100 lowest-energy docking solutions in 56% of the cases, in a completely unrestricted manner and without any other additional information. More specifically, a near-native solution will lie within the top 20 solutions in 37% of the cases. The simplicity of the approach allows for a better understanding of the physical principles behind protein-protein association, and provides a fast tool for the evaluation of large sets of rigid-body docking poses in search of the near-native orientation.     

Discovery of binding proteins for a protein target using protein–protein docking‐based virtual screening

Target structure‐based virtual screening, which employs protein‐small molecule docking to identify potential ligands, has been widely used in small‐molecule drug discovery. In the present study, we used a protein–protein docking program to identify proteins that bind to a specific target protein. In the testing phase, an all‐to‐all protein–protein docking run on a large dataset was performed. The three‐dimensional rigid docking program SDOCK was used to examine protein–protein docking on all protein pairs in the dataset. Both the binding affinity and features of the binding energy landscape were considered in the scoring function in order to distinguish positive binding pairs from negative binding pairs. Thus, the lowest docking score, the average Z‐score, and convergency of the low‐score solutions were incorporated in the analysis. The hybrid scoring function was optimized in the all‐to‐all docking test. The docking method and the hybrid scoring function were then used to screen for proteins that bind to tumor necrosis factor‐α (TNFα), which is a well‐known therapeutic target for rheumatoid arthritis and other autoimmune diseases. A protein library containing 677 proteins was used for the screen. Proteins with scores among the top 20% were further examined. Sixteen proteins from the top‐ranking 67 proteins were selected for experimental study. Two of these proteins showed significant binding to TNFα in an in vitro binding study. The results of the present study demonstrate the power and potential application of protein–protein docking for the discovery of novel binding proteins for specific protein targets. Proteins 2014; 82:2472–2482. © 2014 Wiley Periodicals, Inc.     

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     

iATTRACT: Simultaneous global and local interface optimization for protein–protein docking refinement

Protein‐protein interactions are abundant in the cell but to date structural data for a large number of complexes is lacking. Computational docking methods can complement experiments by providing structural models of complexes based on structures of the individual partners. A major caveat for docking success is accounting for protein flexibility. Especially, interface residues undergo significant conformational changes upon binding. This limits the performance of docking methods that keep partner structures rigid or allow limited flexibility. A new docking refinement approach, iATTRACT, has been developed which combines simultaneous full interface flexibility and rigid body optimizations during docking energy minimization. It employs an atomistic molecular mechanics force field for intermolecular interface interactions and a structure‐based force field for intramolecular contributions. The approach was systematically evaluated on a large protein‐protein docking benchmark, starting from an enriched decoy set of rigidly docked protein–protein complexes deviating by up to 15 Å from the native structure at the interface. Large improvements in sampling and slight but significant improvements in scoring/discrimination of near native docking solutions were observed. Complexes with initial deviations at the interface of up to 5.5 Å were refined to significantly better agreement with the native structure. Improvements in the fraction of native contacts were especially favorable, yielding increases of up to 70%. Proteins 2015; 83:248–258. © 2014 Wiley Periodicals, Inc.     

Receptor-specific scoring functions derived from quantum chemical models improve affinity estimates for in-silico drug discovery

The adaptation of forcefield-based scoring function to specific receptors remains an important challenge for in-silico drug discovery. Here we compare binding energies of forcefield-based scoring functions with models that are reparameterized on the basis of large-scale quantum calculations of the receptor. We compute binding energies of eleven ligands to the human estrogen receptor subtype alpha (ERalpha) and four ligands to the human retinoic acid receptor of isotype gamma (RARgamma). Using the FlexScreen all-atom receptor-ligand docking approach, we compare docking simulations parameterized by quantum-mechanical calculation of a large protein fragment with purely forcefield-based models. The use of receptor flexibility in the FlexScreen permits the treatment of all ligands in the same receptor model. We find a high correlation between the classical binding energy obtained in the docking simulation and quantum mechanical binding energies and a good correlation with experimental affinities R=0.81 for ERalpha and R=0.95 for RARgamma using the quantum derived scoring functions. A significant part of this improvement is retained, when only the receptor is treated with quantum-based parameters, while the ligands are parameterized with a purely classical model.     

A flexible docking approach for prediction of T cell receptor–peptide–MHC complexes

T cell receptors (TCRs) are immune proteins that specifically bind to antigenic molecules, which are often foreign peptides presented by major histocompatibility complex proteins (pMHCs), playing a key role in the cellular immune response. To advance our understanding and modeling of this dynamic immunological event, we assembled a protein–protein docking benchmark consisting of 20 structures of crystallized TCR/pMHC complexes for which unbound structures exist for both TCR and pMHC. We used our benchmark to compare predictive performance using several flexible and rigid backbone TCR/pMHC docking protocols. Our flexible TCR docking algorithm, TCRFlexDock, improved predictive success over the fixed backbone protocol, leading to near‐native predictions for 80% of the TCR/pMHC cases among the top 10 models, and 100% of the cases in the top 30 models. We then applied TCRFlexDock to predict the two distinct docking modes recently described for a single TCR bound to two different antigens, and tested several protein modeling scoring functions for prediction of TCR/pMHC binding affinities. This algorithm and benchmark should enable future efforts to predict, and design of uncharacterized TCR/pMHC complexes.     

Surface motifs by a computer vision technique: Searches,detection, and implications for protein–ligand recognition

We describe the application of a method geared toward structural and surface comparison of proteins. The method is based on the Geometric Hashing Paradigm adapted from Computer Vision. It allows for comparison of any two sets of 3-D coordinates, such as protein backbones, protein core or protein surface motifs, and small molecules such as drugs. Here we apply our method to 4 types of comparisons between pairs of molecules: (1) comparison of the backbones of two protein domains; (2) search for a predefined 3-D C_α motif within the full backbone of a domain; and in particular, (3) comparison of the surfaces of two receptor proteins; and (4) comparison of the surface of a receptor to the surface of a ligand. These aspects complement each other and can contribute toward a better understandingof protein structure and biomolecular recognition. Searches for 3-D surface motifs can be carried out on either receptors or on ligands. The latter may result in the detection of pharmacophoric patterns. If the surfaces of the binding sites of either the receptors or of the ligands are relatively similar, surface superpositioning may aid significantly in the docking problem. Currently, only distance invariants are used in the matching, although additional geometric surface invariants are considered. The speed of our Geometric Hashing algorithm is encouraging, with a typical surface comparison taking only seconds or minutes of CPU time on a SUN 4 SPARC workstation. The direct application of this method to the docking problem is also discussed. We demonstrate the success of this methodin its application to two members of the globin family and to two dehydrogenases. © 1993 Wiley-Liss, Inc.     

Ensemble docking of multiple protein structures: considering protein structural variations in molecular docking

One approach to incorporate protein flexibility in molecular docking is the use of an ensemble consisting of multiple protein structures. Sequentially docking each ligand into a large number of protein structures is computationally too expensive to allow large-scale database screening. It is challenging to achieve a good balance between docking accuracy and computational efficiency. In this work, we have developed a fast, novel docking algorithm utilizing multiple protein structures, referred to as ensemble docking, to account for protein structural variations. The algorithm can simultaneously dock a ligand into an ensemble of protein structures and automatically select an optimal protein structure that best fits the ligand by optimizing both ligand coordinates and the conformational variable m, where m represents the m-th structure in the protein ensemble. The docking algorithm was validated on 10 protein ensembles containing 105 crystal structures and 87 ligands in terms of binding mode and energy score predictions. A success rate of 93% was obtained with the criterion of root-mean-square deviation <2.5 A if the top five orientations for each ligand were considered, comparable to that of sequential docking in which scores for individual docking are merged into one list by re-ranking, and significantly better than that of single rigid-receptor docking (75% on average). Similar trends were also observed in binding score predictions and enrichment tests of virtual database screening. The ensemble docking algorithm is computationally efficient, with a computational time comparable to that for docking a ligand into a single protein structure. In contrast, the computational time for the sequential docking method increases linearly with the number of protein structures in the ensemble. The algorithm was further evaluated using a more realistic ensemble in which the corresponding bound protein structures of inhibitors were excluded. The results show that ensemble docking successfully predicts the binding modes of the inhibitors, and discriminates the inhibitors from a set of noninhibitors with similar chemical properties. Although multiple experimental structures were used in the present work, our algorithm can be easily applied to multiple protein conformations generated by computational methods, and helps improve the efficiency of other existing multiple protein structure(MPS)-based methods to accommodate protein flexibility.     

Compound prioritization from inverse docking experiment using receptor‐centric and ligand‐centric methods: a case study on Plasmodium falciparum Fab enzymes

Prioritization of compounds using inverse docking approach is limited owing to potential drawbacks in its scoring functions. Classically, molecules ranked by best or lowest binding energies and clustering methods have been considered as probable hits. Mining probable hits from an inverse docking approach is very complicated given the closely related protein targets and the chemically similar ligand data set. To overcome this problem, we present here a computational approach using receptor‐centric and ligand‐centric methods to infer the reliability of the inverse docking approach and to recognize probable hits. This knowledge‐driven approach takes advantage of experimentally identified inhibitors against a particular protein target of interest to delineate shape and molecular field properties and use a multilayer perceptron model to predict the biological activity of the test molecules. The approach was validated using flavone derivatives possessing inhibitory activities against principal antimalarial molecular targets of fatty acid biosynthetic pathway, FabG, FabI and FabZ, respectively. We propose that probable hits can be retrieved by comparing the rank list of docking, quantitative‐structure activity relationship and multilayer perceptron models. Copyright © 2014 John Wiley & Sons, Ltd.     

A protein-specifically adapted scoring function for the reranking of docking solutions

In this work, we developed a protein-specifically adapted scoring function and applied it to the reranking of protein-protein docking solutions generated with a conventional docking program. The approach was validated using experimentally determined structures of the bacterial HPr-protein in complex with four structurally nonhomologous binding partners as an example. A sufficiently large data basis for the generation of protein-specifically adapted pair potentials was generated by modeling all orthologous complexes for each type of interaction resulting in a total of 224 complexes. The parameters for potential generation were systematically varied and resulted in a total of 66,132 different scoring functions that were tested for their ability of successful reranking of 1000 docking solutions generated from modeled structures of the unbound binding partners. Parameters that proved critical for the generation of good scoring functions were the distance cutoff used for the generation of the pair potential, and an additional cutoff that allows a proper weighting of conserved and nonconserved contacts in the interface. Compared to the original scoring function, application of this novel type of scoring functions resulted in a significant accumulation of acceptable docking solutions within the first 10 ranks. Depending on the type of complex investigated one to five acceptable complex geometries are found among the 10 highest-ranked solutions and for three of the four systems tested, an acceptable solution was placed on the first rank.     

Structure-based tailoring of compound libraries for high-throughput screening: discovery of novel EphB4 kinase inhibitors

High-throughput docking is a computational tool frequently used to discover small-molecule inhibitors of enzymes or receptors of known three-dimensional structure. Because of the large number of molecules in chemical libraries, automatic procedures to prune multimillion compound collections are useful for high-throughput docking and necessary for in vitro screening. Here, we propose an anchor-based library tailoring approach (termed ALTA) to focus a chemical library by docking and prioritizing molecular fragments according to their binding energy which includes continuum electrostatics solvation. In principle, ALTA does not require prior knowledge of known inhibitors, but receptor-based pharmacophore information (hydrogen bonds with the hinge region) is additionally used here to identify molecules with optimal anchor fragments for the ATP-binding site of the EphB4 receptor tyrosine kinase. The 21,418 molecules of the focused library (from an initial collection of about 730,000) are docked into EphB4 and ranked by force-field-based energy including electrostatic solvation. Among the 43 compounds tested in vitro, eight molecules originating from two different anchors show low-micromolar activity in a fluorescence-based enzymatic assay. Four of them are active in a cell-based assay and are potential anti-angiogenic compounds.