Sampling and scoring: a marriage made in heaven

EquiRank: Improved protein-protein interface quality estimation using protein language-model-informed equivariant graph neural networks

Quality estimation of the predicted interaction interface of protein complex structural models is not only important for complex model evaluation and selection but also useful for protein-protein docking. Despite recent progress fueled by symmetry-aware deep learning architectures and pretrained protein language models (pLMs), existing methods for estimating protein complex quality have yet to fully exploit the collective potentials of these advances for accurate estimation of protein-protein interface. Here we present EquiRank, an improved protein-protein interface quality estimation method by leveraging the strength of a symmetry-aware E(3) equivariant deep graph neural network (EGNN) and integrating pLM embeddings from the pretrained ESM-2 model. Our method estimates the quality of the protein-protein interface through an effective graph-based representation of interacting residue pairs, incorporating a diverse set of features, including ESM-2 embeddings, and then by learning the representation using symmetry-aware EGNNs. Our experimental results demonstrate improved ranking performance on diverse datasets over existing latest protein complex quality estimation methods including the top-performing CASP15 protein complex quality estimation method VoroIF_GNN and the self-assessment module of AlphaFold-Multimer repurposed for protein complex scoring and across different performance evaluation metrics. Additionally, our ablation studies demonstrate the contributions of both pLMs and the equivariant nature of EGNN for improved protein-protein interface quality estimation performance. EquiRank is freely available at https://github.com/mhshuvo1/EquiRank.

Evaluation of DNA-protein complex structures using the deep learning method

Biological processes such as transcription, repair, and regulation require interactions between DNA and proteins. To unravel their functions, it is imperative to determine the high-resolution structures of DNA-protein complexes. However, experimental methods for this purpose are costly and technically demanding. Consequently, there is an urgent need for computational techniques to identify the structures of DNA-protein complexes. Despite technological advancements, accurately identifying DNA-protein complexes through computational methods still poses a challenge. Our team has developed a cutting-edge deep-learning approach called DDPScore that assesses DNA-protein complex structures. DDPScore utilizes a 4D convolutional neural network to overcome limited training data. This approach effectively captures local and global features while comprehensively considering the conformational changes arising from the flexibility during the DNA-protein docking process. DDPScore consistently outperformed the available methods in comprehensive DNA-protein complex docking evaluations, even for the flexible docking challenges. DDPScore has a wide range of applications in predicting and designing structures of DNA-protein complexes.

PIQLE: protein-protein interface quality estimation by deep graph learning of multimeric interaction geometries

Motivation

Accurate modeling of protein-protein interaction interface is essential for high-quality protein complex structure prediction. Existing approaches for estimating the quality of a predicted protein complex structural model utilize only the physicochemical properties or energetic contributions of the interacting atoms, ignoring evolutionarily information or inter-atomic multimeric geometries, including interaction distance and orientations.

Results

Here, we present PIQLE, a deep graph learning method for protein-protein interface quality estimation. PIQLE leverages multimeric interaction geometries and evolutionarily information along with sequence- and structure-derived features to estimate the quality of individual interactions between the interfacial residues using a multi-head graph attention network and then probabilistically combines the estimated quality for scoring the overall interface. Experimental results show that PIQLE consistently outperforms existing state-of-the-art methods including DProQA, TRScore, GNN-DOVE and DOVE on multiple independent test datasets across a wide range of evaluation metrics. Our ablation study and comparison with the self-assessment module of AlphaFold-Multimer repurposed for protein complex scoring reveal that the performance gains are connected to the effectiveness of the multi-head graph attention network in leveraging multimeric interaction geometries and evolutionary information along with other sequence- and structure-derived features adopted in PIQLE.

Availability and implementation

An open-source software implementation of PIQLE is freely available at https://github.com/Bhattacharya-Lab/PIQLE.

Supplementary information

Supplementary data are available at Bioinformatics Advances online.

PIQLE: protein-protein interface quality estimation by deep graph learning of multimeric interaction geometries

