Search strategies and evaluation in protein–protein docking: principles, advances and challenges

Improved Accuracy for Modeling PROTAC-Mediated Ternary Complex Formation and Targeted Protein Degradation via New In Silico Methodologies

Extending upon our previous publication [Drummond, M.; J. Chem. Inf. Model. 2019, 59, 1634-1644], two additional computational methods are presented to model PROTAC-mediated ternary complex structures, which are then used to predict the efficacy of any accompanying protein degradation. Method 4B, an extension to one of our previous approaches, incorporates a clustering procedure uniquely suited for considering ternary complexes. Method 4B yields the highest proportion to date of crystal-like poses in modeled ternary complex ensembles, nearing 100% in two cases and always giving a hit rate of at least 10%. Techniques to further improve this performance for particularly troublesome cases are suggested and validated. This demonstrated ability to reliably reproduce known crystallographic ternary complex structures is further established through modeling of a newly released crystal structure. Moreover, for the far more common scenario where the structure of the ternary complex intermediate is unknown, the methods detailed in this work nonetheless consistently yield results that reliably follow experimental protein degradation trends, as established through seven retrospective case studies. These various case studies cover challenging yet common modeling situations, such as when the precise orientation of the PROTAC binding moiety in one (or both) of the protein pockets has not been experimentally established. Successful results are presented for one PROTAC targeting many proteins, for different PROTACs targeting the same protein, and even for degradation effected by an E3 ligase that has not been structurally characterized in a ternary complex. Overall, the computational modeling approaches detailed in this work should greatly facilitate PROTAC screening and design efforts, so that the many advantages of a PROTAC-based degradation approach can be effectively utilized both rapidly and at reduced cost.

Topology-independent and global protein structure alignment through an FFT-based algorithm

MOTIVATION

Protein structure alignment is one of the fundamental problems in computational structure biology. A variety of algorithms have been developed to address this important issue in the past decade. However, due to their heuristic nature, current structure alignment methods may suffer from suboptimal alignment and/or over-fragmentation and thus lead to a biologically wrong alignment in some cases. To overcome these limitations, we have developed an accurate topology-independent and global structure alignment method through an FFT-based exhaustive search algorithm, which is referred to as FTAlign.

RESULTS

Our FTAlign algorithm was extensively tested on six commonly used datasets and compared with seven state-of-the-art structure alignment approaches, TMalign, DeepAlign, Kpax, 3DCOMB, MICAN, SPalignNS and CLICK. It was shown that FTAlign outperformed the other methods in reproducing manually curated alignments and obtained a high success rate of 96.7 and 90.0% on two gold-standard benchmarks, MALIDUP and MALISAM, respectively. Moreover, FTAlign also achieved the overall best performance in terms of biologically meaningful structure overlap (SO) and TMscore on both the sequential alignment test sets including MALIDUP, MALISAM and 64 difficult cases from HOMSTRAD, and the non-sequential sets including MALIDUP-NS, MALISAM-NS, 199 topology-different cases, where FTAlign especially showed more advantage for non-sequential alignment. Despite its global search feature, FTAlign is also computationally efficient and can normally complete a pairwise alignment within one second.

AVAILABILITY AND IMPLEMENTATION

http://huanglab.phys.hust.edu.cn/ftalign/.

Protein-ensemble-RNA docking by efficient consideration of protein flexibility through homology models

MOTIVATION

Given the importance of protein-ribonucleic acid (RNA) interactions in many biological processes, a variety of docking algorithms have been developed to predict the complex structure from individual protein and RNA partners in the past decade. However, due to the impact of molecular flexibility, the performance of current methods has hit a bottleneck in realistic unbound docking. Pushing the limit, we have proposed a protein-ensemble-RNA docking strategy to explicitly consider the protein flexibility in protein-RNA docking through an ensemble of multiple protein structures, which is referred to as MPRDock. Instead of taking conformations from MD simulations or experimental structures, we obtained the multiple structures of a protein by building models from its homologous templates in the Protein Data Bank (PDB).

RESULTS

Our approach can not only avoid the reliability issue of structures from MD simulations but also circumvent the limited number of experimental structures for a target protein in the PDB. Tested on 68 unbound-bound and 18 unbound-unbound protein-RNA complexes, our MPRDock/DITScorePR considerably improved the docking performance and achieved a significantly higher success rate than single-protein rigid docking whether pseudo-unbound templates are included or not. Similar improvements were also observed when combining our ensemble docking strategy with other scoring functions. The present homology model-based ensemble docking approach will have a general application in molecular docking for other interactions.

AVAILABILITY AND IMPLEMENTATION

http://huanglab.phys.hust.edu.cn/mprdock/.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

HNADOCK: a nucleic acid docking server for modeling RNA/DNA-RNA/DNA 3D complex structures

Interactions between nuclide acids (RNA/DNA) play important roles in many basic cellular activities like transcription regulation, RNA processing, and protein synthesis. Therefore, determining the complex structures between RNAs/DNAs is crucial to understand the molecular mechanism of related RNA/DNA-RNA/DNA interactions. Here, we have presented HNADOCK, a user-friendly web server for nucleic acid (NA)-nucleic acid docking to model the 3D complex structures between two RNAs/DNAs, where both sequence and structure inputs are accepted for RNAs, while only structure inputs are supported for DNAs. HNADOCK server was tested through both unbound structure and sequence inputs on the benchmark of 60 RNA-RNA complexes and compared with the state-of-the-art algorithm SimRNA. For structure input, HNADOCK server achieved a high success rate of 71.7% for top 10 predictions, compared to 58.3% for SimRNA. For sequence input, HNADOCK server also obtained a satisfactory performance and gave a success rate of 83.3% when the bound RNA templates are included or 53.3% when excluding those bound RNA templates. It was also found that inclusion of the inter-RNA base-pairing information from RNA-RNA interaction prediction can significantly improve the docking accuracy, especially for the top prediction. HNADOCK is fast and can normally finish a job in about 10 minutes. The HNADOCK web server is available at http://huanglab.phys.hust.edu.cn/hnadock/.

Challenges and opportunities of automated protein-protein docking: HDOCK server vs human predictions in CAPRI Rounds 38-46

