Protein-protein docking with F(2)Dock 2.0 and GB-rerank

Motivation

Computational simulation of protein-protein docking can expedite the process of molecular modeling and drug discovery. This paper reports on our new F² Dock protocol which improves the state of the art in initial stage rigid body exhaustive docking search, scoring and ranking by introducing improvements in the shape-complementarity and electrostatics affinity functions, a new knowledge-based interface propensity term with FFT formulation, a set of novel knowledge-based filters and finally a solvation energy (GBSA) based reranking technique. Our algorithms are based on highly efficient data structures including the dynamic packing grids and octrees which significantly speed up the computations and also provide guaranteed bounds on approximation error.

Results

The improved affinity functions show superior performance compared to their traditional counterparts in finding correct docking poses at higher ranks. We found that the new filters and the GBSA based reranking individually and in combination significantly improve the accuracy of docking predictions with only minor increase in computation time. We compared F² Dock 2.0 with ZDock 3.0.2 and found improvements over it, specifically among 176 complexes in ZLab Benchmark 4.0, F² Dock 2.0 finds a near-native solution as the top prediction for 22 complexes; where ZDock 3.0.2 does so for 13 complexes. F² Dock 2.0 finds a near-native solution within the top 1000 predictions for 106 complexes as opposed to 104 complexes for ZDock 3.0.2. However, there are 17 and 15 complexes where F² Dock 2.0 finds a solution but ZDock 3.0.2 does not and vice versa; which indicates that the two docking protocols can also complement each other.

Availability

The docking protocol has been implemented as a server with a graphical client (TexMol) which allows the user to manage multiple docking jobs, and visualize the docked poses and interfaces. Both the server and client are available for download. Server: http://www.cs.utexas.edu/~bajaj/cvc/software/f2dock.shtml. Client: http://www.cs.utexas.edu/~bajaj/cvc/software/f2dockclient.shtml.

F2Dock: fast Fourier protein-protein docking

The functions of proteins are often realized through their mutual interactions. Determining a relative transformation for a pair of proteins and their conformations which form a stable complex, reproducible in nature, is known as docking. It is an important step in drug design, structure determination, and understanding function and structure relationships. In this paper, we extend our nonuniform fast Fourier transform-based docking algorithm to include an adaptive search phase (both translational and rotational) and thereby speed up its execution. We have also implemented a multithreaded version of the adaptive docking algorithm for even faster execution on multicore machines. We call this protein-protein docking code F2Dock (F2 = Fast Fourier). We have calibrated F2Dock based on an extensive experimental study on a list of benchmark complexes and conclude that F2Dock works very well in practice. Though all docking results reported in this paper use shape complementarity and Coulombic-potential-based scores only, F2Dock is structured to incorporate Lennard-Jones potential and reranking docking solutions based on desolvation energy .

SH2 Binding Site Comparison: A New Application of the SURFCOMP Method

To avoid side effects, it is often desirable to increase the specificity of a drug candidate when targeting one member of a family of related proteins, whereby one exploits small differences between the structures of the binding sites. Identification of such differences can be carried out by analyzing the distributions of physicochemical properties mapped onto molecular surfaces. Here we demonstrate that SURFCOMP, our local surface similarity detection method, is able to detect differences between the binding sites of two closely related proteins. We analyzed the SH2 domains of Sap and Eat-2, two highly similar signal transduction molecules involved in inflammatory processes and found differences between their binding sites that can possibly lead to a better understanding of the different specificities of the two proteins.

Predicting peptide binding to MHC pockets via molecular modeling, implicit solvation, and global optimization

Development of a computational prediction method based on molecular modeling, global optimization, and implicit solvation has produced accurate structure and relative binding affinity predictions for peptide amino acids binding to five pockets of the MHC molecule HLA-DRB1*0101. Because peptide binding to MHC molecules is essential to many immune responses, development of such a method for understanding and predicting the forces that drive binding is crucial for pharmaceutical design and disease treatment. Underlying the development of this prediction method are two hypotheses. The first is that pockets formed by the peptide binding groove of MHC molecules are independent, separating the prediction of peptide amino acids that bind within individual pockets from those that bind between pockets. The second hypothesis is that the native state of a system composed of an amino acid bound to a protein pocket corresponds to the system's lowest free energy. The prediction method developed from these hypotheses uses atomistic-level modeling, deterministic global optimization, and three methods of implicit solvation: solvent-accessible area, solvent-accessible volume, and Poisson-Boltzmann electrostatics. The method predicts relative binding affinities of peptide amino acids for pockets of HLA-DRB1*0101 by determining computationally an amino acid's global minimum energy conformation. Prediction results from the method are in agreement with X-ray crystallography data and experimental binding assays.