Accurate modeling of protein-protein interaction interface is essential for high-quality protein complex structure prediction. Existing approaches for estimating the quality of a predicted protein complex structural model utilize only the physicochemical properties or energetic contributions of the interacting atoms, ignoring evolutionarily information or inter-atomic multimeric geometries, including interaction distance and orientations. Here we present PIQLE, a deep graph learning method for protein-protein interface quality estimation. PIQLE leverages multimeric interaction geometries and evolutionarily information along with sequence- and structure-derived features to estimate the quality of the individual interactions between the interfacial residues using a multihead graph attention network and then probabilistically combines the estimated quality of the interfacial residues for scoring the overall interface. Experimental results show that PIQLE consistently outperforms existing state-of-the-art methods on multiple independent test datasets across a wide range of evaluation metrics. Our ablation study reveals that the performance gains are connected to the effectiveness of the multihead graph attention network in leveraging multimeric interaction geometries and evolutionary information along with other sequence- and structure-derived features adopted in PIQLE. An open-source software implementation of PIQLE, licensed under the GNU General Public License v3, is freely available at https://github.com/Bhattacharya-Lab/PIQLE .

In silico formulation of a next-generation multiepitope vaccine for use as a prophylactic candidate against Crimean-Congo hemorrhagic fever

BACKGROUND

Crimean-Congo hemorrhagic fever (CCHF) is a widespread disease transmitted to humans and livestock animals through the bite of infected ticks or close contact with infected persons' blood, organs, or other bodily fluids. The virus is responsible for severe viral hemorrhagic fever outbreaks, with a case fatality rate of up to 40%. Despite having the highest fatality rate of the virus, a suitable treatment option or vaccination has not been developed yet. Therefore, this study aimed to formulate a multiepitope vaccine against CCHF through computational vaccine design approaches.

METHODS

The glycoprotein, nucleoprotein, and RNA-dependent RNA polymerase of CCHF were utilized to determine immunodominant T- and B-cell epitopes. Subsequently, an integrative computational vaccinology approach was used to formulate a multi-epitopes vaccine candidate against the virus.

RESULTS

After rigorous assessment, a multiepitope vaccine was constructed, which was antigenic, immunogenic, and non-allergenic with desired physicochemical properties. Molecular dynamics (MD) simulations of the vaccine-receptor complex show strong stability of the vaccine candidates to the targeted immune receptor. Additionally, the immune simulation of the vaccine candidates found that the vaccine could trigger real-life-like immune responses upon administration to humans.

CONCLUSIONS

Finally, we concluded that the formulated multiepitope vaccine candidates would provide excellent prophylactic properties against CCHF.

Baseline Comparisons of Complementary Sampling Methods for Assembly Driven by Short-Ranged Pair Potentials toward Fast and Flexible Hybridization

This work measures baseline sampling characteristics that highlight fundamental differences between sampling methods for assembly driven by short-ranged pair potentials. Such granular comparison is essential for fast, flexible, and accurate hybridization of complementary methods. Besides sampling speed, efficiency, and accuracy of uniform grid coverage, other sampling characteristics measured are (i) accuracy of covering narrow low energy regions that have low effective dimension (ii) ability to localize sampling to specific basins, and (iii) flexibility in sampling distributions. As a proof of concept, we compare a recently developed geometric methodology EASAL (Efficient Atlasing and Search of Assembly Landscapes) and the traditional Monte Carlo (MC) method for sampling the energy landscape of two assembling trans-membrane helices, driven by short-range pair potentials. By measuring the above-mentioned sampling characteristics, we demonstrate that EASAL provides localized and accurate coverage of crucial regions of the energy landscape of low effective dimension, under flexible sampling distributions, with much fewer samples and computational resources than MC sampling. EASAL's empirically validated theoretical guarantees permit credible extrapolation of these measurements and comparisons to arbitrary number and size of assembling units. Promising avenues for hybridizing the complementary advantages of the two methods are discussed.