Protein-protein docking plays an important role in the computational prediction of the complex structure between two proteins. For years, a variety of docking algorithms have been developed, as witnessed by the critical assessment of prediction interactions (CAPRI) experiments. However, despite their successes, many docking algorithms often require a series of manual operations like modeling structures from sequences, incorporating biological information, and selecting final models. The difficulties in these manual steps have significantly limited the applications of protein-protein docking, as most of the users in the community are nonexperts in docking. Therefore, automated docking like a web server, which can give a comparable performance to human docking protocol, is pressingly needed. As such, we have participated in the blind CAPRI experiments for Rounds 38-45 and CASP13-CAPRI challenge for Round 46 with both our HDOCK automated docking web server and human docking protocol. It was shown that our HDOCK server achieved an "acceptable" or higher CAPRI-rated model in the top 10 submitted predictions for 65.5% and 59.1% of the targets in the docking experiments of CAPRI and CASP13-CAPRI, respectively, which are comparable to 66.7% and 54.5% for human docking protocol. Similar trends can also be observed in the scoring experiments. These results validated our HDOCK server as an efficient automated docking protocol for nonexpert users. Challenges and opportunities of automated docking are also discussed.

DR-SIP: protocols for higher order structure modeling with distance restraints- and cyclic symmetry-imposed packing

MOTIVATION

Quaternary structure determination for transmembrane/soluble proteins requires a reliable computational protocol that leverages observed distance restraints and/or cyclic symmetry (Cn symmetry) found in most homo-oligomeric transmembrane proteins.

RESULTS

We survey 118 X-ray crystallographically solved structures of homo-oligomeric transmembrane proteins (HoTPs) and find that ∼97% are Cn symmetric. Given the prevalence of Cn symmetric HoTPs and the benefits of incorporating geometry restraints in aiding quaternary structure determination, we introduce two new filters, the distance-restraints (DR) and the Symmetry-Imposed Packing (SIP) filters. SIP relies on a new method that can rebuild the closest ideal Cn symmetric complex from docking poses containing a homo-dimer without prior knowledge of the number (n) of monomers. Using only the geometrical filter, SIP, near-native poses of 7 HoTPs in their monomeric states can be correctly identified in the top-10 for 71% of all cases, or 29% among 31 HoTP structures obtained through homology modeling, while ZDOCK alone returns 14 and 3%, respectively. When the n is given, the optional n-mer filter is applied with SIP and returns the near-native poses for 76% of the test set within the top-10, outperforming M-ZDOCK's 55% and Sam's 47%. While applying only SIP to three HoTPs that comes with distance restraints, we found the near-native poses were ranked 1st, 1st and 10th among 54 000 possible decoys. The results are further improved to 1st, 1st and 3rd when both DR and SIP filters are used. By applying only DR, a soluble system with distance restraints is recovered at the 1st-ranked pose.

AVAILABILITY AND IMPLEMENTATION

https://github.com/capslockwizard/drsip.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Multiscale Visual Drilldown for the Analysis of Large Ensembles of Multi-Body Protein Complexes

When studying multi-body protein complexes, biochemists use computational tools that can suggest hundreds or thousands of their possible spatial configurations. However, it is not feasible to experimentally verify more than only a very small subset of them. In this paper, we propose a novel multiscale visual drilldown approach that was designed in tight collaboration with proteomic experts, enabling a systematic exploration of the configuration space. Our approach takes advantage of the hierarchical structure of the data - from the whole ensemble of protein complex configurations to the individual configurations, their contact interfaces, and the interacting amino acids. Our new solution is based on interactively linked 2D and 3D views for individual hierarchy levels. At each level, we offer a set of selection and filtering operations that enable the user to narrow down the number of configurations that need to be manually scrutinized. Furthermore, we offer a dedicated filter interface, which provides the users with an overview of the applied filtering operations and enables them to examine their impact on the explored ensemble. This way, we maintain the history of the exploration process and thus enable the user to return to an earlier point of the exploration. We demonstrate the effectiveness of our approach on two case studies conducted by collaborating proteomic experts.

iScore: a novel graph kernel-based function for scoring protein-protein docking models

MOTIVATION

Protein complexes play critical roles in many aspects of biological functions. Three-dimensional (3D) structures of protein complexes are critical for gaining insights into structural bases of interactions and their roles in the biomolecular pathways that orchestrate key cellular processes. Because of the expense and effort associated with experimental determinations of 3D protein complex structures, computational docking has evolved as a valuable tool to predict 3D structures of biomolecular complexes. Despite recent progress, reliably distinguishing near-native docking conformations from a large number of candidate conformations, the so-called scoring problem, remains a major challenge.

RESULTS

Here we present iScore, a novel approach to scoring docked conformations that combines HADDOCK energy terms with a score obtained using a graph representation of the protein-protein interfaces and a measure of evolutionary conservation. It achieves a scoring performance competitive with, or superior to, that of state-of-the-art scoring functions on two independent datasets: (i) Docking software-specific models and (ii) the CAPRI score set generated by a wide variety of docking approaches (i.e. docking software-non-specific). iScore ranks among the top scoring approaches on the CAPRI score set (13 targets) when compared with the 37 scoring groups in CAPRI. The results demonstrate the utility of combining evolutionary, topological and energetic information for scoring docked conformations. This work represents the first successful demonstration of graph kernels to protein interfaces for effective discrimination of near-native and non-native conformations of protein complexes.

AVAILABILITY AND IMPLEMENTATION

The iScore code is freely available from Github: https://github.com/DeepRank/iScore (DOI: 10.5281/zenodo.2630567). And the docking models used are available from SBGrid: https://data.sbgrid.org/dataset/684).

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Visual Analysis of Protein-Protein Interaction Docking Models Using COZOID Tool

Networks of protein-protein interactions (PPI) constitute either stable or transient complexes in every cell. Most of the cellular complexes keep their function, and therefore stay similar, during evolution. The evolutionary constraints preserve most cellular functions via preservation of protein structures and interactions. The evolutionary conservation information is utilized in template-based approaches, like protein structure modeling or docking. Here we use the combination of the template-free docking method with conservation-based selection of the best docking model using our newly developed COZOID tool.We describe a step-by-step protocol for visual selection of docking models, based on their similarity to the original protein complex structure. Using the COZOID tool, we first analyze contact zones of the original complex structure and select contact amino acids for docking restraints. Then we model and dock the homologous proteins. Finally, we utilize different analytical modes of our COZOID tool to select the docking models most similar to the original complex structure.

Pushing the accuracy limit of shape complementarity for protein-protein docking

Background

Protein-protein docking is a valuable computational approach for investigating protein-protein interactions. Shape complementarity is the most basic component of a scoring function and plays an important role in protein-protein docking. Despite significant progresses, shape representation remains an open question in the development of protein-protein docking algorithms, especially for grid-based docking approaches.

Results

