Skip to main content

Sfcnn: a novel scoring function based on 3D convolutional neural network for accurate and stable protein–ligand affinity prediction



Computer-aided drug design provides an effective method of identifying lead compounds. However, success rates are significantly bottlenecked by the lack of accurate and reliable scoring functions needed to evaluate binding affinities of protein–ligand complexes. Therefore, many scoring functions based on machine learning or deep learning have been developed to improve prediction accuracies in recent years. In this work, we proposed a novel featurization method, generating a new scoring function model based on 3D convolutional neural network.


This work showed the results from testing four architectures and three featurization methods, and outlined the development of a novel deep 3D convolutional neural network scoring function model. This model simplified feature engineering, and in combination with Grad-CAM made the intermediate layers of the neural network more interpretable. This model was evaluated and compared with other scoring functions on multiple independent datasets. The Pearson correlation coefficients between the predicted binding affinities by our model and the experimental data achieved 0.7928, 0.7946, 0.6758, and 0.6474 on CASF-2016 dataset, CASF-2013 dataset, CSAR_HiQ_NRC_set, and Astex_diverse_set, respectively. Overall, our model performed accurately and stably enough in the scoring power to predict the binding affinity of a protein–ligand complex.


These results indicate our model is an excellent scoring function, and performs well in scoring power for accurately and stably predicting the protein–ligand affinity. Our model will contribute towards improving the success rate of virtual screening, thus will accelerate the development of potential drugs or novel biologically active lead compounds.

Peer Review reports


Modern drug development has been drastically restricted by the costly and time-consuming process of discovering biologically active compounds. Computer-aided drug design (CADD) provides an effective and relatively inexpensive method of identifying lead compounds [1]. Structure-based molecular docking, with conformational sampling and assessment of binding affinity, is a key element of CADD [2]. Improving the docking accuracy is paramount for enhancing success rates during virtual screening when undertaking computational drug development. Due to recent advances in computing power and numerical algorithms, docking success is no longer restricted by the inadequacies of conformational sampling [2, 3]. Most well-known docking software programs such as GOLD [4], AutoDockVina [5], and Glide [6], demonstrate excellent conformational sampling performance. However, there is presently a lack of accurate and reliable scoring functions available to evaluate the binding free energy between proteins and ligands, limiting the success rates of virtual screening within the drug discovery pipeline [2].

The scoring function is a mathematical model used to estimate the free energy of protein–ligand complexes, and helps to predict their binding affinities. It can be used to determine the binding mode of a ligand, predict the binding affinity between proteins and ligands, and identify the potential lead compounds for a given drug target. A precise and reliable scoring function is therefore critical for the success of any docking method or docking software [7]. Despite its importance, developing a precise and reliable scoring function is very challenging because the binding free energy between a protein and its ligand is very complex. Features such as van der Waals interactions, electrostatic interactions, hydrogen bonds, hydrophobic interactions, solvent effects, and the difficulty in capturing entropic contributions add to the complexity of this task [2]. Hence, the research into developing a more accurate and reliable scoring function is always a hot topic as it plays such an important role in computational drug development.

Conventional methods for scoring functions are usually classified into physics-based, empirical, and knowledge-based methods. In recent years, another category of scoring function based on machine learning (ML) has emerged as a fast yet accurate binding affinity prediction method [8,9,10,11,12,13]. Scoring power refers to the ability of a scoring function to produce binding scores in a linear correlation with experimental binding data [14]. The ML-based predictors usually perform better in the ‘scoring power’ of scoring functions than conventional methods. Early examples such as RFscores [8] and NNScore [9], which were based on random forest and neural network respectively, both applied ML methods to produce binding affinity predictions. These two scoring function models also relied on experts to perform very complex feature extractions. Later, deep convolutional neural network (CNN) models were adopted to undertake binding affinity predictions and virtual screening [13, 15,16,17,18]. AtomNet [18] is the first CNN model to predict the bioactivity of small molecules. KDEEP [10] and Pafnucy [12] were also based on the CNN model, and both took the vectorized grids within a cubic box centered at the ligand as the features for the protein−ligand complex. Both KDEEP and Pafnucy performed much better in terms of scoring power than the scoring functions based on conventional methods. Gnina is a deep learning framework for molecular docking [17, 19]. Gnina was trained by integrating non-binding data, and performed well on pose selection and affinity prediction. In addition, other features such as the protein–ligand topological fingerprints were also adopted for ML and CNN models [13, 20].

In this study, a much more concise method of featurization for the protein–ligand complex was adopted, generating a new scoring function model to predict binding affinities between proteins and their ligands after receiving training from a deep three-dimensional (3D) convolutional neural network. The features for the protein−ligand complex in our model were represented using a 3D grid or 4D tensor. In contrast to KDEEP and Pafnucy models, the featurization of atoms or voxels in our model was simplified, and only the most basic atomic type information was extracted. The high dimensional information from protein–ligand complexes, including van der Waals interactions, electrostatic interactions, hydrogen bonds, and other complicating factors, were automatically learned by the subsequent convolutional neural network. Our scoring function model achieved a root mean squared error (RMSE) of 1.3263 and 1.4518 on CASF-2016 [14] and CASF-2013 datasets [21], respectively. Consistently, corresponding Pearson correlation coefficient R values of 0.7928 and 0.7946 were achieved by our model on these two datasets. Additionally, some independent extra sets were also selected to further evaluate the new model. As a result, compared to some other scoring functions, our model performed well, and was more stable in terms of scoring power. The model was implemented with TensorFlow [22] and Keras. The source code, trained model, and preprocessing scripts are available in the git repository at



The scoring function model was trained with protein–ligand complexes from the refined set of the PDBbind database version 2019 [23]. This dataset contains 4852 high-quality protein−ligand complexes and their corresponding binding affinities expressed with pKa (-lgKd or -lgKi) values. Firstly, the CASF-2016 ‘scoring power’ benchmark [14] was selected as the test set. There were 285 protein–ligand complexes within the test set. All of the overlaps between the test set and the refined set were excluded from the refined set (266 overlaps). Then, for the remaining 4586 complexes in the v2016 refined set, 486 complexes (~ 10%) were randomly selected and used as the validation set. Finally, the remaining 4100 complexes (~ 90%) were adopted for the training set.