Refinement of pairwise potentials via logistic regression to score protein-protein interactions

Protein-protein interactions (PPIs) are ubiquitous and functionally of great importance in biological systems. Hence, the accurate prediction of PPIs by protein-protein docking and scoring tools is highly desirable in order to characterize their structure and biological function. Ab initio docking protocols are divided into the sampling of docking poses to produce at least one near-native structure, and then to evaluate the vast candidate structures by scoring. Concurrent development in both sampling and scoring is crucial for the deployment of protein-protein docking software. In the present work, we apply a machine learning model on pairwise potentials to refine the task of protein quaternary structure native structure detection among decoys. A decoy set was featurized using the Knowledge and Empirical Combined Scoring Algorithm 2 (KECSA2) pairwise potential. The highly unbalanced decoy set was then balanced using a comparison concept between native and decoy structures. The resultant comparison descriptors were used to train a logistic regression (LR) classifier. The LR model yielded the optimal performance for native detection among decoys compared with conventional scoring functions, while exhibiting lesser performance for the detection of low root mean square deviation decoy structures. Its deployment on an independent benchmark set confirms that the scoring function performs competitively relative to other scoring functions. The scripts used are available at https://github.com/TanemuraKiyoto/PPI-native-detection-via-LR.

Application of docking methodologies to modeled proteins

Protein docking is essential for structural characterization of protein interactions. Besides providing the structure of protein complexes, modeling of proteins and their complexes is important for understanding the fundamental principles and specific aspects of protein interactions. The accuracy of protein modeling, in general, is still less than that of the experimental approaches. Thus, it is important to investigate the applicability of docking techniques to modeled proteins. We present new comprehensive benchmark sets of protein models for the development and validation of protein docking, as well as a systematic assessment of free and template-based docking techniques on these sets. As opposed to previous studies, the benchmark sets reflect the real case modeling/docking scenario where the accuracy of the models is assessed by the modeling procedure, without reference to the native structure (which would be unknown in practical applications). We also expanded the analysis to include docking of protein pairs where proteins have different structural accuracy. The results show that, in general, the template-based docking is less sensitive to the structural inaccuracies of the models than the free docking. The near-native docking poses generated by the template-based approach, typically, also have higher ranks than those produces by the free docking (although the free docking is indispensable in modeling the multiplicity of protein interactions in a crowded cellular environment). The results show that docking techniques are applicable to protein models in a broad range of modeling accuracy. The study provides clear guidelines for practical applications of docking to protein models.

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.

A Guide for Protein-Protein Docking Using SwarmDock

Many of the biological functions of the cell are driven by protein-protein interactions. However, determining which proteins interact and exactly how they do so to enable their functions, remain major research questions. Functional interactions are dependent on a number of complicated factors; therefore, modeling the three-dimensional structure of protein-protein complexes is still considered a complex endeavor. Nevertheless, the rewards for modeling protein interactions to atomic level detail are substantial, and there are numerous examples of how models can provide useful information for drug design, protein engineering, systems biology, and understanding of the immune system. Here, we provide practical guidelines for docking proteins using the web-server, SwarmDock, a flexible protein-protein docking method. Moreover, we provide an overview of the factors that need to be considered when deciding whether docking is likely to be successful.

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

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

What method to use for protein-protein docking?

A number of well-established servers perform 'free' docking of proteins of known structures. In contrast, template-based docking can start from sequences if structures are available for complexes that are homologous to the target. On the basis of the results of the CAPRI-CASP structure prediction experiments, template-based methods yield more accurate predictions if good templates can be found, but generally fail without such templates. However, free global docking, or focused docking around even poor quality template-based models, can still generate acceptable docked structures in these cases. In accordance with the analysis of a benchmark set, free docking of heterodimers yields acceptable or better predictions in the top 10 models for around 40% of structures. However, it is likely that a combination of template-based and free docking methods can perform better for targets that have template structures available. Another way of improving the reliability of predictions is adding experimental information as restraints, an option built into several docking servers.

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.