We have proposed a new pairwise shape-based scoring function (LSC) for protein-protein docking which adopts an exponential form to take into account long-range interactions between protein atoms. The LSC scoring function was incorporated into our FFT-based docking program and evaluated for both bound and unbound docking on the protein docking benchmark 4.0. It was shown that our LSC achieved a significantly better performance than four other similar docking methods, ZDOCK 2.1, MolFit/G, GRAMM, and FTDock/G, in both success rate and number of hits. When considering the top 10 predictions, LSC obtained a success rate of 51.71% and 6.82% for bound and unbound docking, respectively, compared to 42.61% and 4.55% for the second-best program ZDOCK 2.1. LSC also yielded an average of 8.38 and 3.94 hits per complex in the top 1000 predictions for bound and unbound docking, respectively, followed by 6.38 and 2.96 hits for the second-best ZDOCK 2.1.

Conclusions

The present LSC method will not only provide an initial-stage docking approach for post-docking processes but also have a general implementation for accurate representation of other energy terms on grids in protein-protein docking. The software has been implemented in our HDOCK web server at http://hdock.phys.hust.edu.cn/.

RapidRMSD: rapid determination of RMSDs corresponding to motions of flexible molecules

Motivation

The root mean square deviation (RMSD) is one of the most used similarity criteria in structural biology and bioinformatics. Standard computation of the RMSD has a linear complexity with respect to the number of atoms in a molecule, making RMSD calculations time-consuming for the large-scale modeling applications, such as assessment of molecular docking predictions or clustering of spatially proximate molecular conformations. Previously, we introduced the RigidRMSD algorithm to compute the RMSD corresponding to the rigid-body motion of a molecule. In this study, we go beyond the limits of the rigid-body approximation by taking into account conformational flexibility of the molecule. We model the flexibility with a reduced set of collective motions computed with e.g. normal modes or principal component analysis.

Results

The initialization of our algorithm is linear in the number of atoms and all the subsequent evaluations of RMSD values between flexible molecular conformations depend only on the number of collective motions that are selected to model the flexibility. Therefore, our algorithm is much faster compared to the standard RMSD computation for large-scale modeling applications. We demonstrate the efficiency of our method on several clustering examples, including clustering of flexible docking results and molecular dynamics (MD) trajectories. We also demonstrate how to use the presented formalism to generate pseudo-random constant-RMSD structural molecular ensembles and how to use these in cross-docking.

Availability and implementation

We provide the algorithm written in C++ as the open-source RapidRMSD library governed by the BSD-compatible license, which is available at http://team.inria.fr/nano-d/software/RapidRMSD/. The constant-RMSD structural ensemble application and clustering of MD trajectories is available at http://team.inria.fr/nano-d/software/nolb-normal-modes/.

Supplementary information

Supplementary data are available at Bioinformatics online.

Determination of an effective scoring function for RNA-RNA interactions with a physics-based double-iterative method

RNA–RNA interactions play fundamental roles in gene and cell regulation. Therefore, accurate prediction of RNA–RNA interactions is critical to determine their complex structures and understand the molecular mechanism of the interactions. Here, we have developed a physics-based double-iterative strategy to determine the effective potentials for RNA–RNA interactions based on a training set of 97 diverse RNA–RNA complexes. The double-iterative strategy circumvented the reference state problem in knowledge-based scoring functions by updating the potentials through iteration and also overcame the decoy-dependent limitation in previous iterative methods by constructing the decoys iteratively. The derived scoring function, which is referred to as DITScoreRR, was evaluated on an RNA–RNA docking benchmark of 60 test cases and compared with three other scoring functions. It was shown that for bound docking, our scoring function DITScoreRR obtained the excellent success rates of 90% and 98.3% in binding mode predictions when the top 1 and 10 predictions were considered, compared to 63.3% and 71.7% for van der Waals interactions, 45.0% and 65.0% for ITScorePP, and 11.7% and 26.7% for ZDOCK 2.1, respectively. For unbound docking, DITScoreRR achieved the good success rates of 53.3% and 71.7% in binding mode predictions when the top 1 and 10 predictions were considered, compared to 13.3% and 28.3% for van der Waals interactions, 11.7% and 26.7% for our ITScorePP, and 3.3% and 6.7% for ZDOCK 2.1, respectively. DITScoreRR also performed significantly better in ranking decoys and obtained significantly higher score-RMSD correlations than the other three scoring functions. DITScoreRR will be of great value for the prediction and design of RNA structures and RNA–RNA complexes.

The trip of a drug inside the body: From a lipid-based nanocarrier to a target cell

To date, enormous investigations have been conducted to enhance medicines' target-oriented delivery to improve their therapeutic index. In this regard, lipid-based carrier system might have been regarded as prime delivery systems that are very close to the naturally cell-derived vesicles used for biomolecular communication among cells from occasionally remote tissues. Upon examination of the literature, we found a chasm between groups of investigations in drug pharmaceutics and thought that maybe holistic research could provide better information with respect to drug delivery inside the body, especially when they are going to be injected directly into the bloodstream for systemic distribution. While a collection of older research in most cases dealt with the determination of drug partition coefficient between the aqueous and cell membrane compartments, the link has been overlooked in newer investigations that were mostly focused on drug formulation optimization and their association with particle biodistribution. This gap in the literature motivated us to present the current opinion paper, in which drug physicochemical properties like drug lipophilicity/hydrophilicity is considered as an important element in designing drug-carrying liposomes or micelles. How a hypothetical high throughput cell-embedded chromatographic technique might help to investigate a nanocarrier tissue distribution and to design 'multi-epitope grafted lipid-based drug carrier systems' are discussed. Whenever we would need support for our opinions, we have provided analogy from hydrophobic biomolecules like cholesterol, steroid hormones, and sex hormones and encouraged readers to consider our principle hypothesis: If these molecules could reach their targets far away from the site of production, then a large list of hydrophobic drugs could be delivered to their targets using the same principles.

Dynamics and Mechanisms in the Recruitment and Transference of Histone Chaperone CIA/ASF1

The recruitment and transference of proteins through protein-protein interactions is a general process involved in various biological functions in cells. Despite the importance of this general process, the dynamic mechanism of how proteins are recruited and transferred from one interacting partner to another remains unclear. In this study, we investigated the dynamic mechanisms of recruitment and translocation of histone chaperone CIA/ASF1 for nucleosome disassembly by exploring the conformational space and the free energy profile of unbound DBD(CCG1) and CIA/ASF1-bound DBD(CCG1) systems through extensive molecular dynamics simulations. It was found that there exists three metastable conformational states for DBD(CCG1), an unbound closed state, a CIA/ASF1-bound half-open state, and an open state. The free energy landscape shows that the closed state and the half-open state are separated by a high free energy barrier, while the half-open state and the open state are connected with a moderate free energy increase. The high free energy barrier between the closed and half-open states explains why DBD(CCG1) can recruit CIA/ASF1 and remain in the binding state during the transportation. In addition, the asymmetric binding of CIA/ASF1 on DBD(CCG1) allows DBD(CCG1) to adopt the open state by moving one of its two domains, such that the exposed domain of DBD(CCG1) is able to recognize the acetylated histone H4 tails. As such, CIA/ASF1 has a chance to translocate from DBD(CCG1) to histone, which is also facilitated by the moderate energy increase from the bound half-open state to the open state of DBD(CCG1). These findings suggest that the recruitment and transference of histone chaperone CIA/ASF1 is highly favored by its interaction with DBD(CCG1) via conformational selection and asymmetric binding, which may represent a general mechanism of similar biological processes.

