Cardiac arrhythmias are the most common cause of sudden cardiac death worldwide. Lengthening the ventricular action potential duration (APD), either congenitally or via pathologic or pharmacologic means, predisposes to a life-threatening ventricular arrhythmia, Torsade de Pointes. I-Ks (KCNQ1+KCNE1), a slowly activating K+ current, plays a role in action potential repolarization. In this study, we screened a chemical library in silico by docking compounds to the voltage-sensing domain (VSD) of the I-Ks channel. Here, we show that C28 specifically shifted IKs VSD activation in ventricle to more negative voltages and reversed the drug-induced lengthening of APD. At the same dosage, C28 did not cause significant changes of the normal APD in either ventricle or atrium. This study provides evidence in support of a computational prediction of I-Ks VSD activation as a potential therapeutic approach for all forms of APD prolongation. This outcome could expand the therapeutic efficacy of a myriad of currently approved drugs that may trigger arrhythmias.

ABSTRACTProtein‐protein interactions are either through direct contacts between two binding partners or mediated by structural waters. Both direct contacts and water‐mediated interactions are crucial to the formation of a protein‐protein complex. During the recent CAPRI rounds, a novel parallel searching strategy for predicting water‐mediated interactions is introduced into our protein‐protein docking method, MDockPP. Briefly, a FFT‐based docking algorithm is employed in generating putative binding modes, and an iteratively derived statistical potential‐based scoring function, ITScorePP, in conjunction with biological information is used to assess and rank the binding modes. Up to 10 binding modes are selected as the initial protein‐protein complex structures for MD simulations in explicit solvent. Water molecules near the interface are clustered based on the snapshots extracted from independent equilibrated trajectories. Then, protein‐ligand docking is employed for a parallel search for water molecules near the protein‐protein interface. The water molecules generated by ligand docking and the clustered water molecules generated by MD simulations are merged, referred to as the predicted structural water molecules. Here, we report the performance of this protocol for CAPRI rounds 28–29 and 31–35 containing 20 valid docking targets and 11 scoring targets. In the docking experiments, we predicted correct binding modes for nine targets, including one high‐accuracy, two medium‐accuracy, and six acceptable predictions. Regarding the two targets for the prediction of water‐mediated interactions, we achieved models ranked as “excellent” in accordance with the CAPRI evaluation criteria; one of these two targets is considered as a difficult target for structural water prediction. Proteins 2017; 85:424–434. © 2016 Wiley Periodicals, Inc.

In this study, we developed two iterative knowledge-based scoring functions, ITScore_pdbbind(rigid) and ITScore_pdbbind(flex), using rigid decoy structures and flexible decoy structures, respectively, that were generated from the protein-ligand complexes in the refined set of PDBbind 2012. These two scoring functions were evaluated using the 2013 and 2014 CSAR benchmarks. The results were compared with the results of two other scoring functions, the Vina scoring function and ITScore, the scoring function that we previously developed from rigid decoy structures for a smaller set of protein-ligand complexes. A graph-based method was developed to evaluate the root-mean-square deviation between two conformations of the same ligand with different atom names and orders due to different file preparations, and the program is freely available. Our study showed that the two new scoring functions developed from the larger training set yielded significantly improved performance in binding mode predictions. For binding affinity predictions, all four scoring functions showed protein-dependent performance. We suggest the development of protein-family-dependent scoring functions for accurate binding affinity prediction.

Knowledge‐based scoring functions are widely used for assessing putative complexes in protein–ligand and protein–protein docking and for structure prediction. Even with large training sets, knowledge‐based scoring functions face the inevitable problem of sparse data. Here, we have developed a novel approach for handling the sparse data problem that is based on estimating the inaccuracies in knowledge‐based scoring functions. This inaccuracy estimation is used to automatically weight the knowledge‐based scoring function with an alternative, force‐field‐based potential (FFP) that does not rely on training data and can, therefore, provide an improved approximation of the interactions between rare chemical groups. The current version of STScore, a protein–ligand scoring function using our method, achieves a binding mode prediction success rate of 91% on the set of 100 complexes by Wang et al., and a binding affinity correlation of 0.514 with the experimentally determined affinities in PDBbind. The method presented here may be used with other FFPs and other knowledge‐based scoring functions and can also be applied to protein–protein docking and protein structure prediction. © 2014 Wiley Periodicals, Inc.

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.

In this study, we use the recently released 2012 Community Structure-Activity Resource (CSAR) data set to evaluate two knowledge-based scoring functions, ITScore and STScore, and a simple force-field-based potential (VDWScore). The CSAR data set contains 757 compounds, most with known affinities, and 57 crystal structures. With the help of the script files for docking preparation, we use the full CSAR data set to evaluate the performances of the scoring functions on binding affinity prediction and active/inactive compound discrimination. The CSAR subset that includes crystal structures is used as well, to evaluate the performances of the scoring functions on binding mode and affinity predictions. Within this structure subset, we investigate the importance of accurate ligand and protein conformational sampling and find that the binding affinity predictions are less sensitive to non-native ligand and protein conformations than the binding mode predictions. We also find the full CSAR data set to be more challenging in making binding mode predictions than the subset with structures. The script files used for preparing the CSAR data set for docking, including scripts for canonicalization of the ligand atoms, are offered freely to the academic community.