Assessment of blind predictions of protein-protein interactions: current status of docking methods

The current status of docking procedures for predicting protein-protein interactions starting from their three-dimensional structure is assessed from a first major evaluation of blind predictions. This evaluation was performed as part of a communitywide experiment on Critical Assessment of PRedicted Interactions (CAPRI). Seven newly determined structures of protein-protein complexes were available as targets for this experiment. These were the complexes between a kinase and its protein substrate, between a T-cell receptor beta-chain and a superantigen, and five antigen-antibody complexes. For each target, the predictors were given the experimental structures of the free components, or of one free and one bound component in a random orientation. The structure of the complex was revealed only at the time of the evaluation. A total of 465 predictions submitted by 19 groups were evaluated. These groups used a wide range of algorithms and scoring functions, some of which were completely novel. The quality of the predicted interactions was evaluated by comparing residue-residue contacts and interface residues to those in the X-ray structures and by analyzing the fit of the ligand molecules (the smaller of the two proteins in the complex) or of interface residues only, in the predicted versus target complexes. A total of 14 groups produced predictions, ranking from acceptable to highly accurate for five of the seven targets. The use of available biochemical and biological information, and in one instance structural information, played a key role in achieving this result. It was essential for identifying the native binding modes for the five correctly predicted targets, including the kinase-substrate complex where the enzyme changes conformation on association. But it was also the cause for missing the correct solution for the two remaining unpredicted targets, which involve unexpected antigen-antibody binding modes. Overall, this analysis reveals genuine progress in docking procedures but also illustrates the remaining serious limitations and points out the need for better scoring functions and more effective ways for handling conformational flexibility.

CAPRI: a Critical Assessment of PRedicted Interactions

CAPRI is a communitywide experiment to assess the capacity of protein-docking methods to predict protein-protein interactions. Nineteen groups participated in rounds 1 and 2 of CAPRI and submitted blind structure predictions for seven protein-protein complexes based on the known structure of the component proteins. The predictions were compared to the unpublished X-ray structures of the complexes. We describe here the motivations for launching CAPRI, the rules that we applied to select targets and run the experiment, and some conclusions that can already be drawn. The results stress the need for new scoring functions and for methods handling the conformation changes that were observed in some of the target systems. CAPRI has already been a powerful drive for the community of computational biologists who development docking algorithms. We hope that this issue of Proteins will also be of interest to the community of structural biologists, which we call upon to provide new targets for future rounds of CAPRI, and to all molecular biologists who view protein-protein recognition as an essential process.

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.

Towards understanding the mechanisms of molecular recognition by computer simulations of ligand-protein interactions

The thermodynamic and kinetic aspects of molecular recognition for the methotrexate (MTX)-dihydrofolate reductase (DHFR) ligand-protein system are investigated by the binding energy landscape approach. The impact of 'hot' and 'cold' errors in ligand mutations on the thermodynamic stability of the native MTX-DHFR complex is analyzed, and relationships between the molecular recognition mechanism and the degree of ligand optimization are discussed. The nature and relative stability of intermediates and thermodynamic phases on the ligand-protein association pathway are studied, providing new insights into connections between protein folding and molecular recognition mechanisms, and cooperativity of ligand-protein binding. The results of kinetic docking simulations are rationalized based on the thermodynamic properties determined from equilibrium simulations and the shape of the underlying binding energy landscape. We show how evolutionary ligand selection for a receptor active site can produce well-optimized ligand-protein systems such as MTX-DHFR complex with the thermodynamically stable native structure and a direct transition mechanism of binding from unbound conformations to the unique native structure.

Docking of flexible ligands to flexible receptors in solution by molecular dynamics simulation