HDOCK: a web server for protein-protein and protein-DNA/RNA docking based on a hybrid strategy

Protein–protein and protein–DNA/RNA interactions play a fundamental role in a variety of biological processes. Determining the complex structures of these interactions is valuable, in which molecular docking has played an important role. To automatically make use of the binding information from the PDB in docking, here we have presented HDOCK, a novel web server of our hybrid docking algorithm of template-based modeling and free docking, in which cases with misleading templates can be rescued by the free docking protocol. The server supports protein–protein and protein–DNA/RNA docking and accepts both sequence and structure inputs for proteins. The docking process is fast and consumes about 10–20 min for a docking run. Tested on the cases with weakly homologous complexes of <30% sequence identity from five docking benchmarks, the HDOCK pipeline tied with template-based modeling on the protein–protein and protein–DNA benchmarks and performed better than template-based modeling on the three protein–RNA benchmarks when the top 10 predictions were considered. The performance of HDOCK became better when more predictions were considered. Combining the results of HDOCK and template-based modeling by ranking first of the template-based model further improved the predictive power of the server. The HDOCK web server is available at http://hdock.phys.hust.edu.cn/.

EROS-DOCK: protein–protein docking using exhaustive branch-and-bound rotational search

Motivation

Protein–protein docking algorithms aim to predict the 3D structure of a binary complex using the structures of the individual proteins. This typically involves searching and scoring in a 6D space. Many docking algorithms use FFT techniques to exhaustively cover the search space and to accelerate the scoring calculation. However, FFT docking results often depend on the initial protein orientations with respect to the Fourier sampling grid. Furthermore, Fourier-transforming a physics-base force field can involve a serious loss of precision.

Results

Here, we present EROS-DOCK, an algorithm to rigidly dock two proteins using a series of exhaustive 3D rotational searches in which non-clashing orientations are scored using the ATTRACT coarse-grained force field model. The rotational space is represented as a quaternion ‘π-ball’, which is systematically sub-divided in a ‘branch-and-bound’ manner, allowing efficient pruning of rotations that will give steric clashes. The algorithm was tested on 173 Docking Benchmark complexes, and results were compared with those of ATTRACT and ZDOCK. According to the CAPRI quality criteria, EROS-DOCK typically gives more acceptable or medium quality solutions than ATTRACT and ZDOCK.

Availability and implementation

The EROS-DOCK program is available for download at http://erosdock.loria.fr.

Supplementary information

Supplementary data are available at Bioinformatics online.

Comprehensive assessment of flexible-ligand docking algorithms: current effectiveness and challenges

Protein-ligand docking has been playing an important role in modern drug discovery. To model drug-target binding in real systems, a number of flexible-ligand docking algorithms with different sampling strategies and scoring methods have been subsequently developed over the past three decades, while rigid-ligand docking is still being used because of its compelling computational efficiency. Here, a comprehensive assessment has been conducted to investigate the effectiveness of flexible-ligand docking versus rigid-ligand docking for three representative docking algorithms (global optimization, incremental construction and multi-conformer docking) in virtual screening and pose prediction on the Directory of Useful Decoys. It was found that overall flexible-ligand docking did not achieve a statistically significant improvement in enrichments over rigid-ligand docking in virtual screening, but all docking programs significantly improved the success rates when considering ligand flexibility in pose prediction. The worse effectiveness of flexible-ligand docking in virtual screening than in pose prediction suggests that the challenges of current docking algorithms exist in ranking more than docking, although the use of flexible-ligand docking in virtual screening was justified by its better effectiveness for more flexible ligand in virtual screening. Challenges for scoring, including internal energy, charge polarization, entropy and flexibility, were investigated and discussed. An empirical way was also proposed to consider loss of ligand conformational entropy for virtual screening.

Exploring protein-protein interactions using the site-identification by ligand competitive saturation methodology

Protein docking methods are powerful computational tools to study protein-protein interactions (PPI). While a significant number of docking algorithms have been developed, they are usually based on rigid protein models or with limited considerations of protein flexibility and the desolvation effect is rarely considered in docking energy functions, which may lower the accuracy of the predictions. To address these issues, we introduce a PPI energy function based on the site-identification by ligand competitive saturation (SILCS) framework and utilize the fast Fourier transform (FFT) correlation approach. The free energy content of the SILCS FragMaps represent an alternative to traditional energy grids and they can be efficiently utilized to guide FFT-based protein docking. Application of the approach to eight diverse test cases, including seven from Protein Docking Benchmark 5.0, showed the PPI prediction using SILCS approach (SILCS-PPI) to be competitive with several commonly used protein docking methods indicating that the method has the ability to both qualitatively and quantitatively inform the prediction of PPI. Results show the utility of the SILCS-PPI docking approach for determination of probability distributions of PPI interactions over the surface of both partner proteins, allowing for identification of alternate binding poses. Such binding poses are confirmed by experimental crystal contacts in our test cases. While more computationally demanding than available PPI docking technologies, we anticipate that the SILCS-PPI docking approach will offer an alternative methodology for improved evaluation of PPIs that could be used in a variety of fields from systems biology to excipient design for biologics-based drugs.

Protein-protein interactions of human glyoxalase II: findings of a reliable docking protocol