Inclusion of entropy is important and challenging for protein-protein binding prediction. Here, we present a statistical mechanics-based approach to empirically consider the effect of orientational entropy. Specifically, we globally sample the possible binding orientations based on a simple shape-complementarity scoring function using an FFT-type docking method. Then, for each generated orientation, we calculate the probability through the partition function of the ensemble of accessible states, which are assumed to be represented by the set of nearby binding modes. For each mode, the interaction energy is calculated using our ITScorePP scoring function that was developed in our laboratory based on principles of statistical mechanics. Using the above protocol, we present the results of our participation in Rounds 22-27 of the Critical Assessment of PRedicted Interactions (CAPRI) experiment for 10 targets (T46-T58). Additional experimental information, such as low-resolution small-angle X-ray scattering data, was used when available. In the prediction (or docking) experiments of the 10 target complexes, we achieved correct binding modes for six targets: one with high accuracy (T47), two with medium accuracy (T48 and T57), and three with acceptable accuracy (T49, T50, and T58). In the scoring experiments of seven target complexes, we obtained correct binding modes for six targets: one with high accuracy (T47), two with medium accuracy (T49 and T50), and three with acceptable accuracy (T46, T51, and T53).

In the derivation of any knowledge-based scoring function, one must decide how to manage sparse features in the training data. Here we present STScore, a distance-dependent set of atomic pair potentials that uses a novel approach to minimize the sparse data problem. The overall approach is to represent the actual potential of mean force, which is unknown, as a random variable whose probability density is determined by the evidence in the training set. This provides a natural way of representing the uncertainty in the potential of mean force (PMF), for each bin and atom pair type. STScore is an average of the PMF and an alternative force-field-based potential, with the weights chosen to minimize the error in the sum. This weighting scheme implies that STScore will give more weight to the force-field potential whenever training data is scarce. We show that STScore effectively combines the two alternatives, exceeding the performance of either potential alone, and leads to improved binding mode and binding affinity predictions.

Inverse docking is a relatively new technique that has been used to identify potential receptor targets of small molecules. Our docking software package MDock is well suited for such an application as it is both computationally efficient, yet simultaneously shows adequate results in binding affinity predictions and enrichment tests. As a validation study, we present the first stage results of an inverse-docking study which seeks to identify potential direct targets of PRIMA-1. PRIMA-1 is well known for its ability to restore mutant p53's tumor suppressor function, leading to apoptosis in several types of cancer cells. For this reason, we believe that potential direct targets of PRIMA-1 identified in silico should be experimentally screened for their ability to inhibit cancer cell growth. The highest-ranked human protein of our PRIMA-1 docking results is oxidosqualene cyclase (OSC), which is part of the cholesterol synthetic pathway. The results of two followup experiments which treat OSC as a possible anti-cancer target are promising. We show that both PRIMA-1 and Ro 48-8071, a known potent OSC inhibitor, significantly reduce the viability of BT-474 and T47-D breast cancer cells relative to normal mammary cells. In addition, like PRIMA-1, we find that Ro 48-8071 results in increased binding of p53 to DNA in BT-474 cells (which express mutant p53). For the first time, Ro 48-8071 is shown as a potent agent in killing human breast cancer cells. The potential of OSC as a new target for developing anticancer therapies is worth further investigation.

The scoring function is one of the most important components in structure-based drug design. Despite considerable success, accurate and rapid prediction of protein-ligand interactions is still a challenge in molecular docking. In this perspective, we have reviewed three basic types of scoring functions (force-field, empirical, and knowledge-based) and the consensus scoring technique that are used for protein-ligand docking. The commonly-used assessment criteria and publicly available protein-ligand databases for performance evaluation of the scoring functions have also been presented and discussed. We end with a discussion of the challenges faced by existing scoring functions and possible future directions for developing improved scoring functions.

Generalized Born (GB) models are widely used to study the electrostatic energetics of solute molecules including proteins. Previous work demonstrates that GB models may produce satisfactory solvation energies if accurate effective Born radii are computed for all atoms. Our previous study showed that a GB model which reproduces the solvation energy may not necessarily be suitable for ligand binding calculations. In this work, we studied binding energetics using the exact GB model, in which Born radii are computed from the Poisson-Boltzmann (PB) equation. Our results showed that accurate Born radii lead to very good agreement between GB and PB in electrostatic calculations for ligand binding. However, recently developed GB models with high Born radii accuracy, when used in large database screening, may suffer from time constraints which make accurate, large-scale Born radii calculations impractical. We therefore present a multiscale GB approach in which atoms are divided into two groups. For atoms in the first group, those few atoms which are most likely to be critical to binding electrostatics, the Born radii are computed accurately at the sacrifice of speed. We propose two alternative approaches for atoms in the second group. The Born radii of these atoms may simply be computed by a fast GB method. Alternatively, the Born radii of these atoms may be computed accurately in the free state, and then, a variational form of a fast GB method may be used to compute the change in Born radii experienced by these atoms during binding. This strategy provides an accuracy advantage while still being fast enough for use in the virtual screening of large databases.

P. Pfeifer, L. Aston, M. Banks, S. Barker, J. Burress, S. Carter, J. Coleman, S. Crockett, C. Faulhaber, J. Flavin, M. Gordon, L. Hardcastle, Z. Kallenborn, M. Kemiki, C. Lapilli, J. Pobst, R. Schott, P. Shah, S. Spellerberg, G. Suppes, D. Taylor, A. Tekeei, C. Wexler, and M. Wood University of Missouri, Columbia, Missouri 65211, USA P. Buckley, T. Breier, J. Downing, S. Eastman, P. Freeze, S. Graham, S. Grinter, A. Howard, J. Martinez, D. Radke, and T. Vassalli Midwest Research Institute, Kansas City, Missouri 64110, USA J. Ilavsky Argonne National Laboratory, Argonne, Illinois 60439, USA Received 27 August 2007; published online 27 December 2007 DOI: 10.1063/1.2786007