Learning Deep Architectures for Interaction Prediction in Structure-based Virtual Screening

Learning Deep Architectures for Interaction Prediction in Structure-based Virtual Screening

Adam Gonczarek, Jakub M. Tomczak, Szymon Zaręba, Joanna Kaczmar
Wrocław University of Science and Technology
adam.gonczarek@pwr.edu.pl &Piotr Dąbrowski, Michał J. Walczak
Indata SA
Abstract

We introduce a deep learning architecture for structure-based virtual screening that generates fixed-sized fingerprints of proteins and small molecules by applying learnable atom convolution and softmax operations to each compound separately. These fingerprints are further transformed non-linearly, their inner-product is calculated and used to predict the binding potential. Moreover, we show that widely used benchmark datasets may be insufficient for testing structure-based virtual screening methods that utilize machine learning. Therefore, we introduce a new benchmark dataset, which we constructed based on DUD-E and PDBBind databases.

 

Learning Deep Architectures for Interaction Prediction in Structure-based Virtual Screening


  Adam Gonczarek, Jakub M. Tomczak, Szymon Zaręba, Joanna Kaczmar Wrocław University of Science and Technology adam.gonczarek@pwr.edu.pl Piotr Dąbrowski, Michał J. Walczak Indata SA

\@float

noticebox[b]Workshop on Machine Learning in Computational Biology. 30th Conference on Neural Information Processing Systems (NIPS 2016), Barcelona, Spain.\end@float

1 Introduction

Virtual screening is one of the leading methods in computational drug discovery, which aims at identification of novel small molecules that are capable of binding a drug target, usually a protein. In short, there are two main approaches of virtual screening, ligand-based and structure-based. Ligand-based virtual screening relies on empirically established data, which provide information on active (binding compounds later called ligands) and inactive (not binding) molecules. This approach exploits chemical and spatial similarity among binders to identify new ligands of proteins. The second approach, structure-based virtual screening, requires structural information of a protein to dock a ligand candidate in the binding pockets of a target. Here, a large number of small molecules is screened against a structure of a target protein. Then, binding capacity between protein and compounds is assessed using scoring functions, and finally compounds are triaged according to their binding potential.

The main hurdles affecting virtual screening is complexity of chemical space comprising up to theoretical [1] and of commercially available compounds [4]111http://zinc15.docking.org/, as well as high false positive rate of identified ligands and a lack of exhaustive training datasets.

Although the above mentioned hindrances are tackled by various approaches, e.g. Smina [5], with different success rate, it is the advent of deep learning that promises superior performance in high-throughput virtual screening [13]. Deep learning has already been successfully employed in ligand-based virtual screening [2, 7, 10] but only recently the very first attempts to the structure-based methods have emerged [9, 14].

In this study, we propose a new deep architecture for predicting binding capacity of a protein-molecule pair. In addition, we demonstrate the disadvantages of common benchmark datasets, which are used for training and testing screening methods. To fill this gap, we propose a new benchmark dataset that is more suitable for structure-based virtual screening.

2 Methodology

Model

Our aim is to predict binding potential for given pair of a small molecule and a target (represented by a pocket in protein structure to which a ligand may bind) . We face three major problems in the stated task: (i) both target and small compound vary in size, (ii) each of them is represented by a list of atoms and therefore a method must be invariant to any permutation of the list, (iii) these are 3D structures, thus a method must be invariant to translations and rotations. To cope with these issues we propose to process the protein and the small molecule separately to obtain two fixed-size descriptions (fingerprints) that can be further transformed non-linearly e.g. by neural nets, and finally used for binding prediction. This approach aims at processing the protein-compound pair separately and then learning a relation of the interaction. A pipeline of the proposed method is presented in Figure 1(a).

Figure 1: (a) Schema of the proposed approach. Letters A and P denote lists of atoms and connections, respectively. (b) Details about the neural fingerprint.

The crucial part of the proposed approach is a fingerprint, i.e., a description of a fixed size. One of the widely used fingerprints for virtual screening is Extended Connectivity Fingerprint (ECFP) [11]. ECFP is an automatic manner of determining fingerprints by consecutively applying a hash function on atom and its neighborhood followed by a indexing operation. The hash function allows to combine information about each atom and its neighboring substructures while the indexing operation is used to combine all the nodes’ features into a single fingerprint of the whole compound. However, due to pre-determined form of hashing and indexing, ECFP is sensitive to small perturbations in molecule structure, and therefore the features obtained by this method are not very robust.