Glyoxalase II (GlxII) is an antioxidant glutathione-dependent enzyme, which catalyzes the hydrolysis of S-d-lactoylglutathione to form d-lactic acid and glutathione (GSH). The last product is the most important thiol reducing agent present in all eukaryotic cells that have mitochondria and chloroplasts. It is generally known that GSH plays a crucial role not only in the cellular redox state but also in various cellular processes. One of them is protein S-glutathionylation, a process that can occur through an oxidation reaction of proteins' thiol groups by GSH. Changes in protein S-glutathionylation have been associated with a range of human diseases such as diabetes, cardiovascular and pulmonary diseases, neurodegenerative diseases and cancer. Within a major project aimed at elucidating the role of GlxII in the mechanism of S-glutathionylation, a reliable computational protocol consisting of a protein-protein docking approach followed by atomistic Molecular Dynamics (MD) simulations was developed and it was applied to the prediction of molecular associations between human GlxII (in the presence and absence of GSH) and some proteins that are known to be S-glutathionylated in vitro, such as actin, malate dehydrogenase (MDH) and glyceraldehyde-3-phosphate dehydrogenase (GAPDH). The computational results show a high propensity of GlxII to interact with actin and MDH through its active site and a high stability of the GlxII-protein systems when GSH is present. Moreover, close proximities of GSH with actin and MDH cysteine residues have been found, suggesting that GlxII could be able to perform protein S-glutathionylation by using the GSH molecule present in its catalytic site.

Evaluation of Predicted Protein-Protein Complexes by Binding Free Energy Simulations

The accurate prediction of protein-protein complex geometries is of major importance to ultimately model the complete interactome of interacting proteins in a cell. A major bottleneck is the realistic free energy evaluation of predicted docked structures. Typically, simple scoring functions applied to single-complex structures are employed that neglect conformational entropy and often solvent effects completely. The binding free energy of a predicted protein-protein complex can, however, be calculated using umbrella sampling (US) along a predefined dissociation/association coordinate of a complex. We employed atomistic US-molecular dynamics simulations including appropriate conformational and axial restraints and an implicit generalized Born solvent model to calculate binding free energies of a large set of docked decoys for 20 different complexes. Free energies associated with the restraints were calculated separately. In principle, the approach includes all energetic and entropic contributions to the binding process. The evaluation of docked complexes based on binding free energy calculation was in better agreement with experiment compared to a simple scoring based on energy minimization or MD refinement using exactly the same force field description. Even calculated absolute binding free energies of structures close to the native binding geometry showed a reasonable correlation to experiment. However, still for a number of complexes docked decoys of lower free energy than near-native geometries were found indicating inaccuracies in the force field or the implicit solvent model. Although time consuming the approach may open up a new route for realistic ranking of predicted geometries based on calculated free energy of binding.

How Can Interleukin-1 Receptor Antagonist Modulate Distinct Cell Death Pathways?

Multiple mechanisms of cell death exist (apoptosis, necroptosis, pyroptosis) and the subtle balance of several distinct proteins and inhibitors tightly regulates the cell fate toward one or the other pathway. Here, by combining coimmunoprecipitation, enzyme assays, and molecular simulations, we ascribe a new role, within this entangled regulatory network, to the interleukin-1 receptor antagonist (IL-1Ra). Our study enlightens that IL-1Ra, which usually inhibits the inflammatory effects of IL-1α/β by binding to IL-1 receptor, under advanced pathological states prevents apoptosis and/or necroptosis by noncompetitively inhibiting the activity of caspase-8 and -9. Consensus docking, followed by cumulative 10 μs of molecular dynamics simulations unprecedentedly reveal that IL-1Ra binds both caspases at their dimeric interface, preventing, in this manner, the formation of their catalytically/signaling active form. The resulting IL-1Ra/caspase-8(9) adducts are stabilized by hydrophobic and by few key hydrogen bonding interactions, formed by residues fully conserved across distinct caspases (-3, -6, -7, -8, and -9), and closely resemble the binding mode of the caspases inhibitors XIAP (X-linked inhibitor of apoptosis) and c-FLIP (cellular FLICE-like inhibitory protein). Tight regulation of the different forms of cell death has a major impact on distinct human illnesses (i.e., cancer, neurodegeneration, ischemic injury, atherosclerosis, viral/bacterial infections, and immune reaction). Hence, our study, pinpointing IL-1Ra as new actor of the intricate cell death regulatory network and gaining an atomic-scale understanding of its mechanism may open new avenues toward innovative therapeutic strategies to tackle major human diseases.

RRDB: a comprehensive and non-redundant benchmark for RNA-RNA docking and scoring

Motivation

With the discovery of more and more noncoding RNAs and their versatile functions, RNA-RNA interactions have received increased attention. Therefore, determination of their complex structures is valuable to understand the molecular mechanism of the interactions. Given the high cost of experimental methods, computational approaches like molecular docking have played an important role in the determination of complex structures, in which a benchmark is critical for the development of docking algorithms.

Results

Meeting the need, we have developed the first comprehensive and nonredundant RNA-RNA docking benchmark (RRDB). The diverse dataset of 123 targets consists of 78 unbound-unbound and 45 bound-unbound (or unbound-bound) test cases. The dataset was classified into three groups according to the interface conformational changes between bound and unbound structures: 47 'easy', 38 'medium' and 38 'difficult' targets. A docking test with the benchmark using ZDOCK 2.1 demonstrated the challenging nature of the RNA-RNA docking problem and the important value of the present benchmark. The bound and unbound cases of the benchmark will be beneficial for the development and optimization of docking and scoring algorithms for RNA-RNA interactions.

Availability and implementation

The benchmark is available at http://huanglab.phys.hust.edu.cn/RRDbenchmark/.

Contact

huangsy@hust.edu.cn.

Supplementary information

Supplementary data are available at Bioinformatics online.

Multiscale Molecular Visualization

We provide a high-level survey of multiscale molecular visualization techniques, with a focus on application-domain questions, challenges, and tasks. We provide a general introduction to molecular visualization basics and describe a number of domain-specific tasks that drive this work. These tasks, in turn, serve as the general structure of the following survey. First, we discuss methods that support the visual analysis of molecular dynamics simulations. We discuss, in particular, visual abstraction and temporal aggregation. In the second part, we survey multiscale approaches that support the design, analysis, and manipulation of DNA nanostructures and related concepts for abstraction, scale transition, scale-dependent modeling, and navigation of the resulting abstraction spaces. In the third part of the survey, we showcase approaches that support interactive exploration within large structural biology assemblies up to the size of bacterial cells. We describe fundamental rendering techniques as well as approaches for element instantiation, visibility management, visual guidance, camera control, and support of depth perception. We close the survey with a brief listing of important tools that implement many of the discussed approaches and a conclusion that provides some research challenges in the field.

ProPOSE: Direct Exhaustive Protein-Protein Docking with Side Chain Flexibility