In this paper, a method of simulating the docking of small flexible ligands to flexible receptors in water is reported. The method is based on molecular dynamics simulations and is an extension of an algorithm previously reported by Di Nola et al. (Di Nola et al., Proteins 1994;19:174-182). The method allows a fast exploration of the receptor surface, using a high temperature of the center of mass translational motion, while the ligand internal motions, the solvent, and the receptor are simulated at room temperature. In addition, the method allows a fast center of mass motion of the ligand, even in solution. The dampening effect of the solvent can be overcome by applying different weights to the interactions between system subsets (solvent, receptor, and ligand). Specific ligand-receptor distances have been used to compare the results of the simulations with the crystal structure. The method is applied, as a test system, to the docking of the phosphocholine to the immunoglobulin McPC603. The results show the similarity of structure between the complex in solution and in the crystal.

A method for biomolecular structural recognition and docking allowing conformational flexibility

In this work, we present an algorithm developed to handle biomolecular structural recognition problems, as part of an interdisciplinary research endeavor of the Computer Vision and Molecular Biology fields. A key problem in rational drug design and in biomolecular structural recognition is the generation of binding modes between two molecules, also known as molecular docking. Geometrical fitness is a necessary condition for molecular interaction. Hence, docking a ligand (e.g., a drug molecule or a protein molecule), to a protein receptor (e.g., enzyme), involves recognition of molecular surfaces. Conformational transitions by "hinge-bending" involves rotational movements of relatively rigid parts with respect to each other. The generation of docked binding modes between two associating molecules depends on their three dimensional structures (3-D) and their conformational flexibility. In comparison to the particular case of rigid-body docking, the computational difficulty grows considerably when taking into account the additional degrees of freedom intrinsic to the flexible molecular docking problem. Previous docking techniques have enabled hinge movements only within small ligands. Partial flexibility in the receptor molecule is enabled by a few techniques. Hinge-bending motions of protein receptors domains are not addressed by these methods, although these types of transitions are significant, e.g., in enzymes activity. Our approach allows hinge induced motions to exist in either the receptor or the ligand molecules of diverse sizes. We allow domains/subdomains/group of atoms movements in either of the associating molecules. We achieve this by adapting a technique developed in Computer Vision and Robotics for the efficient recognition of partially occluded articulated objects. These types of objects consist of rigid parts which are connected by rotary joints (hinges). Our method is based on an extension and generalization of the Hough transform and the Geometric Hashing paradigms for rigid object recognition. We show experimental results obtained by the successful application of the algorithm to cases of bound and unbound molecular complexes, yielding fast matching times. While the "correct" molecular conformations of the known complexes are obtained with small RMS distances, additional, predictive good-fitting binding modes are generated as well. We conclude by discussing the algorithm's implications and extensions, as well as its application to investigations of protein structures in Molecular Biology and recognition problems in Computer Vision.

Exploring the energy landscapes of molecular recognition by a genetic algorithm: analysis of the requirements for robust docking of HIV-1 protease and FKBP-12 complexes

Energy landscapes of molecular recognition are explored by performing "semi-rigid" docking of FK-506 and rapamycin with the Fukisawa binding protein (FKBP-12), and flexible docking simulations of the Ro-31-8959 and AG-1284 inhibitors with HIV-1 protease by a genetic algorithm. The requirements of a molecular recognition model to meet thermodynamic and kinetic criteria of ligand-protein docking simultaneously are investigated using a family of simple molecular recognition energy functions. The critical factor that determines the success rate in predicting the structure of ligand-protein complexes is found to be the roughness of the binding energy landscape, in accordance with a minimal frustration principle. The results suggest that further progress in structure prediction of ligand-protein complexes can be achieved by designing molecular recognition energy functions that generate binding landscapes with reduced frustration.

Molecular docking using surface complementarity

A method is described to dock a ligand into a binding site in a protein on the basis of the complementarity of the intermolecular atomic contacts. Docking is performed by maximization of a complementarity function that is dependent on atomic contact surface area and the chemical properties of the contacting atoms. The generality and simplicity of the complementarity function ensure that a wide range of chemical structures can be handled. The ligand and the protein are treated as rigid bodies, but displacement of a small number of residues lining the ligand binding site can be taken into account. The method can assist in the design of improved ligands by indicating what changes in complementarity may occur as a result of the substitution of an atom in the ligand. The capabilities of the method are demonstrated by application to 14 protein-ligand complexes of known crystal structure.

Molecular docking towards drug discovery

