Multi-resolution contour-based fitting of macromolecular structures

A novel contour-based matching criterion is presented for the quantitative docking of high-resolution structures of components into low-resolution maps of macromolecular complexes. The proposed Laplacian filter is combined with a six-dimensional search using fast Fourier transforms to rapidly scan the rigid-body degrees of freedom of a probe molecule relative to a fixed target density map. A comparison of the docking performance with the standard cross-correlation criterion demonstrates that contour matching with the Laplacian filter significantly extends the viable resolution range of correlation-based fitting to resolutions as low as 30 A. The gain in docking precision at medium to low resolution (15-30 A) is critical for image reconstructions from electron microscopy (EM). The new algorithm enables for the first time the reliable docking of smaller molecular components into EM densities of large biomolecular assemblies at such low resolutions. As an example of the practical effectiveness of contour-based fitting, a new pseudo-atomic model of a microtubule was constructed from a 20 A resolution EM map and from atomic structures of alpha and beta tubulin subunits.     

Exploring docking methods for virtual screening: application to the identification of neuraminidase and Ftsz potential inhibitors

Virtual screenings based on molecular docking play a major role in medicinal chemistry for the identification of new bioactive molecules. For this purpose, several docking methods can be used. Here, using Arguslab as software and a Gold Platinum subset library of commercially available compounds from Asinex, two docking methods associated to the scoring function Ascore were employed to investigate virtual screenings. One method is based on a genetic algorithm and the other based on a shape-based method. As case studies, both docking techniques were explored by targeting the PC190723 binding site of FtsZ protein from Staphylococcus aureus and the active site of N8 neuraminidase from Influenza virus. Following four docking sequences for each docking engine, the genetic algorithm led to multiple docking results, whereas the shape-based method gave reproducible results. The present study shows that the stochastic nature of the genetic algorithm will require the biological evaluation of more compounds than the shape-based method. This study showed that both methods are complementary and also led to the identification of neuraminidase and FtsZ potential inhibitors.     

Yucca: an efficient algorithm for small-molecule docking

In this paper, we present a new algorithm, which is based on an efficient heuristic for local search, for rigid protein-small-molecule docking. We tested our algorithm, called Yucca, on the recent 100-complex benchmark, using the conformer generator OMEGA to generate a set of low-energy conformers. The results showed that Yucca is competitive both in terms of algorithm efficiency and docking accuracy.     

New algorithm to model protein-protein recognition based on surface complementarity. Applications to antibody-antigen docking.

A novel algorithm is presented which models protein-protein interactions using surface complementarity. The method is applied to antibody-antigen docking. A steric scoring scheme, based upon a soft potential, is used to assess complementarity, and a simple electrostatic model is then used to remove infeasible interactions. The soft potential allows for structural changes that occur during docking. Biochemical knowledge is necessary to reduce the number of docking orientations produced by the method to a manageable size. The information used includes the known epitope residues and a single loose distance constraint. The method is applied to all three crystallographically determined antibody-lysozyme complexes, HyHEL-10, D1.3 and HyHEL-5. For the first time, a predicted antibody structure (that of D1.3) is used as a docking target. In the four systems modelled, the method identifies between 15 and 40 possible docking orientations. The root-mean-square (r.m.s.) deviation between these orientations and the relevant crystallographic complex is measured in the interface region. For all four complexes an orientation is found with r.m.s. deviation in the range 1.9 A and 4.8 A. The algorithm is implemented on a single instruction/multiple datastream (SI/MD) architecture computer. The use of a parallel architecture computer ensures detailed coverage of the search space, whilst still maintaining a search time of two days.     

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 .     

A soft docking algorithm for predicting the structure of antibody-antigen complexes

An efficient soft docking algorithm is described for predicting the mode of binding between an antibody and its antigen based on the three-dimensional structures of the molecules. The basic tools are the "simplified protein" model and the docking algorithm of Wodak and Janin. The side-chain flexibility of Arg, Lys, Asp, Glu, and Met residues on the protein surface is taken into account. A combined filtering technique is used to select candidate binding modes. After energy minimization, we calculate a scoring function, which includes electrostatic and desolvation energy terms. This procedure was applied to targets 04, 05, and 06 of CAPRI, which are complexes of three different camelid antibody VHH variable domains with pig alpha-amylase. For target 06, two native-like structures with a root-mean-square deviation < 4.0 A relative to the X-ray structure were found within the five top ranking structures. For targets 04 and 05, our procedure produced models where more than half of the antigen residues forming the epitope were correctly predicted, albeit with a wrong VHH domain orientation. Thus, our soft docking algorithm is a promising tool for predicting antibody-antigen recognition.     

A hierarchical method for molecular docking using cloud computing