The CASF-2013 ‘scoring power’ benchmark [21], a subset of the PDBbind database version 2013, was selected as an extra test set in order to further compare the performance of our model with other scoring functions. The overlapping complexes which existed in the training and validation sets were removed from the CASF-2013 dataset. The remaining 107 complexes (referred to as the CASF-2013 dataset hereafter) were found to be a subset of the CASF-2016 dataset (the first test set).

Other independent test sets including CSAR_HiQ_NRC_set [24] (343 protein–ligand complexes), and Astex_diverse_set [25] (74 protein–ligand complexes), were also selected as extra test sets with the purpose of comparing the performance of our model with other scoring functions more fairly.

Featurization of protein–ligand complexes

In our model, the protein–ligand complexes were transformed into a 3D grid for subsequent CNN training (Fig. 1). Firstly, the geometric center of the binding site was calculated by the coordinates of the atoms in the ligand. Then, a cube of 20 × 20 × 20 Å3 was cropped around the center of the binding site. All of the atoms (including protein atoms and ligand atoms, together with water, metal, and hydrogen atoms in the protein–ligand complex) within this cube area were retained for training. In the default case, the input 3D grid had a resolution of 20 × 20 × 20, and each voxel represented the atoms inside that 1 × 1 × 1 Å3 area. Finally, the 3D grid was further transformed into a 4D tensor. The first 3 dimensions of the 4D tensor represented the index of a voxel in the 3D grid, and the last dimension of the 4D tensor was a vector of features encoded by the atoms inside that voxel. For example, when given a 3D grid space between (− 10 Å, − 10 Å, − 10 Å) and (10 Å, 10 Å, 10 Å) with the origin at the geometric center of the binding site, and a carbon atom with coordinates of (− 0.5 Å, − 3.2 Å, 0.3 Å), it was assumed that the 4D tensor was represented by T, and the vector of features encoded by this carton atom was represented by V. Subsequently, the index of this atom was calculated in the 3D grid (which was (6, 9, 10)) and the corresponding 4D tensor of the voxel containing this atom could be represented as T (6, 9, 10) = V. Each atom in the cube would be calculated in this manner and finally the protein–ligand complex would be transformed into a 4D tensor for subsequent CNN training. When multiple atoms were present in a single voxel, features from all of the atoms would be added.

Fig. 1
figure 1

Featurization of the protein–ligand complexes. PDB ID 1a30 is shown as an example. In the default case, the resolution of 20 × 20 × 20 and 28 categories of atomic types were used

As highlighted above, the last dimension of the 4D tensor is a vector of features encoded by the atoms in the small cube (1 × 1 × 1 Å3) area, and the vector needs to distinguish and differentiate all kinds of atomic types. Unlike the methods by which features were extracted in KDEEP and Pafnucy, we simplified the featurization and only used one-hot encoding of atomic types as the input vectors of features. To better distinguish various atomic types, and to get better results of featurization, the atoms within protein–ligand complexes were classified into 28 categories, with 14 categories for proteins and 14 categories for ligands as the default setting (Additional file 1: Table S1).

The method used for protein–ligand complex featurization used in the default case, as described above, was named Feature1. A higher resolution of 24 × 24 × 24 was also considered when generating a 3D grid to test whether the resolution of 20 × 20 × 20 used in the default case could retain enough information to precisely predict the binding free energy of proteins and ligands. The method of featurization when using a resolution of 24 × 24 × 24, and retaining all atoms including hydrogen atoms and metal atoms for one-hot encoding (28 categories of atomic types just like used in the default case), was named Feature2. Taking into account that in many scoring functions, the water molecules and ions were removed and the hydrogen atoms and metal atoms were ignored prior to protein–ligand complex featurization, the third method of featurization was also adopted and named Feature3. This method used a resolution of 20 × 20 × 20 and ignored all of the hydrogen atoms and metal atoms when one-hot encoding of atomic types for comparison (24 categories of atomic types). The atomic features were calculated using Open Babel [26], and the script used for transforming the protein–ligand complex into a 4D tensor is also available at


During this work, the deep 3D convolutional neural network was used with a single output neuron to predict the binding affinity. To improve the performance of the scoring function, data enhancement was performed on the training set by randomly rotating each protein–ligand complex 9 times. The final training set consisted of 41,000 samples. All labels (the pKa values of corresponding protein–ligand complexes) in the training and validation sets were normalized to range between zero and one by dividing each value by 15, thereby facilitating subsequent training. The Keras package with TensorFlow was used to construct the deep neural network architectures.

A total of 4 architectures were adopted for comparison during this work. The first architecture (called CNN1 hereafter) is a commonly used CNN architecture (Fig. 2a). This architecture takes the 4D tensor of a protein–ligand complex as the input. The first several convolutional layers extract features among nearby atoms. The following fully connected layers reorganize the features and predict the binding affinities between the proteins and ligands. ReLU activation and batch normalization were applied on each convolutional layer and fully connected layer. A dropout layer was applied after the fully connected layer and L2 regularization was applied on the output layer to reduce the probability of overfitting and improve generalization. The second architecture (called CNN2 hereafter) starts with a convolutional layer with a 1 × 1 × 1 filter (Fig. 2b). Because the input features in the present work were very sparse, using the convolutional layer with a 1 × 1 × 1 filter as the first layer enables mapping of the sparse feature vectors of the atoms to dense vectors and works like word embedding. This method may improve the performance. The other details of the CNN2 architecture are similar to the CNN1 as shown in Fig. 2b. The third architecture (called Res3 hereafter) is based on Resnet [27]. Resnet is a classical deep CNN architecture and gets outstanding performance in image recognition by training a deeper neural network with shortcut connection. In the present work, the Resnet architecture was transplanted to our 3D CNN training task. The detailed architecture of Res3 is shown in Fig. 2c. The fourth architecture (called Dense4 hereafter) is based on Densenet [28]. Densenet is another classical deep CNN architecture with fewer parameters and also has outstanding performance in image recognition. In the present work, the Dense architecture was transplanted to our 3D CNN training task and the detailed architecture is shown in Fig. 2d. Both Res3 and Dense4 used much deeper neural networks, requiring larger computational resources and longer computational time during training. The hyper-parameters of these four architectures including learning rate, batch size, dropout ratio, and L2 weight value were optimized by using the grid search method. Only the model with the lowest loss on the validation set for each architecture was saved for comparison.