Very recently, the drawbacks of ECFP were alleviated by application of learnable operations similar to operations in convolutional neural nets [2]. Here the hashing is replaced with an adaptive convolutional-like operation and the indexing with a softmax operation. This could be formalized as follows. Let us denote an atom in a compound described by features by . Then hashing could be described in the following fashion:

(1)

where is neighboring atom, is the number of possible neighbors for the atom222Due to the physical properties of compounds there can be only up to neighbors, so ., is a matrix of weights333Notice that is the number of new features and this could differ from ., are matrices of weights for neighbors, is a bias vector, and is an element-wise non-linear function, e.g., the sigmoid function or ReLU. We refer to this operation as atom convolution and it can be repeated times which constitutes layers, and each layer consists of own weights to learn (see Fig. 1(b)).

The indexing operation is then replaced with a softmax operation that consecutively applies the softmax function to each atom in the compound to yield the final neural fingerprint :

(2)

where is a weight matrix, is a bias vector and is the size of the fingerprint.

Next, after obtaining the neural fingerprint for small compound () and protein (), we apply a neural network (MLP) to obtain new representations: and . Eventually, we calculate the bioactivity by transforming the inner product of and using the sigmoid function :

(3)

Training

Standard learning of neural networks utilizes the cross-entropy (CE) loss function. Typically databases contain only active ligand-protein pairs. Hence, we propose to add an additional term to the CE loss in order to avoid overfitting to the positive class:

(4)

Despite the fact that the expected value can be approximated using Monte Carlo methods, this formulation causes a problem since finding the joint probability of the small molecule-protein pair is a very complex task. We overcome this issue with the assumption that taking a random pair from the dataset would result in a negative (not binding) example. Obviously, such an approach introduces a bias, however, a chance of producing wrong label is negligible. The proposed loss function in (4) is closely related to the Noise Contrastive Estimation [3].

3 Results

The efficacy of machine learning methods for virtual screening are typically evaluated with one of the renowned benchmarks, e.g., DUD-E [8]. Generally, the evaluation dataset is divided into training and testing sets that contain different targets (together with their actives and decoys). Interestingly, it turns out that this testing protocol might be strongly biased due to similarity of artificial decoys for different targets. We addressed this problem with a newly developed benchmark based on two separate datasets.

Dataset Method Mean AUC
DUD-E Smina
AtomNet [14]
cmpds ECFP + LR 0.904
DUD DeepVS [9]
Table 1: Results on DUD-E benchmark ( of data for training and of data for testing) and on DUD benchmark (leave-one-out cross-validation).

DUD-E experiment

We used DUD-E444http://dude.docking.org/ benchmark, consisting of proteins (targets), active compounds (ligands or binders) and over decoys (non-binders). We randomly divided targets into training () and testing () parts, which is similarly to [14]. We applied the ECFP fingerprint with the size of to small compounds (cmpds) only and trained logistic regression (LR) to discriminate between actives and decoys. Notice that no information about targets was used. The method achieved mean AUC, evaluated on the targets in the test set, and to the best of our knowledge it has outperformed other state-of-the-art methods for structure-based virtual screening trained in the similar manner (see Table 1). Thus, this suggests that datasets with many artificially generated decoys (like DUD-E) are prone to bias due to similarity of majority of the inactive compounds for one target to inactive compounds for other targets. Further, application of basic learning methods to small compounds only results in improved performance. Consequently, it is uncertain whether a method evaluated on this testing scheme learns the relationship between compounds and targets, or learns the discrimination between active and inactive molecules, where additional information about targets only contributes to noise.

PDBBind + DUD-E

Next, we employed PDBBind [6] for training and DUD-E for testing. The original PDBBind database contains 3D structures of about complexes, i.e., structures of ligands docked in binding pockets of proteins. We have removed all the complexes containing targets from DUD-E, obtaining complexes for training. Notice that this dataset contains no artificially generated decoys, negative examples are generated by sampling random target-compounds pairs from the dataset (see Eq. 4). For testing we used DUD-E targets represented by a binding pocket extracted from the original PDBBind. For each target we have randomly sampled compounds (actives and decoys) from DUD-E, resulting in testing examples. We tested two different models based on the pipeline presented in Fig. 1(a). In the first model, standard ECFP fingerprints were applied both to small compounds and pockets. In the second one we adopted learnable neural fingerprints. We compared our approach to two widely used methods, i.e., AutoDock Vina [12] and Smina [5]. The results are presented in Table 2. First, we see the importance of applying learnable fingerprint, since ECFP performed worse than the reference methods. Second, we observe that the neural fingerprint-based approach outperformed both reference methods, achieving better mean AUC, and reaching more targets that exceeded high AUC thresholds.