Discovering small molecules that interact with protein targets will be a key part of future drug discovery efforts. Molecular docking of drug-like molecules is likely to be valuable in this field; however, the great number of such molecules makes the potential size of this task enormous. In this paper, a method to screen small molecular databases using cloud computing is proposed. This method is called the hierarchical method for molecular docking and can be completed in a relatively short period of time. In this method, the optimization of molecular docking is divided into two subproblems based on the different effects on the protein–ligand interaction energy. An adaptive genetic algorithm is developed to solve the optimization problem and a new docking program (FlexGAsDock) based on the hierarchical docking method has been developed. The implementation of docking on a cloud computing platform is then discussed. The docking results show that this method can be conveniently used for the efficient molecular design of drugs.     

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.     

Efficient molecular docking of NMR structures: application to HIV-1 protease

Docking ligands into an ensemble of NMR conformers is essential to structure-based drug discovery if only NMR structures are available for the target. However, sequentially docking ligands into each NMR conformer through standard single-receptor-structure docking, referred to as sequential docking, is computationally expensive for large-scale database screening because of the large number of NMR conformers involved. Recently, we developed an efficient ensemble docking algorithm to consider protein structural variations in ligand binding. The algorithm simultaneously docks ligands into an ensemble of protein structures and achieves comparable performance to sequential docking without significant increase in computational time over single-structure docking. Here, we applied this algorithm to docking with NMR structures. The HIV-1 protease was used for validation in terms of docking accuracy and virtual screening. Ensemble docking of the NMR structures identified 91% of the known inhibitors under the criterion of RMSD < 2.0 A for the best-scored conformation, higher than the average success rate of single docking of individual crystal structures (66%). In the virtual screening test, on average, ensemble docking of the NMR structures obtained higher enrichments than single-structure docking of the crystal structures. In contrast, docking of either the NMR minimized average structure or a single NMR conformer performed less satisfactorily on both binding mode prediction and virtual screening, indicating that a single NMR structure may not be suitable for docking calculations. The success of ensemble docking of the NMR structures suggests an efficient alternative method for standard single docking of crystal structures and for considering protein flexibility.     

Electrostatic contributions to protein-protein interactions: fast energetic filters for docking and their physical basis

The methods of continuum electrostatics are used to calculate the binding free energies of a set of protein-protein complexes including experimentally determined structures as well as other orientations generated by a fast docking algorithm. In the native structures, charged groups that are deeply buried were often found to favor complex formation (relative to isosteric nonpolar groups), whereas in nonnative complexes generated by a geometric docking algorithm, they were equally likely to be stabilizing as destabilizing. These observations were used to design a new filter for screening docked conformations that was applied, in conjunction with a number of geometric filters that assess shape complementarity, to 15 antibody-antigen complexes and 14 enzyme-inhibitor complexes. For the bound docking problem, which is the major focus of this paper, native and near-native solutions were ranked first or second in all but two enzyme-inhibitor complexes. Less success was encountered for antibody-antigen complexes, but in all cases studied, the more complete free energy evaluation was able to identify native and near-native structures. A filter based on the enrichment of tyrosines and tryptophans in antibody binding sites was applied to the antibody-antigen complexes and resulted in a native and near-native solution being ranked first and second in all cases. A clear improvement over previously reported results was obtained for the unbound antibody-antigen examples as well. The algorithm and various filters used in this work are quite efficient and are able to reduce the number of plausible docking orientations to a size small enough so that a final more complete free energy evaluation on the reduced set becomes computationally feasible.     

Escher: A new docking procedure applied to the reconstruction of protein tertiary structure

Evaluation of Surface Complementarity, Hydrogen bonding, and Electrostatic interaction in molecular Recognition (ESCHER) is a new docking procedure consisting of three modules that work in series. The first module evaluates the geometric complementarity and produces a set of rough solutions for the docking problem. The second module identifies molecular collisions within those solutions, and the third evaluates their electrostatic complementarity. We describe the algorithm and its application to the docking of cocrystallized protein domains and unbound components of protein-protein complexes. Furthermore, ESCHER has been applied to the reassociation of secondary and supersecondary structure elements. The possibility of applying a docking method to the problem of protein structure prediction is discussed. Proteins 28:556–567, 1997. © 1997 Wiley-Liss, Inc.     

Weighted geometric docking: incorporating external information in the rotation-translation scan

Weighted geometric docking is a prediction algorithm that matches weighted molecular surfaces. Each molecule is represented by a grid of complex numbers, storing information about the shape of the molecule in the real part and weight information in the imaginary part. The weights are based on experimental biochemical and biophysical data or on theoretical analyses of amino acid conservation or correlation patterns in multiple-sequence alignments of homologous proteins. Only a few surface residues on either one or both molecules are weighted. In contrast to methods that use postscan filtering based on biochemical information, our method incorporates the external data in the rotation-translation search, producing a different set of docking solutions biased toward solutions in which the up-weighted residues are at the interface. Similarly, interactions involving specified residues can be impeded. The weighted geometric algorithm was applied to five systems for which regular geometric docking of the unbound molecules gave poor results. We obtained much better ranking of the nearly correct prediction and higher statistical significance when weighted geometric docking was used. The method was successful even when the weighted portion of the surface corresponded only partially and approximately to the binding site.     