Fig. 2
figure 2

Architectures specifics. a Details of the CNN1 architecture. b Details of the CNN2 architecture. c Details of the Res3 architecture based on ResNet. d Details of the Dense4 architecture based on DenseNet. Abbreviations are defined as: Conv3D (number of channels, kernel size, stride): 3D convolutional neural network layer, BN: Batch Normalization layer, ReLU: Rectified Linear Unit activation layer


Several evaluation metrics were used to assess the model accuracy including root mean squared error (RMSE, which quantifies the relative deviations of the predicted values from the true values), mean absolute error (MAE, the average of the summed absolute differences of the predicted values to the true values), standard deviation (SD) and Pearson correlation coefficient (R) between the predicted pKa (represented by ypredict) and the experimentally determined true pKa (represented by ytrue) in this study. The last two evaluation metrics were also adopted in the CASF-2016 benchmark dataset, therefore the accuracies of these scoring functions in the CASF-2016 benchmark were recalculated for comparison. The formulae for calculating the metrics of RMSE, MAE, SD, and R were as follows.

$${\text{RMSE}} = \sqrt {\frac{1}{N}\mathop \sum \limits_{i = 1}^{N} \left( {y_{predict} - y_{true} } \right)}$$
$${\text{MAE}} = \frac{1}{N}\sum \left| {y_{predict} - y_{true} } \right|$$
$${\text{ SD}} = \sqrt {\frac{1}{N - 1}\mathop \sum \limits_{i = 1}^{N} \left( {\left( {a*y_{predict} + b} \right) - y_{true} } \right)^{2} }$$
$${\text{R}} = \frac{{E\left( {y_{predict} *y_{true} } \right) - E\left( {y_{predict} } \right)*E\left( {y_{true} } \right)}}{{\sigma_{{y_{predict} }} \sigma_{{y_{true} }} }}$$

where a and b represent the slope and interception of the linear regression line of the predicted and measured pKa values.

The DUD-E benchmark [29] was used to assess virtual screening abilities of Sfcnn. DUD-E benchmark consists of 102 targets, a set of active compounds known to bind these targets, and a lot of decoys for each active one. The DUD-E is a huge dataset consisting of over one million compounds and every target has a different number of active compounds to bind it. In this study we only selected a subset of DUD-E benchmark by random sampling to reduce computational time for docking and to ensure that every target corresponds to the same number of active compounds as possible. The fgfr1 (missing decoy data) and ace (containing silicon atoms) targets were excluded first. Then, we randomly selected 20 active compounds and 1000 decoys for each target to ensure the ratio of the number of active compounds to the number of decoys was 1:50. Finally, we performed molecular docking using Smina [5, 30] with default setting and re-scored the top 3 poses with Sfcnn. The 5% and 0.5% enrichment factors (EF) were used to assess the virtual screening ability of Sfcnn on each target. Also, we further tested the virtual screening ability of Sfcnn using a similar virtual screening approach on the CASF-2016 benchmark.

Results and discussion

Performance comparisons on four architectures with three methods of featurization

Table 1 demonstrates the best performance on the validation set after parameter tuning on the four different architectures using three methods of featurization as input. From Table 1, the CNN2 architecture, which begins with a convolution layer with a 1 × 1 × 1 filter, had significantly better performance than the other architectures when using Feature1 (resolution of 20 × 20 × 20, with all atoms retained) as input.

Table 1 The best performance model by training four architectures with three featurization methods as input. Feature1 used a resolution of 20 × 20 × 20 and retained all atoms. Feature2 used a resolution of 24 × 24 × 24 and also retained all atoms. Feature3 used a resolution of 20 × 20 × 20 but ignored hydrogen and metal atoms

Comparing with the architectures using Feature2, which adopted a higher resolution of 24 × 24 × 24 as input, the architectures using Feature1 with a resolution of 20 × 20 × 20 as input showed better performance in every architecture, thus indicating that a higher resolution or larger grid cannot significantly improve abilities relating to predicting the affinities between proteins and ligands. A higher resolution usually denotes that the input grid keeps more information from the protein–ligand complex but also represents that it needs increased computing resources to optimize the model. It is well known that the binding free energy between a protein and a ligand is contributed to by van der Waals interactions, electrostatic interactions, hydrogen bonds, hydrophobic interactions, solvent effects, and entropic contributions. Among the interactions between a protein and a ligand, the van der Waals interactions, hydrogen bonds, hydrophobic interactions, solvent effects, and entropic contributions are mainly localized around the ligand, and the 20 × 20 × 20 grid is good enough to collect these interactions. The electrostatic interactions, which are also very important in protein–ligand interactions, are long-range interactions and may not be fully accounted for within the 20 × 20 × 20 grid [13, 31]. However, as shown by the results in Table 1, generating the input tensors with resolution of the 20 × 20 × 20 is high enough for our prediction model. We presume that a larger grid may retain more noise by using our featurization methods of complexes. Smaller grids were also not considered because they do not collect most interactions between proteins and ligands sufficiently.

Comparisons of the architectures using Feature3, which ignores the hydrogen atoms and metal atoms in the protein–ligand complexes as input, against the architectures using Feature1 in which all of the atoms were retained, showed that the latter generally performed better. It is widely known that some hydrogen and metal atoms play very important roles in the interactions between proteins and their ligands, therefore retaining the hydrogen and metal atoms within the featurization of complexes is necessary to improve prediction abilities. This is also confirmed by the results in Table 1.