Method Total AUC Mean AUC ( std.) AUC AUC AUC
AutoDock Vina 47 21 4
Smina 54 23 4
Ours(ECFP) 21 2 0
Ours(NF) 0.714 0.705 0.168 47 29 11
Table 2: Results obtained on the proposed benchmark. The presented approach with ECFP is denoted by Ours(ECFP) and the one with neural fingerprint by Ours(NF). AUC denotes on how many targets (out of ) a method performs better than .

4 Conclusions

This study results in two contributions in the field of computational drug discovery. First, we propose a new benchmark dataset built on top of the two established datasets, PDBBind and DUD-E. This benchmark provides suitable information for the development of structure-based virtual screening methods. At the same time, we demonstrate that currently available benchmarks represent mediocre training and testing sets due to insufficient coverage of chemical complexity. Second, we propose a novel deep learning-based approach able to identify ligands of target protein. The performed experiments showed that our approach outperforms two widely used methods, AutoDock Vina and Smina. Here developed method reaches AUC of or greater for the targets, while the reference methods exceed AUC of for the targets. We anticipate further evolution of the proposed approach by applying more sophisticated deep learning techniques, e.g. by developing more accurate learnable fingerprints.

Acknowledgments

The work conducted in this paper is partially co-financed by European Regional Development Fund within the framework of the Smart Growth Operational Programme 2014-2020, grant No. POIR.01.01.01-00-1083/15, and by European Union FI-Core project, grant no. 632893, (FIWARE@Wroclaw), funded within FI-PPP and FP7.

References

  • Bohacek et al. [1996] RS Bohacek, C McMartin, and WC Guida. The art and practice of structure-based drug design: A molecular modeling perspective. Medicinal research reviews, 16(1):3–50, 1996.
  • Duvenaud et al. [2015] DK Duvenaud, D Maclaurin, J Iparraguirre, R Bombarell, T Hirzel, A Aspuru-Guzik, and RP Adams. Convolutional networks on graphs for learning molecular fingerprints. In NIPS, pages 2215–2223, 2015.
  • Gutmann and Hyvärinen [2012] MU Gutmann and A Hyvärinen. Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics. J. Mach. Learn. Res., 13(Feb):307–361, 2012.
  • Irwin et al. [2012] JJ Irwin, T Sterling, MM Mysinger, ES Bolstad, and RG Coleman. Zinc: a free tool to discover chemistry for biology. Journal of chemical information and modeling, 52(7):1757–1768, 2012.
  • Koes et al. [2013] DR Koes, MP Baumgartner, and CJ Camacho. Lessons learned in empirical scoring with smina from the csar 2011 benchmarking exercise. J. Chem. Inf. Model., 53(8):1893–1904, 2013.
  • Liu et al. [2014] Z Liu, Y Li, L Han, J Li, J Liu, Z Zhao, W Nie, Y Liu, and R Wang. Pdb-wide collection of binding data: current status of the pdbbind database. Bioinformatics, page btu626, 2014.
  • Ma et al. [2015] J Ma, RP Sheridan, A Liaw, GE Dahl, and V Svetnik. Deep neural nets as a method for quantitative structure–activity relationships. J. Chem. Inf. Model., 55(2):263–274, 2015.
  • Mysinger et al. [2012] MM Mysinger, M Carchia, JJ Irwin, and BK Shoichet. Directory of useful decoys, enhanced (dud-e): better ligands and decoys for better benchmarking. Journal of medicinal chemistry, 55(14):6582–6594, 2012.
  • Pereira et al. [2016] JC Pereira, ER Caffarena, and C Santos. Boosting docking-based virtual screening with deep learning. arXiv:1608.04844, 2016.
  • Ramsundar et al. [2015] B Ramsundar, S Kearnes, P Riley, D Webster, D Konerding, and V Pande. Massively multitask networks for drug discovery. arXiv:1502.02072, 2015.
  • Rogers and Hahn [2010] D Rogers and M Hahn. Extended-connectivity fingerprints. J. Chem. Inf. Model., 50(5):742–754, 2010.
  • Trott and Olson [2010] O Trott and AJ Olson. Autodock vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading. Journal of computational chemistry, 31(2):455–461, 2010.
  • Unterthiner et al. [2014] T Unterthiner, A Mayr, G Klambauer, M Steijaert, JK Wegner, H Ceulemans, and S Hochreiter. Deep learning as an opportunity in virtual screening. NIPS, 27, 2014.
  • Wallach et al. [2015] I Wallach, M Dzamba, and A Heifets. AtomNet: A Deep Convolutional Neural Network for Bioactivity Prediction in Structure-based Drug Discovery. arXiv:1510.02855, 2015.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
35057
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description