Despite decades of development, protein-protein docking remains a largely unsolved problem. The main difficulties are the immense space spanned by the translational and rotational degrees of freedom and the prediction of the conformational changes of proteins upon binding. FFT is generally the preferred method to exhaustively explore the translation-rotation space at a fine grid resolution, albeit with the trade-off of approximating force fields with correlation functions. This work presents a direct search alternative that samples the states in Cartesian space at the same resolution and computational cost as standard FFT methods. Operating in real space allows the use of standard force field functional forms used in typical non-FFT methods as well as the implementation of strategies for focused exploration of conformational flexibility. Currently, a few misplaced side chains can cause docking programs to fail. This work specifically addresses the problem of side chain rearrangements upon complex formation. Based on the observation that most side chains retain their unbound conformation upon binding, each rigidly docked pose is initially scored ignoring up to a limited number of side chain overlaps which are resolved in subsequent repacking and minimization steps. On test systems where side chains are altered and backbones held in their bound state, this implementation provides significantly better native pose recovery and higher quality (lower RMSD) predictions when compared with five of the most popular docking programs. The method is implemented in the software program ProPOSE (Protein Pose Optimization by Systematic Enumeration).

HSYMDOCK: a docking web server for predicting the structure of protein homo-oligomers with Cn or Dn symmetry

A major subclass of protein-protein interactions is formed by homo-oligomers with certain symmetry. Therefore, computational modeling of the symmetric protein complexes is important for understanding the molecular mechanism of related biological processes. Although several symmetric docking algorithms have been developed for Cn symmetry, few docking servers have been proposed for Dn symmetry. Here, we present HSYMDOCK, a web server of our hierarchical symmetric docking algorithm that supports both Cn and Dn symmetry. The HSYMDOCK server was extensively evaluated on three benchmarks of symmetric protein complexes, including the 20 CASP11-CAPRI30 homo-oligomer targets, the symmetric docking benchmark of 213 Cn targets and 35 Dn targets, and a nonredundant test set of 55 transmembrane proteins. It was shown that HSYMDOCK obtained a significantly better performance than other similar docking algorithms. The server supports both sequence and structure inputs for the monomer/subunit. Users have an option to provide the symmetry type of the complex, or the server can predict the symmetry type automatically. The docking process is fast and on average consumes 10∼20 min for a docking job. The HSYMDOCK web server is available at http://huanglab.phys.hust.edu.cn/hsymdock/.

Development of a new benchmark for assessing the scoring functions applicable to protein–protein interactions

Aim: Scoring functions are important component of protein–protein docking methods. They need to be evaluated on high-quality benchmarks to reveal their strengths and weaknesses. Evaluation results obtained on such benchmarks can provide valuable guidance for developing more advanced scoring functions. Methodology & results: In our comparative assessment of scoring functions for protein–protein interactions benchmark, the performance of a scoring function was characterized by ‘docking power’ and ‘scoring power’. A high-quality dataset of 273 protein–protein complexes was compiled and employed in both tests. Four scoring functions, including FASTCONTACT, ZRANK, dDFIRE and ATTRACT were tested as demonstration. ZRANK and ATTRACT exhibited encouraging performance in the docking power test. However, all four scoring functions failed badly in the scoring power test. Conclusion: Our comparative assessment of scoring functions for protein–protein interaction benchmark is created especially for assessing the scoring functions applicable to protein–protein interactions. It is different from other benchmarks for assessing protein–protein docking methods. Our benchmark is available to the public at www.pdbbind-cn.org/download/CASF-PPI/ .

Hierarchical Flexible Peptide Docking by Conformer Generation and Ensemble Docking of Peptides

Given the importance of peptide-mediated protein interactions in cellular processes, protein-peptide docking has received increasing attention. Here, we have developed a Hierarchical flexible Peptide Docking approach through fast generation and ensemble docking of peptide conformations, which is referred to as HPepDock. Tested on the LEADS-PEP benchmark data set of 53 diverse complexes with peptides of 3-12 residues, HPepDock performed significantly better than the 11 docking protocols of five small-molecule docking programs (DOCK, AutoDock, AutoDock Vina, Surflex, and GOLD) in predicting near-native binding conformations. HPepDock was also evaluated on the 19 bound/unbound and 10 unbound/unbound protein-peptide complexes of the Glide SP-PEP benchmark and showed an overall better performance than Glide SP-PEP+MM-GBSA and FlexPepDock in both bound and unbound docking. HPepDock is computationally efficient, and the average running time for docking a peptide is ∼15 min with the range from about 1 min for short peptides to around 40 min for long peptides.

COZOID: contact zone identifier for visual analysis of protein-protein interactions

BACKGROUND

Studying the patterns of protein-protein interactions (PPIs) is fundamental for understanding the structure and function of protein complexes. The exploration of the vast space of possible mutual configurations of interacting proteins and their contact zones is very time consuming and requires the proteomic expert knowledge.

RESULTS

In this paper, we propose a novel tool containing a set of visual abstraction techniques for the guided exploration of PPI configuration space. It helps proteomic experts to select the most relevant configurations and explore their contact zones at different levels of detail. The system integrates a set of methods that follow and support the workflow of proteomics experts. The first visual abstraction method, the Matrix view, is based on customized interactive heat maps and provides the users with an overview of all possible residue-residue contacts in all PPI configurations and their interactive filtering. In this step, the user can traverse all input PPI configurations and obtain an overview of their interacting amino acids. Then, the models containing a particular pair of interacting amino acids can be selectively picked and traversed. Detailed information on the individual amino acids in the contact zones and their properties is presented in the Contact-Zone list-view. The list-view provides a comparative tool to rank the best models based on the similarity of their contacts to the template-structure contacts. All these techniques are interactively linked with other proposed methods, the Exploded view and the Open-Book view, which represent individual configurations in three-dimensional space. These representations solve the high overlap problem associated with many configurations. Using these views, the structural alignment of the best models can also be visually confirmed.

CONCLUSIONS

We developed a system for the exploration of large sets of protein-protein complexes in a fast and intuitive way. The usefulness of our system has been tested and verified on several docking structures covering the three major types of PPIs, including coiled-coil, pocket-string, and surface-surface interactions. Our case studies prove that our tool helps to analyse and filter protein-protein complexes in a fraction of the time compared to using previously available techniques.

SnapDock-template-based docking by Geometric Hashing

Motivation

A highly efficient template-based protein–protein docking algorithm, nicknamed SnapDock, is presented. It employs a Geometric Hashing-based structural alignment scheme to align the target proteins to the interfaces of non-redundant protein–protein interface libraries. Docking of a pair of proteins utilizing the 22 600 interface PIFACE library is performed in < 2 min on the average. A flexible version of the algorithm allowing hinge motion in one of the proteins is presented as well.

Results

To evaluate the performance of the algorithm a blind re-modelling of 3547 PDB complexes, which have been uploaded after the PIFACE publication has been performed with success ratio of about 35%. Interestingly, a similar experiment with the template free PatchDock docking algorithm yielded a success rate of about 23% with roughly 1/3 of the solutions different from those of SnapDock. Consequently, the combination of the two methods gave a 42% success ratio.