Comparisons between the CNN1, Res3, and Dense4 architectures showed that the CNN2 architecture generally demonstrated better performance levels. In our work, the deeper architecture based on classical Resnet and Densenet did not improve upon this performance. This may be related to the featurization method conducted in this study. Meanwhile, the Res3 and Dense4 architectures need increased levels of computing resources to handle the training, suggesting that they are not good architectures for our scoring function study. Because the input features in our work were very sparse, using the convolution layer with a 1 × 1 × 1 filter as the first layer enables mapping of the sparse feature vectors of the atoms to dense vectors and works in a similar manner to word embedding. We suspect this may be the reason that the CNN2 architecture exhibited the best performance.

The best performance model generated by the CNN2 architecture with Feature1 as input was chosen as the new scoring function model, named Sfcnn, for subsequent analysis. The total number of parameters for this model was 1,354,588. When training was undertaken for this model, the RMSprop optimizer was used with a 0.004 learning rate and 64 batch sizes. Other optimizers, learning rates, and batch sizes were tested but resulted in worse performance. To reduce overfitting, the dropout approach was used in the full connect layer with a 0.5 drop rate and L2 weight decay in the last layer with 0.01. Other values were also tested and resulted in higher losses. The best model was obtained with a minimal loss for the validating set at epoch = 112 (Additional file 1: Fig. S1).

Sfcnn performance on the training, validation, and test sets

The prediction accuracy of the Sfcnn model was determined based on the following evaluation metrics: RMSE, SD, MAE, and R. The Sfcnn model’s performance on the training, validation, and test sets are shown in Table 2. R = 0.9894 was achieved on the training set whereas R = 0.7336 on the validation set. By evaluating the performance on the CASF-2016 test set, the Sfcnn model achieved R (0.7928) close to 0.8 and a relatively small RMSE (1.3263). The performance on the CASF-2016 test set was slightly less than that of OnionNet [13] (R = 0.816) and AGL [32] (R = 0.833) which are also based on deep learning as previously reported by Zheng et al. [13]. However, when they were evaluated on the CASF-2013 test set, the performance of our Sfcnn model was slightly better than that of OnionNet (R = 0.78) and AGL (R = 0.792) [13], and also achieved an R (0.7946) close to 0.8 with a relatively small RMSE (1.4518). Overall, the performance of Sfcnn was similar to that of Onion and AGL, and all of them achieved a pretty good performance level for scoring power with an R around 0.8 and a relatively small RMSE. Meanwhile, the predicted pKa and the true pKa were highly linear correlated for the two test sets and the validating set as shown in Fig. 3.

Table 2 Performance of Sfcnn on training, validation, CASF-2016, and CASF-2013 datasets
Fig. 3
figure 3

Performance of the Sfcnn model on two test sets (CASF-2016 and CASF-2013 datasets), training set, and validation set

Comparison with other scoring functions evaluated on the CASF-2016 benchmark

Sfcnn and other scoring functions were also compared in terms of their abilities relating to scoring powers for predicting protein–ligand binding affinities using the CASF-2016 dataset. Table 3 shows the R and SD values given by Sfcnn and the top 10 scoring functions tested on the CASF-2016 benchmark by Su et al. [14]. As shown in Table 3, the Sfcnn model ranked 2nd among the 11 scoring functions. Among the top 10 scoring functions of CASF-2016, only ΔvinaRF20 [33] is based on machine learning, while the others could all be classified into conventional scoring functions based on physics, empirical, or knowledge. The best performing X-score in conventional scoring functions achieves R = 0.631 and SD = 1.69, while our Sfcnn model achieved R = 0.792 and SD = 1.32, indicating that Sfcnn performed significantly better than all conventional scoring functions for scoring power. However, the Sfcnn model was still a little worse than ΔvinaRF20 which achieved R = 0.816 and SD = 1.26 for scoring power. The performances of Sfcnn and ΔvinaRF20 were further compared on the CASF-2013 benchmark [21]. ΔvinaRF20 only achieved R = 0.646 on the CASF-2013 dataset as reported by Wang et al. [33]. This performance was significantly worse than that of Sfcnn, which achieved R = 0.7946 on CASF-2013 (Table 3).

Table 3 Comparison between Sfcnn and the top 10 scoring functions tested on the CASF-2016 benchmark

Why were the performances of Sfcnn and ΔvinaRF20 different when using the CASF-2016 and CASF-2013 datasets? We suspect that there may be some overlaps between the CASF-2016 test set and the training set used for ΔvinaRF20. As reported by Wang et al. [33], the main training set of ΔvinaRF20 was the v2014 refined set [34] from the PDBbind database, after removal of the overlaps with the CASF-2007 [35] and CASF-2013 [21] datasets, which were the test sets used in the study of ΔvinaRF20. We collected the v2014 refined set, CASF-2007 dataset, and CASF-2013 dataset from the PDBbind database. Then any structure in the CASF-2007 and CASF-2013 datasets was excluded from the v2014 refined set to get the main training set of ΔvinaRF20 named refined-2014*. There were 140 complexes present in both the refined-2014* and the CASF-2016 dataset (Additional file 1: Fig. S2), suggesting that the performance of ΔvinaRF20 on the CASF-2016 dataset was falsely high. According to the performances observed for Sfcnn and ΔvinaRF20 on the CASF-2013 dataset, the scoring power of Sfcnn was still better than that of ΔvinaRF20, and the Sfcnn model demonstrated a highly excellent performance when predicting the binding ability of proteins and ligands.

Evaluating the performance on CASF-2013, CSAR_HiQ_NRC_set and Astex_diverse_set

To further, and fairly, evaluate the performance of Sfcnn, some additional scoring functions were applied including DeepBindRG, AutoDockVina, and Pafnucy for comparison. Both DeepBindRG and Pafnucy were based on deep learning and showed excellent performance with regards to scoring power. AutoDockVina is a very popular docking software, and its scoring function is based on empirical. Additionally, some extra independent test datasets were tested including the CASF-2013 dataset, the Astex_diverse_set, and the CASR_HiQ_NRC_set to evaluate the scoring power of Sfcnn, DeepBindRG, AutoDockVina, and Pafnucy. The performance of these scoring functions on the three extra test datasets is presented in Table 4, using R, RMSE, and MAE values as performance indicators.