Modeling large protein-glycosaminoglycan complexes using a fragment-based approach

Glycosaminoglycans (GAGs), a major constituent of the extracellular matrix, participate in cell-signaling by binding specific proteins. Structural data on protein-GAG interactions are crucial to understand and modulate these signaling processes, with potential applications in regenerative medicine. However, experimental and theoretical approaches used to study GAG-protein systems are challenged by GAGs high flexibility limiting the conformational sampling above a certain size, and by the scarcity of GAG-specific docking tools compared to protein-protein or protein-drug docking approaches. We present for the first time an automated fragment-based method for docking GAGs on a protein binding site. In this approach, trimeric GAG fragments are flexibly docked to the protein, assembled based on their spacial overlap, and refined by molecular dynamics. The method appeared more successful than the classical full-ligand approach for most of 13 tested complexes with known structure. The approach is particularly promising for docking of long GAG chains, which represents a bottleneck for classical docking approaches applied to these systems. © 2019 Wiley Periodicals, Inc.

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.

Bioinformatics Tools and Benchmarks for Computational Docking and 3D Structure Prediction of RNA-Protein Complexes

RNA-protein (RNP) interactions play essential roles in many biological processes, such as regulation of co-transcriptional and post-transcriptional gene expression, RNA splicing, transport, storage and stabilization, as well as protein synthesis. An increasing number of RNP structures would aid in a better understanding of these processes. However, due to the technical difficulties associated with experimental determination of macromolecular structures by high-resolution methods, studies on RNP recognition and complex formation present significant challenges. As an alternative, computational prediction of RNP interactions can be carried out. Structural models obtained by theoretical predictive methods are, in general, less reliable compared to models based on experimental measurements but they can be sufficiently accurate to be used as a basis for to formulating functional hypotheses. In this article, we present an overview of computational methods for 3D structure prediction of RNP complexes. We discuss currently available methods for macromolecular docking and for scoring 3D structural models of RNP complexes in particular. Additionally, we also review benchmarks that have been developed to assess the accuracy of these methods.

Properties that rank protein:protein docking poses with high accuracy

The development of docking algorithms to predict near-native structures of protein:protein complexes from the structure of the isolated monomers is of paramount importance for molecular biology and drug discovery.

Antibody Affinity Maturation by Computational Design

The immune systems protect our bodies from foreign molecules or antigens, where antibodies play important roles. Antibodies evolve over time upon antigen encounter by somatically mutating their genome sequences. The end result is a series of antibodies that display higher affinities and specificities to specific antigens. This process is called affinity maturation. Recent improvements in computer hardware and modeling algorithms now enable the rational design of protein structures and functions, and several works on computer-aided antibody design have been published. In this chapter, we briefly describe computational methods for antibody affinity maturation, focusing on methods for sampling antibody conformations and for scoring designed antibody variants. We also discuss lessons learned from the successful computer-aided design of antibodies.

Flexible Protein-Protein Docking with SwarmDock

The atomic structures of protein complexes can provide useful information for drug design, protein engineering, systems biology, and understanding pathology. Obtaining this information experimentally can be challenging. However, if the structures of the subunits are known, then it is often possible to model the complex computationally. This chapter provide practical guidelines for docking proteins using the SwarmDock flexible protein-protein docking method, providing an overview of the factors that need to be considered when deciding whether docking is likely to be successful, the preparation of structural input, generation of docked poses, analysis and ranking of docked poses, and the validation of models using external data.

Approaching Pharmacological Space: Events and Components

