Computational investigations of hERG channel blockers: New insights and current predictive models

Identification of potential human Ether-a-go-go Related-Gene (hERG) potassium channel blockers is an essential part of the drug development and drug safety process in pharmaceutical industries or academic drug discovery centers, as they may lead to drug-induced QT prolongation, arrhythmia and Torsade de Pointes. Recent reports also suggest starting to address such issues at the hit selection stage. In order to prioritize molecules during the early drug discovery phase and to reduce the risk of drug attrition due to cardiotoxicity during pre-clinical and clinical stages, computational approaches have been developed to predict the potential hERG blockage of new drug candidates. In this review, we will describe the current in silico methods developed and applied to predict and to understand the mechanism of actions of hERG blockers, including ligand-based and structure-based approaches. We then discuss ongoing research on other ion channels and hERG polymorphism susceptible to be involved in LQTS and how systemic approaches can help in the drug safety decision.

In silico prediction of hERG inhibition

The voltage-gated potassium channel encoded by hERG carries a delayed rectifying potassium current (IKr) underlying repolarization of the cardiac action potential. Pharmacological blockade of the hERG channel results in slowed repolarization and therefore prolongation of action potential duration and an increase in the QT interval as measured on an electrocardiogram. Those are possible to cause sudden death, leading to the withdrawals of many drugs, which is the reason for hERG screening. Computational in silico prediction models provide a rapid, economic way to screen compounds during early drug discovery. In this review, hERG prediction models are classified as 2D and 3D quantitative structure–activity relationship models, pharmacophore models, classification models, and structure based models (using homology models of hERG).

QSAR modeling and data mining link Torsades de Pointes risk to the interplay of extent of metabolism, active transport, and HERG liability

We collected 1173 hERG patch clamp (PC) data (IC50) from the literature to derive twelve classification models for hERG inhibition, covering a large variety of chemical descriptors and classification algorithms. Models were generated using 545 molecules and validated through 258 external molecules tested in PC experiments. We also evaluated the suitability of the best models to predict the activity of 26 proprietary compounds tested in radioligand binding displacement (RBD). Results proved the necessity to use multiple validation sets for a true estimation of model accuracy and demonstrated that using various descriptors and algorithms improves the performance of ligand-based models. Intriguingly, one of the most accurate models uncovered an unexpected link between extent of metabolism and hERG liability. This hypothesis was fairly reinforced by using the Biopharmaceutics Drug Disposition Classification System (BDDCS) that recognized 94% of the hERG inhibitors as extensively metabolized in vivo. Data mining suggested that high Torsades de Pointes (TdP) risk results from an interplay of hERG inhibition, extent of metabolism, active transport, and possibly solubility. Overall, these new findings might improve both the decision making skills of pharmaceutical scientists to mitigate hERG liability during the drug discovery process and the TdP risk assessment during drug development.

Self-Organizing Maps for In Silico Screening and Data Visualization

Self-organizing maps, which are unsupervised artificial neural networks, have become a very useful tool in a wide area of disciplines, including medicinal chemistry. Here, we will focus on two applications of self-organizing maps: the use of self-organizing maps for in silico screening and for clustering and visualisation of large datasets. Additionally, the importance of parameter selection is discussed and some modifications to the original algorithm are summarised.