Table 4 Performance of Sfcnn, DeepBindRG, AutoDockVina, and Pafnucy on CASF-2013, CSAR_HiQ_NRC_set, and Astex_diverse_set datasets

For the performance of Pafnucy on CASF-2013, Stepniewska-Dziubinska et al. [12] reported that the R value of Pafnucy achieved R = 0.70, while Zhang et al. [36] reported it only achieved R = 0.5885. We have recalculated the performance of Pafnucy on the CASF-2013 dataset and found it was closer to the latter (R = 0.544 by our calculations), therefore we chose the Pafnucy performance tested by Zhang et al. [36] for comparison. As shown in Table 4, the performance of Sfcnn on CASF-2013 achieved R = 0.7946 and RMSE = 1.4518, and this performance was significantly better than that of the others.

On the full CSAR_HiQ_NRC_set, the R value of Sfcnn achieved 0.824. However, there were 194 complexes present in both the CSAR_HiQ_NRC_set and the training set for Sfcnn. Therefore, the Sfcnn performances were recalculated on the CSAR_HiQ_NRC_set after removal of the overlaps (represented by CSAR_HiQ_NRC_set* in Table 4), and the R value of Sfcnn decreased to 0.6758, which was still better than that of DeepBindRG and AutoDockVina. To assess the performance of Pafnucy on the CSAR_HiQ_NRC_set, the results calculated by us were adopted because there were also many overlaps between the CSAR_HiQ_NRC_set and the Pafnucy training set, and the study by Zhang et al. [36] did not give the real performance levels of Pafnucy following removal of the overlaps from the CSAR_HiQ_NRC_set. As shown in Table 4, the R value of Pafnucy was 0.6693 but achieved 0.7040 after the overlaps were removed. This performance was a little better than that of the Sfcnn model. However, both the RMSE and MAE values of Pafnucy were higher than that of Sfcnn, suggesting that Sfcnn’s ability to predict the binding affinity was more stable. In general, DeepBindRG, Pafnucy, and Sfcnn displayed similar performances on the CSAR_HiQ_NRC_set, and they all showed better scoring powers than AutoDockVina. For the Astex_diverse_set, the performance of Sfcnn was significantly better than the others for the R, RMSE, and MAE values. Overall, the Sfcnn model performed well for two of three datasets and showed an excellent performance regarding predicting the binding affinity between a protein and ligand.

Taking into account that high structural and chemical similarity of the protein and ligand between training set complexes and test ones may overestimate the performance of scoring functions [37, 38], we further performed similarity test between training and test sets. Protein structural similarity was computed by TM-Score and ligand similarity was computed by RDkit’s [17, 39, 40]. Complexes with TM-Score of over 0.5 or 0.17 and ligand similarity of over 0.8 to the ones in training set were excluded from the test sets. As shown in Table 5, after excluding complexes with high structural and chemical similarity, the performance of Sfcnn still perform well on all test sets. Sfcnn still achieves an R value of over 0.77 on CASF-2016 and CASF-2013 datasets, maintaining a good performance. On CSAR_HiQ_NRC_set and Astex_diverse_set, the R value of Sfcnn still achieves an R value of over 0.6. Overall, after excluding complexes with high structural and chemical similarity, Sfcnn still maintains a good performance on all test sets, which may be related to the featurization method we have adopted. As in our featurization method, the input 4D tensor features will not be the same as long as the coordinates of the complexes are not identical.

Table 5 Performance of Sfcnn on CASF-2016, CASF-2013, CSAR_HiQ_NRC_set, and Astex_diverse_set datasets after excluding complexes with high structural and chemical similarity to the training set ones

Virtual screening performance on the CASF and DUD-E benchmarks

Docking power refers to the ability of a scoring function to identify the native ligand binding pose among computer generated decoys. We further tested the docking power of Sfcnn on CASF-2016 benchmark and assessed the ability of Sfcnn to identify those poses with a RMSD within 2 Å from the native one. The top one, top two and top three predictions of Sfcnn are 34%, 50.2% and 58.9% on the CASF-2016 benchmarks, respectively. This performance is far lower than the docking power of AutoDockVina, which is the best one tested by Su et al. [14], with a score of 90.2%, 95.8% and 97.2%. To the best of our knowledge, many ML-based scoring functions such as KDEEP, Pafnucy and AK-score [41] do not perform very well in terms of docking power, due to the lack of integration of non-binding data for training. But these scoring functions can be used in combination with AutoDockVina to re-score the pose identified by AutoDockVina to improve the success rate of virtual screening. In the virtual screening test of this study, we used Smina which is a fork of AutoDockVina to dock ligands to targets and then used Sfcnn to re-score these complexes. We first tested the virtual screening ability on the DUD-E benchmark. The DUD-E benchmark is a very popular and huge dataset with more than one million compounds, widely used for assessing virtual screening abilities of scoring functions and docking protocols. Due to computational resource limitations, we built a subset to evaluate the virtual screening ability of Sfcnn by randomly sampling the DUD-E dataset. In this subset, there were 20 active compounds and 1000 decoys for each target. We expected to identify the active ones from a total of 1020 small molecules by Sfcnn scoring function. As shown in Additional file 1: Table S2 and Fig. 4, the EF 5% and EF 0.5% for Sfcnn are significantly higher than that for Smina on this subset of DUD-E benchmark (Student’s test, p-value = 1.15e-06 and p-value = 9.74e-08, respectively), showing that Sfcnn has better virtual screening ability than Smina and AutoDockVina on this subset. However, there may be some decoys designed not against the actives on the subset, resulting in different distributions of actives and decoys on this subset and the whole DUD-E dataset. Therefore, the virtual screening result of Sfcnn in this study only illustrated its performance on a subset of DUD-E benchmark and this result may differ from the test result on the whole DUD-E benchmark. To remedy this deficiency, we further tested the virtual screening performance of Sfcnn on another smaller dataset. As shown in Additional file 1: Table S3 and Fig. 4, Sfcnn shows a virtual screening performance comparable to Smina On the CASF-2016 benchmark (Student’s test, p-value = 0.54 and p-value = 0.12, respectively). Overall, Sfcnn shows a good virtual screening performance.