With a view to introducing the concept of pharmacological space and its potential applications in investigating and predicting the toxic mechanisms of xenobiotics, this opening chapter describes the logical relations between conformational behavior, physicochemical properties and binding spaces, which are seen as the three key elements composing the pharmacological space. While the concept of conformational space is routinely used to encode molecular flexibility, the concepts of property spaces and, particularly, of binding spaces are more innovative. Indeed, their descriptors can find fruitful applications (a) in describing the dynamic adaptability a given ligand experiences when inserted into a specific environment, and (b) in parameterizing the flexibility a ligand retains when bound to a biological target. Overall, these descriptors can conveniently account for the often disregarded entropic factors and as such they prove successful when inserted in ligand- or structure-based predictive models. Notably, and although binding space parameters can clearly be derived from MD simulations, the chapter will illustrate how docking calculations, despite their static nature, are able to evaluate ligand's flexibility by analyzing several poses for each ligand. Such an approach, which represents the founding core of the binding space concept, can find various applications in which the related descriptors show an impressive enhancing effect on the statistical performances of the resulting predictive models.

A machine learning approach for ranking clusters of docked protein-protein complexes by pairwise cluster comparison

Reliable identification of near-native poses of docked protein-protein complexes is still an unsolved problem. The intrinsic heterogeneity of protein-protein interactions is challenging for traditional biophysical or knowledge based potentials and the identification of many false positive binding sites is not unusual. Often, ranking protocols are based on initial clustering of docked poses followed by the application of an energy function to rank each cluster according to its lowest energy member. Here, we present an approach of cluster ranking based not only on one molecular descriptor (e.g., an energy function) but also employing a large number of descriptors that are integrated in a machine learning model, whereby, an extremely randomized tree classifier based on 109 molecular descriptors is trained. The protocol is based on first locally enriching clusters with additional poses, the clusters are then characterized using features describing the distribution of molecular descriptors within the cluster, which are combined into a pairwise cluster comparison model to discriminate near-native from incorrect clusters. The results show that our approach is able to identify clusters containing near-native protein-protein complexes. In addition, we present an analysis of the descriptors with respect to their power to discriminate near native from incorrect clusters and how data transformations and recursive feature elimination can improve the ranking performance. Proteins 2017; 85:528-543. © 2016 Wiley Periodicals, Inc.

Molecular Simulations of Disulfide-Rich Venom Peptides with Ion Channels and Membranes

Disulfide-rich peptides isolated from the venom of arthropods and marine animals are a rich source of potent and selective modulators of ion channels. This makes these peptides valuable lead molecules for the development of new drugs to treat neurological disorders. Consequently, much effort goes into understanding their mechanism of action. This paper presents an overview of how molecular simulations have been used to study the interactions of disulfide-rich venom peptides with ion channels and membranes. The review is focused on the use of docking, molecular dynamics simulations, and free energy calculations to (i) predict the structure of peptide-channel complexes; (ii) calculate binding free energies including the effect of peptide modifications; and (iii) study the membrane-binding properties of disulfide-rich venom peptides. The review concludes with a summary and outlook.

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.

Rapid Design of Knowledge-Based Scoring Potentials for Enrichment of Near-Native Geometries in Protein-Protein Docking

Protein-protein docking protocols aim to predict the structures of protein-protein complexes based on the structure of individual partners. Docking protocols usually include several steps of sampling, clustering, refinement and re-scoring. The scoring step is one of the bottlenecks in the performance of many state-of-the-art protocols. The performance of scoring functions depends on the quality of the generated structures and its coupling to the sampling algorithm. A tool kit, GRADSCOPT (GRid Accelerated Directly SCoring OPTimizing), was designed to allow rapid development and optimization of different knowledge-based scoring potentials for specific objectives in protein-protein docking. Different atomistic and coarse-grained potentials can be created by a grid-accelerated directly scoring dependent Monte-Carlo annealing or by a linear regression optimization. We demonstrate that the scoring functions generated by our approach are similar to or even outperform state-of-the-art scoring functions for predicting near-native solutions. Of additional importance, we find that potentials specifically trained to identify the native bound complex perform rather poorly on identifying acceptable or medium quality (near-native) solutions. In contrast, atomistic long-range contact potentials can increase the average fraction of near-native poses by up to a factor 2.5 in the best scored 1% decoys (compared to existing scoring), emphasizing the need of specific docking potentials for different steps in the docking protocol.