A fast protein-ligand docking algorithm based on hydrogen bond matching and surface shape complementarity

With the rapid development of structural determination of target proteins for human diseases, high throughout virtual screening based drug discovery is gaining popularity gradually. In this paper, a fast docking algorithm (H-DOCK) based on hydrogen bond matching and surface shape complementarity was developed. In H-DOCK, firstly a divide-and-conquer strategy based enumeration approach is applied to rank the intermolecular modes between protein and ligand by maximizing their hydrogen bonds matching, then each docked conformation of the ligand is calculated according to the matched hydrogen bonding geometry, finally a simple but effective scoring function reflecting mainly the van der Waals interaction is used to evaluate the docked conformations of the ligand. H-DOCK is tested for rigid ligand docking and flexible one, the latter is implemented by repeating rigid docking for multiple conformations of a small molecule and ranking all together. For rigid ligands, H-DOCK was tested on a set of 271 complexes where there is at least one intermolecular hydrogen bond, and H-DOCK achieved success rate (RMSD<2.0?Å) of 91.1%. For flexible ligands, H-DOCK was tested on another set of 93 complexes, where each case was a conformation ensemble containing native ligand conformation as well as 100 decoy ones generated by AutoDock [1], and the success rate reached 81.7%. The high success rate of H-DOCK indicates that the hydrogen bonding and steric hindrance can grasp the key interaction between protein and ligand. H-DOCK is quite efficient compared with the conventional docking algorithms, and it takes only about 0.14 seconds for a rigid ligand docking and about 8.25 seconds for a flexible one on average. According to the preliminary docking results, it implies that H-DOCK can be potentially used for large scale virtual screening as a pre-filter for a more accurate but less efficient docking algorithm.     

Protein-protein docking by simulating the process of association subject to biochemical constraints

We present a computational procedure for modeling protein-protein association and predicting the structures of protein-protein complexes. The initial sampling stage is based on an efficient Brownian dynamics algorithm that mimics the physical process of diffusional association. Relevant biochemical data can be directly incorporated as distance constraints at this stage. The docked configurations are then grouped with a hierarchical clustering algorithm into ensembles that represent potential protein-protein encounter complexes. Flexible refinement of selected representative structures is done by molecular dynamics simulation. The protein-protein docking procedure was thoroughly tested on 10 structurally and functionally diverse protein-protein complexes. Starting from X-ray crystal structures of the unbound proteins, in 9 out of 10 cases it yields structures of protein-protein complexes close to those determined experimentally with the percentage of correct contacts >30% and interface backbone RMSD <4 A. Detailed examination of all the docking cases gives insights into important determinants of the performance of the computational approach in modeling protein-protein association and predicting of protein-protein complex structures.     

Molecular recognition. I. Automatic identification of topographic surface features

The phenomenon of molecular recognition depends strongly on surface complementarity between associating molecular units, analogous to the assembly of a three-dimensional jigsaw puzzle. The driving force for association is solvent entropy, which increases when protrusions of the irregular surface of one subunit fit snugly into invaginations of the other, squeezing out intervening water. To model this process, an algorithm is presented that automatically finds the prominent topographic surface features of rigid α-helices in proteins of known structure. When the algorithm was applied to two interacting helices from flavodoxin, only a small number of such features were found, and they accounted for the observed complementarity. Using this algorithm, molecular docking can be reduced to a tractable problem by a docking strategy based on exhaustive trial of combinations of surface features.     

分子对接的随机聚点搜索算法

随机聚点搜索算法是一种普遍的全局极小化方法,在目标函数自变量数目不很大时,计算效率较高。将该算法应用于分子对接,首先要通过模型分子对接,反复调整算法各控制参数使效率最高。对于HIV－1蛋白酶与苯甲醚配体的刚性对接,算法成功的找到了相互作用能量全局极小,与晶体结构的均方根偏差(RMSD)仅0.2?。这表明,该算法可高效率找到分子对接的能量最适构型。     

一种基于SVR的分辨近天然G蛋白耦联受体—配体构象的方法

蛋白质小分子对接的难点之一是从生成的大量候选结构中挑选出近天然构象。本文使用了一种基于SVR的方法来挑选RosettaLigand生成的GPCR—配体decoy构象中的近天然构象。首先,对已有数据训练得到一个SVR模型,预测decoy构象的LRMSD,然后依此挑选近天然构象。最终,比较了本文方法和RosettaLigand方法挑选出的近天然构象decoy的质量,结果优于RosettaLigand方法,结果表明了本文方法能够有效地挑选出近天然构象。