Fig. 4
figure 4

Virtual screening performance of Sfcnn and Smina on CASF-2016 benchmark and a subset of DUD-E benchmark

Explainable 3D CNN model using grad-CAM

Gradient-weighted class activation mapping (Grad-CAM) [42] is a widely used technique for making any CNN-based models more transparent. It produces visual explanations and helps determine more about the model when performing detection or prediction work. We utilized this method to identify the hot spot areas of the input feature that play important roles in determining the output predicted score. In this work, the last convolutional layer and the output predicted score of the full model were used when applying Grad-CAM. Then the heatmap of the last convolutional layer was resized to the same size with the input feature, and subsequently visualized using Mayavi [43].

The example cases of Grad-CAM analysis on the protein–ligand complexes are illustrated in Fig. 5. Figure 5a and b show the structure of the hormone-bound human progesterone receptor complexed with progesterone from the training set (PDB ID: 1a28) [44]. As shown in Fig. 5a, the hot spot areas were mainly around the ligand, and the high activation area colored in purple was around the five-carbon ring of progesterone. This was consistent with the finding in Fig. 5b that there were strong hydrophobic interactions between the receptor and progesterone, suggesting that the hydrophobic interactions may play a dominant role in the binding of this protein to the ligand. Figure 5c and Fig. 5d depict the structure of HIV-1 protease complexed with a tripeptide inhibitor from the CASF-2016 test set (PDB ID: 1a30) [45]. As shown in Fig. 5c, the high activation areas colored in purple were around the Glu and Leu residues in the ligand. Meanwhile, the hydrogen bond had formed between ligand-Glu and protein-Asp29 and there were strong hydrophobic interactions between the protease and the Leu residue of the inhibitor, playing an important role in determining the binding affinity. Heatmaps of Grad-CAM analyses for the other convolutional layers are shown in Fig. S3 and Fig. S4. These examples showed that the features learned by convolutional layers are explainable, and they may represent the high dimensional information between the protein and ligand such as hydrophobic interactions and hydrogen bonds. Meanwhile, combining the CNN model with the Grad-CAM analysis may help identify the critical functional groups in determining the binding free energy between proteins and ligands.

Fig. 5
figure 5

Heatmaps of Grad-CAM analyses and presentations of input features. a Example of a protein–ligand complex whose PDB ID was 1a28 from the training set. b 2D protein–ligand interactions of 1a28. c Example of a protein–ligand complex whose PDB ID was 1a30 from the CASF-2016 test set. d 2D protein–ligand interactions of 1a30. In a and c, the red spheres represent oxygen atoms of the ligand, the orange spheres represent nitrogen atoms of the ligand, the yellow spheres represent carbon atoms of the ligand and the small blue spheres represent the atoms of the protein. Hydrogen atoms are not shown on the graph for viewing purposes. The heatmap is colored from cyan to purple. In b and d, the green dashed line indicates hydrogen bonds and the red arc areas indicate hydrophobic interactions. a and c were drawn by Mayavi. b and d were generated with LigPlot + [46]


In the present work, we designed a convenient and reversible feature engineering method and developed a scoring function “Sfcnn” based on a deep 3D convolutional neural network, to improve ligand binding affinity prediction. Sfcnn enables a very easy, fast, and accurate calculation of the binding free energies between proteins and ligands. It is also capable of handling almost any docking result, and any ligand, regardless of the type of atoms in the ligand. Meanwhile, the feature engineering method used in this study enables a good reversible conversion between spatial structure and numerical features. The reversibility facilitates the intelligent design of novel drugs but has rarely considered on other scoring functions. Although the feature engineering in the Sfcnn model has been greatly simplified, Sfcnn still performs comparably to scoring functions such as OnionNet and AGL on the CASF-2016 and CASF-2013 datasets. The accuracy of Sfcnn was also comparable with all scoring functions provided by the CASF-2016 dataset, and Sfcnn showed the best performance for scoring power. Meanwhile, the Sfcnn model was also comparable with DeepBindRG and Pafnucy, which are both based on deep learning in several extra independent datasets. Sfcnn performed well on two of the three datasets tested. For the remaining dataset, Sfcnn also showed a performance comparable with DeepBindRG and Pafnucy. Overall, Sfcnn has shown a fairly stable and accurate prediction performance by evaluating Sfcnn and other scoring functions on different datasets. In addition, the visual high-level features automatically learned by convolutional layers provided interpretability for the superior performance of Sfcnn and this method can also be used to optimize the lead compound and find optimal pose during docking. These results indicate the Sfcnn model is an excellent scoring function, and performs well in scoring power for accurately and stably predicting the binding affinities between proteins and ligands. The Sfcnn model will contribute towards improving the success rate of virtual screening, thus will accelerate the development of potential drugs or novel biologically active lead compounds.

Availability of data and materials

The source code, together with the preprocessing scripts, is available at



Computer-aided drug design


Machine learning


Convolutional neural network


Root mean squared error


Mean absolute error


Standard deviation


Scoring function based on deep 3D CNN