New additions to the ClusPro server motivated by CAPRI

The heavily used protein-protein docking server ClusPro performs three computational steps as follows: (1) rigid body docking, (2) RMSD based clustering of the 1000 lowest energy structures, and (3) the removal of steric clashes by energy minimization. In response to challenges encountered in recent CAPRI targets, we added three new options to ClusPro. These are (1) accounting for small angle X-ray scattering data in docking; (2) considering pairwise interaction data as restraints; and (3) enabling discrimination between biological and crystallographic dimers. In addition, we have developed an extremely fast docking algorithm based on 5D rotational manifold FFT, and an algorithm for docking flexible peptides that include known sequence motifs. We feel that these developments will further improve the utility of ClusPro. However, CAPRI emphasized several shortcomings of the current server, including the problem of selecting the right energy parameters among the five options provided, and the problem of selecting the best models among the 10 generated for each parameter set. In addition, results convinced us that further development is needed for docking homology models. Finally, we discuss the difficulties we have encountered when attempting to develop a refinement algorithm that would be computationally efficient enough for inclusion in a heavily used server. Proteins 2017; 85:435-444. © 2016 Wiley Periodicals, Inc.

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.

Challenges in structural approaches to cell modeling

Computational modeling is essential for structural characterization of biomolecular mechanisms across the broad spectrum of scales. Adequate understanding of biomolecular mechanisms inherently involves our ability to model them. Structural modeling of individual biomolecules and their interactions has been rapidly progressing. However, in terms of the broader picture, the focus is shifting toward larger systems, up to the level of a cell. Such modeling involves a more dynamic and realistic representation of the interactomes in vivo, in a crowded cellular environment, as well as membranes and membrane proteins, and other cellular components. Structural modeling of a cell complements computational approaches to cellular mechanisms based on differential equations, graph models, and other techniques to model biological networks, imaging data, etc. Structural modeling along with other computational and experimental approaches will provide a fundamental understanding of life at the molecular level and lead to important applications to biology and medicine. A cross section of diverse approaches presented in this review illustrates the developing shift from the structural modeling of individual molecules to that of cell biology. Studies in several related areas are covered: biological networks; automated construction of three-dimensional cell models using experimental data; modeling of protein complexes; prediction of non-specific and transient protein interactions; thermodynamic and kinetic effects of crowding; cellular membrane modeling; and modeling of chromosomes. The review presents an expert opinion on the current state-of-the-art in these various aspects of structural modeling in cellular biology, and the prospects of future developments in this emerging field.

Focused grid-based resampling for protein docking and mapping

The fast Fourier transform (FFT) sampling algorithm has been used with success in application to protein-protein docking and for protein mapping, the latter docking a variety of small organic molecules for the identification of binding hot spots on the target protein. Here we explore the local rather than global usage of the FFT sampling approach in docking applications. If the global FFT based search yields a near-native cluster of docked structures for a protein complex, then focused resampling of the cluster generally leads to a substantial increase in the number of conformations close to the native structure. In protein mapping, focused resampling of the selected hot spot regions generally reveals further hot spots that, while not as strong as the primary hot spots, also contribute to ligand binding. The detection of additional ligand binding regions is shown by the improved overlap between hot spots and bound ligands.

Rigid-Docking Approaches to Explore Protein-Protein Interaction Space

Protein-protein interactions play core roles in living cells, especially in the regulatory systems. As information on proteins has rapidly accumulated on publicly available databases, much effort has been made to obtain a better picture of protein-protein interaction networks using protein tertiary structure data. Predicting relevant interacting partners from their tertiary structure is a challenging task and computer science methods have the potential to assist with this. Protein-protein rigid docking has been utilized by several projects, docking-based approaches having the advantages that they can suggest binding poses of predicted binding partners which would help in understanding the interaction mechanisms and that comparing docking results of both non-binders and binders can lead to understanding the specificity of protein-protein interactions from structural viewpoints. In this review we focus on explaining current computational prediction methods to predict pairwise direct protein-protein interactions that form protein complexes.

