Molecular mechanics Poisson−Boltzmann surface area (MM/PBSA) and molecular mechanics generalized Born surface area (MM/GBSA) are arguably very popular methods for binding free energy prediction since they are more accurate than most scoring functions of molecular docking and less computationally demanding than alchemical free energy methods. MM/PBSA and MM/GBSA have been widely used in biomolecular studies such as protein folding, protein−ligand binding, protein−protein interaction, etc. In this review, methods to adjust the polar solvation energy and to improve the performance of MM/PBSA and MM/GBSA calculations are reviewed and discussed. The latest applications of MM/GBSA and MM/PBSA in drug design are also presented. This review intends to provide readers with guidance for practically applying MM/PBSA and MM/GBSA in drug design and related research fields. CONTENTS 1. Introduction 9478 2. Methodology 9480 3. Assessing the Performance of MM/PBSA and MM/GBSA 9484 4. The Polar Solvation Energy and Entropy Terms in MM/PB(GB)SA Calculations 9485 4.1. The Polar Solvation Energy Term in MM/ PBSA 9485 4.2. The Polar Energy Solvation Term in MM/ GBSA 9486 4.3. Theory, Implementation, and Limitations of the Variable Dielectric Model in MM/GBSA 9487 4.4. Comparison between PB and GB 9488 4.5. Efficient Entropy Calculation Methods To Estimate the Entropy Change upon Ligand Binding 9488 5.

Protein–protein interactions (PPIs) play an important role in the different functions of cells, but accurate prediction of the three-dimensional structures for PPIs is still a notoriously difficult task. In this study, HawkDock, a free and open accessed web server, was developed to predict and analyze the structures of PPIs. In the HawkDock server, the ATTRACT docking algorithm, the HawkRank scoring function developed in our group and the MM/GBSA free energy decomposition analysis were seamlessly integrated into a multi-functional platform. The structures of PPIs were predicted by combining the ATTRACT docking and the HawkRank re-scoring, and the key residues for PPIs were highlighted by the MM/GBSA free energy decomposition. The molecular visualization was supported by 3Dmol.js. For the structural modeling of PPIs, HawkDock could achieve a better performance than ZDOCK 3.0.2 in the benchmark testing. For the prediction of key residues, the important residues that play an essential role in PPIs could be identified in the top 10 residues for ∼81.4% predicted models and ∼95.4% crystal structures in the benchmark dataset. To sum up, the HawkDock server is a powerful tool to predict the binding structures and identify the key residues of PPIs. The HawkDock server is accessible free of charge at http://cadd.zju.edu.cn/hawkdock/.

Accurate quantification of protein–ligand interactions remains a key challenge to structure-based drug design. However, traditional machine learning (ML)-based methods based on handcrafted descriptors, one-dimensional protein sequences, and/or two-dimensional graph representations limit their capability to learn the generalized molecular interactions in 3D space. Here, we proposed a novel deep graph representation learning framework named InteractionGraphNet (IGN) to learn the protein–ligand interactions from the 3D structures of protein–ligand complexes. In IGN, two independent graph convolution modules were stacked to sequentially learn the intramolecular and intermolecular interactions, and the learned intermolecular interactions can be efficiently used for subsequent tasks. Extensive binding affinity prediction, large-scale structure-based virtual screening, and pose prediction experiments demonstrated that IGN achieved better or competitive performance against other state-of-the-art ML-based baselines and docking programs. More importantly, such state-of-the-art performance was proven from the successful learning of the key features in protein–ligand interactions instead of just memorizing certain biased patterns from data.

Enhanced sampling has been extensively used to capture the conformational transitions in protein folding, but it attracts much less attention in the studies of protein–protein recognition.