Fueled by advances in molecular structure determination, tools for structure-based drug design are proliferating rapidly. Lead discovery through searching of ligand databases with molecular docking techniques represents an attractive alternative to high-throughout random screening. The size of commercial databases imposes severe computational constraints on molecular docking, compromising the level of calculational detail permitted for each putative ligand. We describe alternative philosophies for docking which effectively address this challenge. With respect to the dynamic aspects of molecular recognition, these strategies lie along a spectrum of models bounded by the Lock-and-Key and Induced-Fit theories for ligand binding. We explore the potential of a rigid model in exploiting species specificity and of a tolerant model in predicting absolute ligand binding affinity. Current molecular docking methods are limited primarily by their ability to rank docked complexes; we therefore place particular emphasis on this aspect of the problem throughout our validation of docking strategies.

A geometry-based suite of molecular docking processes

We have developed a geometry-based suite of processes for molecular docking. The suite consists of a molecular surface representation, a docking algorithm, and a surface inter-penetration and contact filter. The surface representation is composed of a sparse set of critical points (with their associated normals) positioned at the face centers of the molecular surface, providing a concise yet representative set. The docking algorithm is based on the Geometric Hashing technique, which indexes the critical points with their normals in a transformation invariant fashion preserving the multi-element geometric constraints. The inter-penetration and surface contact filter features a three-layer scoring system, through which docked models with high contact area and low clashes are funneled. This suite of processes enables a pipelined operation of molecular docking with high efficacy. Accurate and fast docking has been achieved with a rich collection of complexes and unbound molecules, including protein-protein and protein-small molecule associations. An energy evaluation routine assesses the intermolecular interactions of the funneled models obtained from the docking of the bound molecules by pairwise van der Waals and Coulombic potentials. Applications of this routine demonstrate the goodness of the high scoring, geometrically docked conformations of the bound crystal complexes.

Shape complementarity at protein-protein interfaces

A matching algorithm using surface complementarity between receptor and ligand protein molecules is outlined. The molecular surfaces are represented by "critical points," describing holes and knobs. Holes (maxima of a shape function) are matched with knobs (minima). This simple and appealing surface representation has been previously described by Connolly [(1986) Biopolymers, Vol. 25, pp. 1229-1247]. However, attempts to implement this description in a docking scheme have been unsuccessful (e.g., Connolly, ibid.). In order to decrease the combinatorial complexity, and to make the execution time affordable, four critical hole/knob point matches were sought. This approach failed since some bound interfaces are relatively flat and do not possess four critical point matches. On the otherhand, matchings of fewer critical points require a very time-consuming, full conformational (grid) space search [Wang, (1991) Journal of Computational Chemistry, Vol. 12, pp. 746-750]. Here we show that despite the initial failure of this approach, with a simple and straightforward modification in the matching algorithm, this surface representation works well. Out of the 16 protein-protein complexes we have tried, 15 were successfully docked, including two immunoglobulins. The entire molecular surfaces were considered, with absolutely no additional information regarding the binding sites. The whole process is completely automated, with no manual intervention, either in the input atomic coordinate data, or in the matching. We have been able to reach this level of performance with the hole/knob surface description by using pairs of critical points along with their surface normals in the calculation of the transformation matrix. The success of this approach suggests that future docking methods should use geometric docking as the first screening filter.(ABSTRACT TRUNCATED AT 250 WORDS)

Segmentation of protein surfaces using fuzzy logic

An algorithm has been developed that can be used to divide triangulated molecular surfaces into distinct domains on the basis of physical and topographical molecular properties. Domains are defined by a certain degree of homogeneity concerning one of these properties. The method is based on fuzzy logic strategies, thus taking into consideration the smooth changes of the properties considered along complex macromolecular surfaces. Scalar qualities assigned to every node point on a triangulated surface are translated into linguistic variables, which can then be processed using a special fuzzy dissimilarity operator. Possible applications are demonstrated using surface segmentation for properties like electrostatic potential, lipophilicity and shape for the analysis of serine proteinase substrate/inhibitor specificity.

Molecular surface representations by sparse critical points

We have defined a molecular surface representation that describes precisely and concisely the complete molecular surface. The representation consists of a limited number of critical points disposed at key locations over the surface. These points adequately represent the shape and the important characteristics of the surface, despite the fact that they are modest in number. We expect the representation to be useful in areas such as molecular recognition and visualization. In particular, using this representation, we are able to achieve accurate and efficient protein-protein and protein-small molecule docking.