Enrichment factors


  1. Gomeni R, Bani M, D’Angeli C, Corsi M, Bye A. Computer-assisted drug development (CADD): an emerging technology for designing first-time-in-man and proof-of-concept studies from preclinical experiments. Eur J Pharm Sci. 2001;13(3):261–70.

    CAS  Article  Google Scholar 

  2. Chen P, Ke Y, Lu Y, Du Y, Li J, Yan H, et al. DLIGAND2: an improved knowledge-based energy function for protein-ligand interactions using the distance-scaled, finite, ideal-gas reference state. J Cheminform. 2019;11(1):52.

    Article  Google Scholar 

  3. Wang Z, Sun H, Yao X, Li D, Xu L, Li Y, et al. Comprehensive evaluation of ten docking programs on a diverse set of protein-ligand complexes: the prediction accuracy of sampling power and scoring power. Phys Chem Chem Phys. 2016;18(18):12964–75.

    CAS  Article  Google Scholar 

  4. Verdonk ML, Cole JC, Hartshorn MJ, Murray CW, Taylor RD. Improved protein-ligand docking using GOLD. Proteins. 2003;52(4):609–23.

    CAS  Article  Google Scholar 

  5. Trott O, Olson AJ. AutoDock Vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading. J Comput Chem. 2010;31(2):455–61.

    CAS  PubMed  PubMed Central  Google Scholar 

  6. Friesner RA, Banks JL, Murphy RB, Halgren TA, Klicic JJ, Mainz DT, et al. Glide: a new approach for rapid, accurate docking and scoring. 1. Method and assessment of docking accuracy. J Med Chem. 2004;47(7):1739–49.

    CAS  Article  Google Scholar 

  7. Jain AN. Scoring functions for protein-ligand docking. Curr Protein Pept Sci. 2006;7(5):407–20.

    CAS  Article  Google Scholar 

  8. Ballester PJ, Mitchell JB. A machine learning approach to predicting protein-ligand binding affinity with applications to molecular docking. Bioinformatics. 2010;26(9):1169–75.

    CAS  Article  Google Scholar 

  9. Durrant JD, McCammon JA. NNScore: a neural-network-based scoring function for the characterization of protein-ligand complexes. J Chem Inf Model. 2010;50(10):1865–71.

    CAS  Article  Google Scholar 

  10. Jimenez J, Skalic M, Martinez-Rosell G, De Fabritiis G. KDEEP: protein-ligand absolute binding affinity prediction via 3d-convolutional neural networks. J Chem Inf Model. 2018;58(2):287–96.

    CAS  Article  Google Scholar 

  11. Kundu I, Paul G, Banerjee R. A machine learning approach towards the prediction of protein–ligand binding affinity based on fundamental molecular properties. RSC Adv. 2018;8(22):12127–37.

    CAS  Article  Google Scholar 

  12. Stepniewska-Dziubinska MM, Zielenkiewicz P, Siedlecki P. Development and evaluation of a deep learning model for protein-ligand binding affinity prediction. Bioinformatics. 2018;34(21):3666–74.

    CAS  Article  Google Scholar 

  13. Zheng L, Fan J, Mu Y. OnionNet: a multiple-layer intermolecular-contact-based convolutional neural network for protein-ligand binding affinity prediction. ACS Omega. 2019;4(14):15956–65.

    CAS  Article  Google Scholar 

  14. Su M, Yang Q, Du Y, Feng G, Liu Z, Li Y, et al. Comparative assessment of scoring functions: the CASF-2016 update. J Chem Inf Model. 2019;59(2):895–913.

    CAS  Article  Google Scholar 

  15. Imrie F, Bradley AR, van der Schaar M, Deane CM. Protein family-specific models using deep neural networks and transfer learning improve virtual screening and highlight the need for more data. J Chem Inf Model. 2018;58(11):2319–30.

    CAS  Article  Google Scholar 

  16. Tsubaki M, Tomii K, Sese J. Compound-protein interaction prediction with end-to-end learning of neural networks for graphs and sequences. Bioinformatics. 2019;35(2):309–18.

    CAS  Article  Google Scholar 

  17. Francoeur PG, Masuda T, Sunseri J, Jia A, Iovanisci RB, Snyder I, et al. Three-dimensional convolutional neural networks and a cross-docked data set for structure-based drug design. J Chem Inf Model. 2020;60(9):4200–15.

    CAS  Article  Google Scholar 

  18. Wallach I, Dzamba M, Heifets A. AtomNet: A Deep Convolutional Neural Network for Bioactivity Prediction in Structure-based Drug Discovery arXiv. 2015; arXiv:1510.02855.

  19. Ragoza M, Hochuli J, Idrobo E, Sunseri J, Koes DR. Protein-ligand scoring with convolutional neural networks. J Chem Inf Model. 2017;57(4):942–57.

    CAS  Article  Google Scholar 

  20. Cang Z, Wei GW. Integration of element specific persistent homology and machine learning for protein-ligand binding affinity prediction. Int J Numer Method Biomed Eng. 2018;34(2):e2914.

    Article  Google Scholar 

  21. Li Y, Han L, Liu Z, Wang R. Comparative assessment of scoring functions on an updated benchmark: 2. Evaluation methods and general results. J Chem Inf Model. 2014;54(6):1717–36.

    CAS  Article  Google Scholar 

  22. Abadi M, Agarwal A, Barham P, Brevdo E, Chen Z, Citro C, et al. TensorFlow: Large-scale machine learning on heterogeneous systems. arXiv. 2016;arXiv:1603.04467.

  23. Liu Z, Su M, Han L, Liu J, Yang Q, Li Y, et al. Forging the basis for developing protein-ligand interaction scoring functions. Acc Chem Res. 2017;50(2):302–9.

    CAS  Article  Google Scholar 

  24. Dunbar JB Jr, Smith RD, Damm-Ganamet KL, Ahmed A, Esposito EX, Delproposto J, et al. CSAR data set release 2012: ligands, affinities, complexes, and docking decoys. J Chem Inf Model. 2013;53(8):1842–52.

    CAS  Article  Google Scholar 

  25. Hartshorn MJ, Verdonk ML, Chessari G, Brewerton SC, Mooij WT, Mortenson PN, et al. Diverse, high-quality test set for the validation of protein-ligand docking performance. J Med Chem. 2007;50(4):726–41.

    CAS  Article  Google Scholar 

  26. O’Boyle NM, Banck M, James CA, Morley C, Vandermeersch T, Hutchison GR. Open babel: an open chemical toolbox. J Cheminform. 2011;3:33.

    CAS  Article  Google Scholar 

  27. He K, Zhang XY, Ren SQ, Sun J. Deep residual learning for image recognition. arXiv. 2015; arXiv:1512.03385.

  28. Huang G, Liu Z, Maaten LVD, Weinberger KQ. Densely Connected Convolutional Networks. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 2017:2261-69

  29. Mysinger MM, Carchia M, Irwin JJ, Shoichet BK. Directory of useful decoys, enhanced (DUD-E): better ligands and decoys for better benchmarking. J Med Chem. 2012;55(14):6582–94.

    CAS  Article  Google Scholar 

  30. Koes DR, Baumgartner MP, Camacho CJ. Lessons learned in empirical scoring with smina from the CSAR 2011 benchmarking exercise. J Chem Inf Model. 2013;53(8):1893–904.

    CAS  Article  Google Scholar 

  31. Leckband DE, Israelachvili JN, Schmitt FJ, Knoll W. Long-range attraction and molecular rearrangements in receptor-ligand interactions. Science. 1992;255(5050):1419–21.

    CAS  Article  Google Scholar 

  32. Nguyen DD, Wei GW. AGL-score: algebraic graph learning score for protein-ligand binding scoring, ranking, docking, and screening. J Chem Inf Model. 2019;59(7):3291–304.

    CAS  Article  Google Scholar 

  33. Wang C, Zhang Y. Improving scoring-docking-screening powers of protein-ligand scoring functions using random forest. J Comput Chem. 2017;38(3):169–77.

    Article  Google Scholar 

  34. Liu Z, Li Y, Han L, Li J, Liu J, Zhao Z, et al. PDB-wide collection of binding data: current status of the PDBbind database. Bioinformatics. 2015;31(3):405–12.

    CAS  Article  Google Scholar 

  35. Cheng T, Li X, Li Y, Liu Z, Wang R. Comparative assessment of scoring functions on a diverse test set. J Chem Inf Model. 2009;49(4):1079–93.

    CAS  Article  Google Scholar 

  36. Zhang H, Liao L, Saravanan KM, Yin P, Wei Y. DeepBindRG: a deep learning based method for estimating effective protein-ligand affinity. PeerJ. 2019;7:e7362.

    Article  Google Scholar 

  37. Kadukova M, Machado KDS, Chacon P, Grudinin S. KORP-PL: a coarse-grained knowledge-based scoring function for protein-ligand interactions. Bioinformatics. 2021;37(7):943–50.

    CAS  Article  Google Scholar 

  38. Su M, Feng G, Liu Z, Li Y, Wang R. Tapping on the black box: how is the scoring power of a machine-learning scoring function dependent on the training set? J Chem Inf Model. 2020;60(3):1122–36.

    CAS  Article  Google Scholar 

  39. Landrum G. RDKit: Open-source cheminformatics. http://www.rdkitorg. 2006.

  40. Zhang Y, Skolnick J. Scoring function for automated assessment of protein structure template quality. Proteins. 2004;57(4):702–10.

    CAS  Article  Google Scholar 

  41. Kwon Y, Shin WH, Ko J, Lee J. AK-score: accurate protein-ligand binding affinity prediction using an ensemble of 3d-convolutional neural networks. Int J Mol Sci. 2020;21(22):8424.

    CAS  Article  Google Scholar 

  42. Selvaraju RR, Cogswell M, Das A, Vedantam R, Parikh D, Batra D. Grad-CAM: visual explanations from deep networks via gradient-based localization. Int J Comput Vision. 2020;128(2):336–59.

    Article  Google Scholar 

  43. Ramachandran P, Varoquaux G. Mayavi: 3D visualization of scientific data. In: IEEE Computing in Science & Engineering. 2011;13(2):40-51.

  44. Williams SP, Sigler PB. Atomic structure of progesterone complexed with its receptor. Nature. 1998;393(6683):392–6.

    CAS  Article  Google Scholar 

  45. Louis JM, Dyda F, Nashed NT, Kimmel AR, Davies DR. Hydrophilic peptides derived from the transframe region of Gag-Pol inhibit the HIV-1 protease. Biochemistry. 1998;37(8):2105–10.

    CAS  Article  Google Scholar 

  46. Laskowski RA, Swindells MB. LigPlot+: multiple ligand-protein interaction diagrams for drug discovery. J Chem Inf Model. 2011;51(10):2778–86.

    CAS  Article  Google Scholar 