Computational modeling of RNA 3D structures and interactions

RNA molecules have key functions in cellular processes beyond being carriers of protein-coding information. These functions are often dependent on the ability to form complex three-dimensional (3D) structures. However, experimental determination of RNA 3D structures is difficult, which has prompted the development of computational methods for structure prediction from sequence. Recent progress in 3D structure modeling of RNA and emerging approaches for predicting RNA interactions with ions, ligands and proteins have been stimulated by successes in protein 3D structure modeling.

3DRobot: automated generation of diverse and well-packed protein structure decoys

MOTIVATION

Computationally generated non-native protein structure conformations (or decoys) are often used for designing protein folding simulation methods and force fields. However, almost all the decoy sets currently used in literature suffer from uneven root mean square deviation (RMSD) distribution with bias to non-protein like hydrogen-bonding and compactness patterns. Meanwhile, most protein decoy sets are pre-calculated and there is a lack of methods for automated generation of high-quality decoys for any target proteins.

RESULTS

We developed a new algorithm, 3DRobot, to create protein structure decoys by free fragment assembly with enhanced hydrogen-bonding and compactness interactions. The method was benchmarked with three widely used decoy sets from ab initio folding and comparative modeling simulations. The decoys generated by 3DRobot are shown to have significantly enhanced diversity and evenness with a continuous distribution in the RMSD space. The new energy terms introduced in 3DRobot improve the hydrogen-bonding network and compactness of decoys, which eliminates the possibility of native structure recognition by trivial potentials. Algorithms that can automatically create such diverse and well-packed non-native conformations from any protein structure should have a broad impact on the development of advanced protein force field and folding simulation methods. AVAILIABLITY AND IMPLEMENTATION: http://zhanglab.ccmb.med.umich.edu/3DRobot/

CONTACT

jiay@phy.ccnu.edu.cn; zhng@umich.edu

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Simulated unbound structures for benchmarking of protein docking in the DOCKGROUND resource

Background

Proteins play an important role in biological processes in living organisms. Many protein functions are based on interaction with other proteins. The structural information is important for adequate description of these interactions. Sets of protein structures determined in both bound and unbound states are essential for benchmarking of the docking procedures. However, the number of such proteins in PDB is relatively small. A radical expansion of such sets is possible if the unbound structures are computationally simulated.

Results

The Dockground public resource provides data to improve our understanding of protein–protein interactions and to assist in the development of better tools for structural modeling of protein complexes, such as docking algorithms and scoring functions. A large set of simulated unbound protein structures was generated from the bound structures. The modeling protocol was based on 1 ns Langevin dynamics simulation. The simulated structures were validated on the ensemble of experimentally determined unbound and bound structures. The set is intended for large scale benchmarking of docking algorithms and scoring functions.

Conclusions

A radical expansion of the unbound protein docking benchmark set was achieved by simulating the unbound structures. The simulated unbound structures were selected according to criteria from systematic comparison of experimentally determined bound and unbound structures. The set is publicly available at http://dockground.compbio.ku.edu.

Protein-protein docking: from interaction to interactome

The protein-protein docking problem is one of the focal points of activity in computational biophysics and structural biology. The three-dimensional structure of a protein-protein complex, generally, is more difficult to determine experimentally than the structure of an individual protein. Adequate computational techniques to model protein interactions are important because of the growing number of known protein structures, particularly in the context of structural genomics. Docking offers tools for fundamental studies of protein interactions and provides a structural basis for drug design. Protein-protein docking is the prediction of the structure of the complex, given the structures of the individual proteins. In the heart of the docking methodology is the notion of steric and physicochemical complementarity at the protein-protein interface. Originally, mostly high-resolution, experimentally determined (primarily by x-ray crystallography) protein structures were considered for docking. However, more recently, the focus has been shifting toward lower-resolution modeled structures. Docking approaches have to deal with the conformational changes between unbound and bound structures, as well as the inaccuracies of the interacting modeled structures, often in a high-throughput mode needed for modeling of large networks of protein interactions. The growing number of docking developers is engaged in the community-wide assessments of predictive methodologies. The development of more powerful and adequate docking approaches is facilitated by rapidly expanding information and data resources, growing computational capabilities, and a deeper understanding of the fundamental principles of protein interactions.