Availability and implementation

A web server of the application is under development.

Assessing the performance of the MM/PBSA and MM/GBSA methods. 6. Capability to predict protein-protein binding free energies and re-rank binding poses generated by protein-protein docking

Understanding protein-protein interactions (PPIs) is quite important to elucidate crucial biological processes and even design compounds that interfere with PPIs with pharmaceutical significance. Protein-protein docking can afford the atomic structural details of protein-protein complexes, but the accurate prediction of the three-dimensional structures for protein-protein systems is still notoriously difficult due in part to the lack of an ideal scoring function for protein-protein docking. Compared with most scoring functions used in protein-protein docking, the Molecular Mechanics/Generalized Born Surface Area (MM/GBSA) and Molecular Mechanics/Poisson Boltzmann Surface Area (MM/PBSA) methodologies are more theoretically rigorous, but their overall performance for the predictions of binding affinities and binding poses for protein-protein systems has not been systematically evaluated. In this study, we first evaluated the performance of MM/PBSA and MM/GBSA to predict the binding affinities for 46 protein-protein complexes. On the whole, different force fields, solvation models, and interior dielectric constants have obvious impacts on the prediction accuracy of MM/GBSA and MM/PBSA. The MM/GBSA calculations based on the ff02 force field, the GB model developed by Onufriev et al. and a low interior dielectric constant (εin = 1) yield the best correlation between the predicted binding affinities and the experimental data (rp = -0.647), which is better than MM/PBSA (rp = -0.523) and a number of empirical scoring functions used in protein-protein docking (rp = -0.141 to -0.529). Then, we examined the capability of MM/GBSA to identify the possible near-native binding structures from the decoys generated by ZDOCK for 43 protein-protein systems. The results illustrate that the MM/GBSA rescoring has better capability to distinguish the correct binding structures from the decoys than the ZDOCK scoring. Besides, the optimal interior dielectric constant of MM/GBSA for re-ranking docking poses may be determined by analyzing the characteristics of protein-protein binding interfaces. Considering the relatively high prediction accuracy and low computational cost, MM/GBSA may be a good choice for predicting the binding affinities and identifying correct binding structures for protein-protein systems.

Protein-Protein Docking Using Evolutionary Information

The structural modeling of protein complexes by docking simulations has been attracting increasing interest with the rise of proteomics and of the number of experimentally identified binary interactions. Structures of unbound partners, either modeled or experimentally determined, can be used as input to sample as extensively as possible all putative binding modes and single out the most plausible ones. At the scoring step, evolutionary information contained in the joint multiple sequence alignments of both partners can provide key insights to recognize correct interfaces. Here, we describe a computational protocol based on the InterEvDock web server to exploit coevolution constraints in protein-protein docking methods. We provide methodology guidelines to prepare the input protein structures and generate improved alignments. We also explain how to extract and use the information returned by the server through the analysis of two representative examples.

Computational Modelling of Protein Complex Structure and Assembly

Sequence and structure space are nowadays sufficiently large that we can use computational methods to model the structure of proteins based on sequence similarity alone. Not only useful as a standalone tool, homology modelling has also had a transformative effect on the ease with which we can solve crystal structures and electron density maps. Another technique-molecular dynamics-aims to model protein structures from first principles and, thanks to increases in computational power, is slowly becoming a viable tool for studying protein complexes. Finally, the prediction of protein assembly pathways from three-dimensional structures of complexes is also now becoming possible.

Efficient conformational ensemble generation of protein-bound peptides

Conformation generation of protein-bound peptides is critical for the determination of protein–peptide complex structures. Despite significant progress in conformer generation of small molecules, few methods have been developed for modeling protein-bound peptide conformations. Here, we have developed a fast de novo peptide modeling algorithm, referred to as MODPEP, for conformational sampling of protein-bound peptides. Given a sequence, MODPEP builds the peptide 3D structure from scratch by assembling amino acids or helix fragments based on constructed rotamer and helix libraries. The MODPEP algorithm was tested on a diverse set of 910 experimentally determined protein-bound peptides with 3–30 amino acids from the PDB and obtained an average accuracy of 1.90 Å when 200 conformations were sampled for each peptide. On average, MODPEP obtained a success rate of 74.3% for all the 910 peptides and ≥ 90% for short peptides with 3–10 amino acids in reproducing experimental protein-bound structures. Comparative evaluations of MODPEP with three other conformer generation methods, PEP-FOLD3, RDKit, and Balloon, have also been performed in both accuracy and success rate. MODPEP is fast and can generate 100 conformations for less than one second. The fast MODPEP will be beneficial for large-scale de novo modeling and docking of peptides. The MODPEP program and libraries are available for download at http://huanglab.phys.hust.edu.cn/.

In silico methods for design of biological therapeutics

It has been twenty years since the first rationally designed small molecule drug was introduced into the market. Since then, we have progressed from designing small molecules to designing biotherapeutics. This class of therapeutics includes designed proteins, peptides and nucleic acids that could more effectively combat drug resistance and even act in cases where the disease is caused because of a molecular deficiency. Computational methods are crucial in this design exercise and this review discusses the various elements of designing biotherapeutic proteins and peptides. Many of the techniques discussed here, such as the deterministic and stochastic design methods, are generally used in protein design. We have devoted special attention to the design of antibodies and vaccines. In addition to the methods for designing these molecules, we have included a comprehensive list of all biotherapeutics approved for clinical use. Also included is an overview of methods that predict the binding affinity, cell penetration ability, half-life, solubility, immunogenicity and toxicity of the designed therapeutics. Biotherapeutics are only going to grow in clinical importance and are set to herald a new generation of disease management and cure.

Protein complex analysis: From raw protein lists to protein interaction networks

The elucidation of molecular interaction networks is one of the pivotal challenges in the study of biology. Affinity purification-mass spectrometry and other co-complex methods have become widely employed experimental techniques to identify protein complexes. These techniques typically suffer from a high number of false negatives and false positive contaminants due to technical shortcomings and purification biases. To support a diverse range of experimental designs and approaches, a large number of computational methods have been proposed to filter, infer and validate protein interaction networks from experimental pull-down MS data. Nevertheless, this expansion of available methods complicates the selection of the most optimal ones to support systems biology-driven knowledge extraction. In this review, we give an overview of the most commonly used computational methods to process and interpret co-complex results, and we discuss the issues and unsolved problems that still exist within the field. © 2015 Wiley Periodicals, Inc. Mass Spec Rev 36:600-614, 2017.