Download references


The authors would like to thank Dr. Yinghong Li for his valuable comments on this article. The authors would also like to express their gratitude to EditSprings for the expert linguistic services provided.


The study was supported by National Natural Science Foundation of China (Grant No. 61901072), Natural Science Foundation of Chongqing (Grant No. cstc2019jcyj-msxmX0250 and Grant No. cstc2019jcyj-msxmX0271) and Chongqing Education Commission Foundation (Grant No. KJQN201800620).

Author information

Authors and Affiliations



YW conceived of and designed the study. YW and ZW performed the experiments and data analysis. YW and ZW wrote the paper. LX revised the manuscript. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Yu Wang.

Ethics declarations

Ethics approval and consent to participate

Not applicable.

Consent for publication

Not applicable.

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary Information

Additional file1:

Table S1. The atomic types used in this study. Table S2. 5% and 0.5% enrichment factors computed on the DUD-E benchmark for Sfcnn and Smina. Table S3. 5% and 0.5% enrichment factors computed on the CASF benchmark for Sfcnn and Smina. Fig. S1. The error of the Sfcnn model on training and validation sets during learning. Fig. S2. The overlaps between CASF-2016 and refined-2014* datasets. Fig. S3. Grad-CAM analyses of other convolutional layers for 1a28. The heatmap is colored from cyan to purple. The heatmap of Conv layer 3 does not contain positive activation area. Fig. S4. Grad-CAM analyses of other convolutional layers for 1a30. The heatmap is colored from cyan to purple.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit The Creative Commons Public Domain Dedication waiver ( applies to the data made available in this article, unless otherwise stated in a credit line to the data.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wang, Y., Wei, Z. & Xi, L. Sfcnn: a novel scoring function based on 3D convolutional neural network for accurate and stable protein–ligand affinity prediction. BMC Bioinformatics 23, 222 (2022).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI:


  • Scoring function
  • Protein–ligand binding affinity
  • Convolutional neural network
  • Sfcnn