DisVis: quantifying and visualizing accessible interaction space of distance-restrained biomolecular complexes

Summary: We present DisVis, a Python package and command line tool to calculate the reduced accessible interaction space of distance-restrained binary protein complexes, allowing for direct visualization and quantification of the information content of the distance restraints. The approach is general and can also be used as a knowledge-based distance energy term in FFT-based docking directly during the sampling stage.

Availability and implementation: The source code with documentation is freely available from https://github.com/haddocking/disvis.

Contact:a.m.j.j.bonvin@uu.nl

Supplementary information:Supplementary data are available at Bioinformatics online.

Improvements, trends, and new ideas in molecular docking: 2012-2013 in review

Molecular docking is a computational method for predicting the placement of ligands in the binding sites of their receptor(s). In this review, we discuss the methodological developments that occurred in the docking field in 2012 and 2013, with a particular focus on the more difficult aspects of this computational discipline. The main challenges and therefore focal points for developments in docking, covered in this review, are receptor flexibility, solvation, scoring, and virtual screening. We specifically deal with such aspects of molecular docking and its applications as selection criteria for constructing receptor ensembles, target dependence of scoring functions, integration of higher-level theory into scoring, implicit and explicit handling of solvation in the binding process, and comparison and evaluation of docking and scoring methods.

Challenges, applications, and recent advances of protein-ligand docking in structure-based drug design

The docking methods used in structure-based virtual database screening offer the ability to quickly and cheaply estimate the affinity and binding mode of a ligand for the protein receptor of interest, such as a drug target. These methods can be used to enrich a database of compounds, so that more compounds that are subsequently experimentally tested are found to be pharmaceutically interesting. In addition, like all virtual screening methods used for drug design, structure-based virtual screening can focus on curated libraries of synthesizable compounds, helping to reduce the expense of subsequent experimental verification. In this review, we introduce the protein-ligand docking methods used for structure-based drug design and other biological applications. We discuss the fundamental challenges facing these methods and some of the current methodological topics of interest. We also discuss the main approaches for applying protein-ligand docking methods. We end with a discussion of the challenging aspects of evaluating or benchmarking the accuracy of docking methods for their improvement, and discuss future directions.

Insights into the architecture of the eIF2Bα/β/δ regulatory subcomplex

Eukaryotic translation initiation factor 2B (eIF2B), the guanine nucleotide exchange factor for the G-protein eIF2, is one of the main targets for the regulation of protein synthesis. The eIF2B activity is inhibited in response to a wide range of stress factors and diseases, including viral infections, hypoxia, nutrient starvation, and heme deficiency, collectively known as the integrated stress response. eIF2B has five subunits (α-ε). The α, β, and δ subunits are homologous to each other and form the eIF2B regulatory subcomplex, which is believed to be a trimer consisting of monomeric α, β, and δ subunits. Here we use a combination of biophysical methods, site-directed mutagenesis, and bioinformatics to show that the human eIF2Bα subunit is in fact a homodimer, at odds with the current trimeric model for the eIF2Bα/β/δ regulatory complex. eIF2Bα dimerizes using the same interface that is found in the homodimeric archaeal eIF2Bα/β/δ homolog aIF2B and related metabolic enzymes. We also present evidence that the eIF2Bβ/δ binding interface is similar to that in the eIF2Bα2 homodimer. Mutations at the predicted eIF2Bβ/δ dimer interface cause genetic neurological disorders in humans. We propose that the eIF2B regulatory subcomplex is an α2β2δ2 hexamer, composed of one α2 homodimer and two βδ heterodimers. Our results offer novel insights into the architecture of eIF2B and its interactions with the G-protein eIF2.