Free Energy of Binding and Mechanism of Interaction for the MEEVD-TPR2A Peptide-Protein Complex

The association between the MEEVD C-terminal peptide from the heat shock protein 90 (Hsp90) and tetratricopeptide repeat A (TPR2A) domain of the heat shock organizing protein (Hop) is a useful prototype to study the fundamental molecular details about the Hop-Hsp90 interaction. We study here the mechanism of binding/unbinding and compute the standard binding free energy and potential of mean force for the association of the MEEVD peptide to the TPR2A domain using the Adaptive Biasing Force (ABF) methodology. We observe conformational changes of the peptide and the protein receptor induced by binding. We measure the binding free energy of -8.4 kcal/mol, which is consistent with experimental estimates. The simulations achieve multiple unbinding and rebinding events along a consistent pathway connecting the binding site to solvent. The MEEVD peptide slowly dissociates disrupting the hydrogen bonds first, then tilting on the side while preserving the interaction with the side chain of residue Asp 5 of the peptide. After this initial displacement, the peptide completely dissociates and moves into the solvent. Rebinding of the MEEVD peptide from the solvent to the receptor binding site occurs slowly through the portal of entry. Unbinding and rebinding go through intermediate states characterized by the peptide interacting with a lateral helix, helix A1, of the receptor with mainly Asp 5, Val 4, and Glu 3 of the peptide. This newly discovered intermediate structure is characterized by numerous contacts with the receptor which lead to complete formation of the bound complex. The structure of the bound complex obtained after rebinding is structurally very similar to the crystal structure of the complex (0.48 Å root-mean square deviation). The residues Asp 5, Val 4, and Glu 3 adopt conformations and intermolecular contacts with excellent structural similarity with the native ones. Finally, the dissociation and reassociation of MEEVD induce hydration/dehydration transitions, which provide insights on the role of desolvation and solvation processes in protein-peptide binding.

PTHrP(12-48) Modulates the Bone Marrow Microenvironment and Suppresses Human Osteoclast Differentiation and Lifespan

Bone is a common site for metastasis in breast cancer patients and is associated with a series of complications that significantly compromise patient survival, partially due to the advanced stage of disease at the time of detection. Currently, no clinically-approved biomarkers can identify or predict the development of bone metastasis. We recently identified a unique peptide fragment of parathyroid hormone-related protein (PTHrP), PTHrP(12-48), as a validated serum biomarker in breast cancer patients that correlates with and predicts the presence of bone metastases. In this study, the biological activity and mode of action of PTHrP(12-48) was investigated. Sequence-based and structure-based bioinformatics techniques predicted that the PTHrP(12-48) fragment formed an alpha helical core followed by an unstructured region after residue 40 or 42. Thereafter, detailed structure alignment and molecular docking simulations predicted a lack of interaction between PTHrP(12-48) and the cognate PTH1 receptor (PTHR1). The in silico prediction was confirmed by the lack of PTHrP(12-48)-stimulated cAMP accumulation in PTHR1-expressing human SaOS2 cells. Using a specific human PTHrP(12-48) antibody that we developed, PTHrP(12-48) was immunolocalized in primary and bone metastatic human breast cancer cells, as well as within human osteoclasts (OCLs) in bone metastasis biopsies, with little or no localization in other resident bone or bone marrow cells. In vitro, PTHrP(12-48) was internalized into cultured primary human OCLs and their precursors within 60 min. Interestingly, PTHrP(12-48) treatment dose-dependently suppressed osteoclastogenesis, via the induction of apoptosis in both OCL precursors as well as in mature OCLs, as measured by the activation of cleaved caspase 3. Collectively, these data suggest that PTHrP(12-48) is a bioactive breast cancer-derived peptide that locally regulates the differentiation of hematopoietic cells and the activity of osteoclasts within the tumor-bone marrow microenvironment, perhaps to facilitate tumor control of bone. © 2017 American Society for Bone and Mineral Research.

Addressing recent docking challenges: A hybrid strategy to integrate template-based and free protein-protein docking

Protein-protein docking is an important computational tool for predicting protein-protein interactions. With the rapid development of proteomics projects, more and more experimental binding information ranging from mutagenesis data to three-dimensional structures of protein complexes are becoming available. Therefore, how to appropriately incorporate the biological information into traditional ab initio docking has been an important issue and challenge in the field of protein-protein docking. To address these challenges, we have developed a Hybrid DOCKing protocol of template-based and template-free approaches, referred to as HDOCK. The basic procedure of HDOCK is to model the structures of individual components based on the template complex by a template-based method if a template is available; otherwise, the component structures will be modeled based on monomer proteins by regular homology modeling. Then, the complex structure of the component models is predicted by traditional protein-protein docking. With the HDOCK protocol, we have participated in the CPARI experiment for rounds 28-35. Out of the 25 CASP-CAPRI targets for oligomer modeling, our HDOCK protocol predicted correct models for 16 targets, ranking one of the top algorithms in this challenge. Our docking method also made correct predictions on other CAPRI challenges such as protein-peptide binding for 6 out of 8 targets and water predictions for 2 out of 2 targets. The advantage of our hybrid docking approach over pure template-based docking was further confirmed by a comparative evaluation on 20 CASP-CAPRI targets. Proteins 2017; 85:497-512. © 2016 Wiley Periodicals, Inc.

Protein-Protein Docking

Protein-protein docking algorithms are powerful computational tools, capable of analyzing the protein-protein interactions at the atomic-level. In this chapter, we will review the theoretical concepts behind different protein-protein docking algorithms, highlighting their strengths as well as their limitations and pointing to important case studies for each method. The methods we intend to cover in this chapter include various search strategies and scoring techniques. This includes exhaustive global search, fast Fourier transform search, spherical Fourier transform-based search, direct search in Cartesian space, local shape feature matching, geometric hashing, genetic algorithm, randomized search, and Monte Carlo search. We will also discuss the different ways that have been used to incorporate protein flexibility within the docking procedure and some other future directions in this field, suggesting possible ways to improve the different methods.

Molecular Docking at a Glance

The current chapter introduces different aspects of molecular docking technique in order to give an overview to the readers about the topics which will be dealt with throughout this volume. Like many other fields of science, molecular docking studies has experienced a lagging period of slow and steady increase in terms of acquiring attention of scientific community as well as its frequency of application, followed by a pronounced era of exponential expansion in theory, methodology, areas of application and performance due to developments in related technologies such as computational resources and theoretical as well as experimental biophysical methods. In the following sections the evolution of molecular docking will be reviewed and its different components including methods, search algorithms, scoring functions, validation of the methods, and area of applications plus few case studies will be touched briefly.