A large number of protein−protein interactions (PPIs) are mediated by the interactions between proteins and peptide segments binding partners, and therefore determination of protein−peptide interactions (PpIs) is quite crucial to elucidate important biological processes and design peptides or peptidomimetic drugs that can modulate PPIs. Nowadays, as a powerful computation tool, molecular docking has been widely utilized to predict the binding structures of protein−peptide complexes. However, although a number of docking programs have been available, the systematic study on the assessment of their performance for PpIs has never been reported. In this study, a benchmark data set called PepSet consisting of 185 protein− peptide complexes with peptide length ranging from 5 to 20 residues was employed to evaluate the performance of 14 docking programs, including three protein−protein docking programs (ZDOCK, FRODOCK, and HawkDock), three small molecule docking programs (GOLD, Surflex-Dock, and AutoDock Vina), and eight protein−peptide docking programs (GalaxyPepDock, MDockPeP, HPEPDOCK, CABS-dock, pepATTRACT, DINC, AutoDock CrankPep (ADCP), and HADDOCK peptide docking). A new evaluation parameter, named IL_RMSD, was proposed to measure the docking accuracy with f nat (the fraction of native contacts). In global docking, HPEPDOCK performs the best for the entire data set and yields the success rates of 4.3%, 24.3%, and 55.7% at the top 1, 10, and 100 levels, respectively. In local docking, overall, ADCP achieves the best predictions and reaches the success rates of 11.9%, 37.3%, and 70.3% at the top 1, 10, and 100 levels, respectively. It is expected that our work can provide some helpful insights into the selection and development of improved docking programs for PpIs. The benchmark data set is freely available at http://cadd.zju.edu.cn/pepset/.

Determination of protein–peptide interactions is critical to gain an in-depth understanding of the protein–protein interaction network. Computational approaches, especially MM/PBSA and MM/GBSA, are powerful tools to predict the binding affinities and identify the correct binding poses for protein–peptide systems.

In structure-based drug design (SBDD), the molecular mechanics generalized Born surface area (MM/GBSA) approach has been widely used in ranking the binding affinity of small molecule ligands. However, an accurate estimation of protein–ligand binding affinity still remains a challenge due to the intrinsic limitation of the standard generalized Born (GB) model used in MM/GBSA. In this study, we proposed and evaluated the MM/GBSA approach based on a variable dielectric generalized Born (VDGB) model using residue-type-based dielectric constants. In the VDGB model, different dielectric values were assigned for the three types of protein residues, and the magnitude of the dielectric constants for residue types follows this order: charged ≥ polar ≥ nonpolar. We found that MM/GBSA based on a VDGB model (MM/GBSAVDGB) with an optimal dielectric constant of 4.0 for the charged residues and 1.0 for the noncharged residues together with a net-charge-dependent dielectric value for ligands achieved better predictions as judged by Pearson’s correlation coefficient than the standard MM/GBSA with a uniform solute dielectric constant of 4.0 for the training set of 130 protein–ligand complexes. The prediction on the test set with 165 protein–ligand complexes also validated the better performance of MM/GBSAVDGB. Moreover, this method exhibited potential in predicting the relative binding free energies for multiple ligands against the same target. Furthermore, we found that rational truncation of protein residues far from the binding site can significantly speed up the MM/GBSAVDGB calculations, while it almost does not influence the prediction accuracy. Therefore, it is feasible to implement the system-truncated MM/GBSAVDGB as a scoring function for SBDD.

Summary Protein-protein interactions (PPIs) have been regarded as an attractive emerging class of therapeutic targets for the development of new treatments. Computational approaches, especially molecular docking, have been extensively employed to predict the binding structures of PPI-inhibitors or discover novel small molecule PPI inhibitors. However, due to the relatively ‘undruggable’ features of PPI interfaces, accurate predictions of the binding structures for ligands towards PPI targets are quite challenging for most docking algorithms. Here, we constructed a non-redundant pose ranking benchmark dataset for small-molecule PPI inhibitors, which contains 900 binding poses for 184 protein-ligand complexes. Then, we evaluated the performance of MM/PB(GB)SA approaches to identify the correct binding poses for PPI inhibitors, including two Prime MM/GBSA procedures from the Schrödinger suite and seven different MM/PB(GB)SA procedures from the Amber package. Our results showed that MM/PBSA outperformed the Glide SP scoring function (success rate of 58.6%) and MM/GBSA in most cases, especially the PB3 procedure which could achieve an overall success rate of ∼74%. Moreover, the GB6 procedure (success rate of 68.9%) performed much better than the other MM/GBSA procedures, highlighting the excellent potential of the GBNSR6 implicit solvation model for pose ranking. Finally, we developed the webserver of Fast Amber Rescoring for PPI Inhibitors (farPPI), which offers a freely available service to rescore the docking poses for PPI inhibitors by using the MM/PB(GB)SA methods. Availability and implementation farPPI web server is freely available at http://cadd.zju.edu.cn/farppi/. Supplementary information Supplementary data are available at Bioinformatics online.