Article | Open | Published:

# iDTI-ESBoost: Identification of Drug Target Interaction Using Evolutionary and Structural Features with Boosting

Scientific Reportsvolume 7, Article number: 17731 (2017) | Download Citation

## Abstract

Prediction of new drug-target interactions is critically important as it can lead the researchers to find new uses for old drugs and to disclose their therapeutic profiles or side effects. However, experimental prediction of drug-target interactions is expensive and time-consuming. As a result, computational methods for predictioning new drug-target interactions have gained a tremendous interest in recent times. Here we present iDTI-ESBoost, a prediction model for identification of drug-target interactions using evolutionary and structural features. Our proposed method uses a novel data balancing and boosting technique to predict drug-target interaction. On four benchmark datasets taken from a gold standard data, iDTI-ESBoost outperforms the state-of-the-art methods in terms of area under receiver operating characteristic (auROC) curve. iDTI-ESBoost also outperforms the latest and the best-performing method found in the literature in terms of area under precision recall (auPR) curve. This is significant as auPR curves are argued as suitable metric for comparison for imbalanced datasets similar to the one studied here. Our reported results show the effectiveness of the classifier, balancing methods and the novel features incorporated in iDTI-ESBoost. iDTI-ESBoost is a novel prediction method that has for the first time exploited the structural features along with the evolutionary features to predict drug-protein interactions. We believe the excellent performance of iDTI-ESBoost both in terms of auROC and auPR would motivate the researchers and practitioners to use it to predict drug-target interactions. To facilitate that, iDTI-ESBoost is implemented and made publicly available at: http://farshidrayhan.pythonanywhere.com/iDTI-ESBoost/.

## Introduction

Targeted drug design is one of the key techniques in therapeutic drug discovery1. Prediction of new drug target interactions can help researchers to find new uses for old drugs and to discover their therapeutic profiles or side effects2,3,4. Since experimental prediction of drug-target interaction is expensive and time-consuming, computational methods have been gaining increasing popularity in recent years5,6.

During the past two decades, a wide range of computational approaches such as ligand-based methods7,8, target or receptor based methods9,10, gene ontology based methods11, literature text mining methods12,13 have been proposed to address the drug-target interaction. The performance and effectiveness of the ligand-based methods degrade due to the decrease in the the number of known ligands of a target protein. Receptor based methods often use docking simulation14 and heavily rely on the available three dimensional native structure of the protein targets. It is important to note that finding three-dimensional structures of the proteins is by it self is a costly and time-consuming task which is done using experimental methods such as NMR and X-ray Crystallography. Moreover, three dimensional structures are very difficult to predict for ion channel proteins and G-protein coupled receptors (GPCRs). In addition, the tremendous growth in the Biomedical literature has increased the redundancy problem of the compound names or the gene names and has been the main obstacle for literature based systematic text mining methods.

Recently, chemo-genomic methods15 have been attempted to identify drug-target interactions. This type of methods are mainly based on machine learning16,17, graph theory18,19 and network methods20,21. In the literature of the supervised learning setting, several classification algorithms have been found to be applied for this task. Examples include support vector machine22,23, deep learning24, fuzzy logic25, and nearest neighbor26. Yamanishi et al.16 first proposed a mechanism to formalize the inference of the drug–target identification as a supervised learning problem. In that pioneering work, they also proposed a gold standard dataset that had been later used extensively in the literature22,24,27. In a subsequent work, the same authors27 explored the association among pharmacological space and chemical space with the network topology of drug-target interactions and applied distance-based learning. Wang et al. proposed RLS-KF28 that uses regularized least squares method integrated with nonlinear kernel fusion. Drug-based similarity inference (DBSI) was proposed in21 utilizing two dimensional chemical structural similarity. Another method, KBMF2K, was proposed in29 that used chemical and genomic kernels and bayesian matrix factorization. Later on other noteworthy methods such as NetCBP30, DASPfind31, SELF-BLM23 have been proposed to solve thi sproblem. Recently22 used bigram based features extracted from Position Specific Scoring Matrix (PSSM) as molecular fingerprint to tackle this problem.

Since the three dimensional native structure of most of the protein targets are not available, most of the supervised learning methods in the literature do not exploit the structure based features. Huang et al.32 used extremely randomized trees model and represented the proteins as pseudo substitution matrix generated from its amino acid sequence information and the drugs as moelcular fingerprint. In another recent work, Wang et al.33 explored PSSM based features and drug fingerprints and used rotation forest based predictor. Among other recent works are similarity based method used by Yuan et al.34, self organizing theory used by Duran et al.35,36 and ensemble method used by Ezzat et al.37,38. Recently, a comprehensive literature review on the computational methods in drug-target interaction prediction was conducted by Chen et al.39.

In this paper, we present iDTI-ESBoost, a method for identification of Drug Target Interaction Using Evolutionary and Structural Information with Boosting. We exploit the structural features along with the evolutionary features to predict drug-protein interactions. Our work was inspired due to the modern successful secondary structural prediction tools like SPIDER240,41 and its use to generate features in supervised learning and classification42,43. Our proposed method uses a novel set of features extracted using structural information along with the evolutionary features and molecular fingerprints of drugs. To handle the large amount of imbalance in the data, we propose a novel balancing method and use it along with a boosting algorithm. As a result, iDTI-ESBoost has shown to be superior due to its prediction results on a widely used gold standard data set compared to the other existing methods found in the literature. Our method is publicly available to use at: http://farshidrayhan.pythonanywhere.com/iDTI-ESBoost/.

The rest of the paper is organised as follows which is suggested in44: description of dataset, formulation of statistical samples, selection and development of a powerful classification algorithm, demonstration of the performance of the predictor using cross-validation, implementation of web server followed by a conclusion.

## Results and Discussion

In this section, we present the results of our experiments. All the methods were implemented in Python language using Python3.4 version and Scikit-learn library45 of Python was used for the implementation of the machine learning algorithms. All experiments were conducted on a Computing Machine hosted by CITS, United International University. Also, each of the experiments was carried out 5 times and the average of the results is reported. We perform several types of experiments. In particular, we conduct four different sets of experiments as follows. First we investigate effectiveness and applicability of the different feature groups as mentioned in Table 1. Note that, in Table 1, four different feature groups, namely, A, B, C and D, were formed. Secondly, we investigate the effectiveness of the classifiers used in our research. Subsequently, we investigate the effectiveness of the balancing methods applied on our highly imbalanced datasets. Finally, we compare iDTI-ESBoost against the state-of-the-art methods found in the literature.

### Effectiveness of Feature Groups

We created four different feature groups to see the effects of the different sets of features on the classifier performance. The feature groups have already been reported in Table 1. Group A contains 1281 features and was previously used in22. We further added other groups, namely, B, C and D, incrementally in that order with the base feature group i.e., Group A and achieve features of size 1293, 1403 and 1476, respectively. We have performed two sets of experiments to test the effectiveness of the feature groups. In both of these experiments we changed the feature groups and used different classifiers and applied different balancing methods on the data to analyze the effect. Results of these experiments are reported respectively in Tables 2 and 3.

Table 2 reports the performance of three different classifiers on the four datasets during our experiments. In this step, we have produced the results for different combination of feature groups by adding them in a forward selection scheme by sorting them based on their individual performance for Nuclear Receptors. For the Nuclear Receptors, the best results achieved using Feature group A, and followed by B, C, and D, consequently. We used the individual performance for Nuclear Receptors as it produced the most distinguished performance for different input feature group. Therefore, we first evaluate the performance using feature group A, then added B, C, and finally D, sequentially. We have produced the results for each feature group as well as different combination of these feature gorups based on sequential forward selection. These results are available and provided as a supplementary material (Supplementary File 1).

Note that, though this experiment was intended for classifier selection, we clearly see that the best results in terms of auPR and auROC were found only when the structural features were added. For enzymes dataset, the best result in terms of auPR was 0.66 found with the combination A, B, C which is using structural composition and structural auto-covariance groups with PSSM-bigram and molecular fingerprint based features. This result is slightly better than the case when we use all the features A, B, C, D and get auPR of 0.66. In terms of auROC, the results are somewhat comparable to each other; however, the best result is achieved when all the four feature groups are used together. Thus enzyme dataset shows the effectiveness of structural information based features. Using iDTI-ESBoost for ion channels and GPCRs datasets we attain similar performance in terms of auPR. However it achieved highest auPR value when only the composition features (Group B) were added with the base features for Nuclear receptors dataset. The increase in the value of auROC clearly reveals the effectiveness of the structural features (Groups B, C, D) when added to the base feature (Group A).

As it is shown in Table 2, due to differences in the explored problems in this study, the results for different combination of feature groups, and different classifiers are not fully consistent. However, The aim of this experiment is to compare and analyse the performance of our method with respect to different combination of feature groups and different problems and find the best combination for that given specific problem. By conducting this comprehensive comparison, we are able to find the best classifier among those that we investigated here with respect to the combination of feature groups that we studied for a given problem.

The next set of experiments were run to show the performance of different balancing or under sampling methods in the training data using various feature groups. These results are shown in Table 3. These experiments were run using the AdaBoost classifier. The results in Table 3 clearly shows that for all the datasets, the best results in terms of auPR and auROC were found when structural features have been added. In case of the GPCRs, the auPR was found to be the highest at 0.5 when three feature groups, namely, Groups A, B, and C have been combined. Apart from this, in all other datasets, the combination of all four groups has shown superior performance both in terms of auPR and auROC. Our hypothesis that the added structural features play a significantly important role in the prediction of drug-target interaction is thus justified according to these experiments.

### Effectiveness of the AdaBoost Classifier

To test and select the suitable classifier for our problem, we test three different classifiers namely, AdaBoost ensemble classifier46 with decision tree as its weak learner, Random Forest47 and Support Vector Machines (SVM)48. For these experiments, we used random under sampling as the balancing method. As features, four different combinations were used as has been mentioned already. The results in terms of auPR and auROC are presented in Table 2. Here for each of the datasets and feature groups combinations bold faced values in the table represents the highest values achieved for that combination. It is evident that except for one case in the enzymes dataset, AdaBoost classifier has shown superior performance in terms of auPR across all feature groups combinations. It is also worth-noting that for all datasets, the highest auPR value was achieved by AdaBoost. The precision-recall curves for these experiments across all feature groups combinations are illustrated in Fig. 1.

In case of the ROC curves, achieved results are also in support of the selection of AdaBoost as a classifier. AdaBoost provides the highest auROC values for all the four datasets and it gives better auROC values for 11 out of 16 dataset-feature groups combinations. In other cases, SVM has achieved the highest auROC values, but only marginally so. The ROC curves for different classifiers across all feature groups combinations are illustrated in Fig. 2.

Considering the values of auPR and auROC curves on different datasets as shown in Table 2 and illustrated through the curves in Figs 1 and 2, we select AdaBoost as the classifier for iDTI-ESBoost. Note that, because of the huge imbalance in the datasets, with positive samples being much lower than the negative ones, the auPR curve is more important compared to the auROC curve and AdaBoost clearly outperforms the other two classifiers in terms of auPR values.

### Effectiveness of the Balancing Methods

The next set of experiments were run to test the effectiveness of the two different sampling methods on the datasets. The parameters used with AdaBoost classifier for random and cluster based under sampling are reported in Table 4.

For each of the datasets, we used four feature group combinations and used random and cluster based under sampling and report auPR and auROC values from cross-validation experiments in Table 3. We also show the ROC curves and auPR curves for all four datasets using all the features in Figs 3 and 4.

From the results reported in Table 3, it is worth-mentioning that in terms of auPR for all four datasets, cluster based sampling significantly outperforms random under sampling method. However, in terms of auROC curve, random sampling is slightly better than cluster based sampling in enzymes and ion channel datasets but the situation is in favor of cluster based sampling in GPCRs and nuclear receptors where it outperforms the random sampling method.

We have also analyzed the effect of the imbalance ratio of the four datasets with the different balancing methods used in this paper. Note that the performance of the random sampling and clustered sampling are similar in terms of auPR in the dataset enzymes with higher imbalance ratio. The performance drustically falls for random sampling for the nuclear receptor dataset which have the lowest imbalance ratio. In case of the other two datasets ion channels and GPCRs, though their imbalance ratio is similar the difference in the auPR resutls differ significantly for these two balancing methods. Thus we can not conclude any correlation of imbalance ratio with that of the performance of the balacning methods. Rather the number of instances seems to affect the performance of the balancing methods. Enzymes and ion channels datasets with larger number of samples seems to favor random sampling and relatively smaller datasets GPCRs and nuclear receptors produces best resutls when using clustered sampling.

### Comparison with Other Methods

Since the pioneering work of Yamanishi et al.16, many supervised learning methods have been applied to predict drug-target interactions on these standard benchmark gold standard datasets. However, a few of these methods24,28 do not use cross validation techniques and others3,23 do not use the same standard datasets. Our method uses molecular fingerprints and evolutionary and structural features for this supervised classification problem. Similar methods, albeit without utilizing the structural features and balancing techniques are reported in22,49. Most of the papers in the literature have used auROC curve as the main evaluation metric. We have compared the performance of our method on these four datasets with that of DBSI21, KBMF2K29, NetCBP30, Yamanishi et al.16, Yamanishi et al.27, Wang et al.18 and Mousavian et al.22 using auROC. The auROC values for all these methods along with iDTI-ESBoost are reported in Table 5.

From the values shown in bold in Table 5, we see that for all the datasets iDTI-ESBoost is able to significantly outperform all other previous state-of-the-art methods in terms of auROC. All the auROC values are greater than 90% which indicates the effectiveness of the classifier, balancing methods and the novel features proposed in this paper.

Moreover, in22 the authors argued in favor of auPR curve as a measure of evaluating the performance of classifiers for skewed datasets, especially in drug-target interaction where negative samples outnumber the positive samples. This argument does have merit as, logically, a mis-classification of positive samples or false negative should be more penalized in the score. To compare the performance in terms of auPR among iDTI-ESBoost with that in22, we reported the auPR values of the two predictors in Table 6. The results clearly shows that our method iDTI-ESBoost outperforms the predictor in22 in terms of auPR as well.

In Table 7, we report specificity, sensitivity, precision, MCC and F1-Score for four datasets using different feature group combinations as achieved by iDTI-ESBoost in experiments. Specificity and sensitivity are very high as reported in this table.

### Predicting New Interactions

In addition to these, we have analyzed the results produced by the classification algorithm. From the false negatives predicted by iDTI-ESBoost, we noticed that there are a number of false negatives for which the prediction probability is very high for it to be considered as a negative sample. Similar approaches were adopted in16,27. In this paper, we suggest that the false negative interactions which are labeled as positive by our method with a very high prediction probability could be potential candidates for finding new positive interactions. A list of such interactions for four group of targets are given in Table 8. Ten interactions are reported for each of the datasets with highest prediction probability.

### Web Server Implementation

We have also implemented our method as shown in Fig. 5 as a separate web server. The web server is freely available to use at: http://farshidrayhan.pythonanywhere.com/iDTI-ESBoost/. The mechanism of the web-server is very simple. We also provide the pre-learned models for each of the datasets. The interface of the web server is easy to use. It requires an user first to select the target group and provide the PSSM and SPD files for the target protein. These files can be easily generated by PSI-BLAST and SPIDER2 software using their online available tools.

To specify drug, one can select from a drop down list. The drugs are pre-fetched in our system from KEGG website. After selecting the drug and specifying target files, one can click the prediction button to find the prediction for that drug-target pair. The web-server also have a simple page with easy to-use instructions. We have made all the code and programs necessary for implementation of this paper freely available at: https://github.com/farshidrayhanuiu/iDTI-ESBoost to facilitate the use of the other users.

## Materials and Methods

In this section, we provide the detail information of the benchmark datasets, feature extraction and balancing methods, classifiers and evaluation metrics used in this study. Figure 5 depicts the training module of our proposed method, iDTI-ESBoost. The training dataset of iDTI-ESBoost contains both interacting (positive) and non-interacting drug-target pairs. For each instance of drug-target pair, a drug is searched in the DrugBank database50 to fetch the drug chemical structure in SMILES format. Similarly, a target protein sequence is first fetched from KEGG database51 and then fed to SPIDER240,41 and PSI-BLAST52 in order to receive, respectively, structural information as an SPD file and position specific scoring matrix (PSSM) based profile containing evolutionary information. A feature extraction module then uses these files to generate three types of features: drug molecular fingerprints, PSSM bigram and structural features based on the output of the secondary structure prediction software namely SPIDER2. Features generated in this phase is then fed to an AdaBoost classifier that learns the model for prediction purposes.

The prediction module is very similar to that of the training module shown in Fig. 5. For prediction, a query drug-target pair is fed to the system in a similar way to extract three types of features and then the trained and stored model is used to predict whether the given drug-target pair is interacting or non-interacting.

### Drug-target Interaction Datasets

In this paper, we have used the gold standard datasets introduced by Yamanishi et al. in16. These datasets are publicly available at: http://web.kuicr.kyoto-u.ac.jp/supp/yoshi/drugtarget/. Yamanishi et al. used DrugBank53, KEGG BRITE54, BRENDA55 and SuperTarget56 to extract information about drug-target interactions. They used the known drugs to four types of protein targets, namely, enzymes, ion channels, g-protein coupled receptors (GPCRs) and nuclear receptors. The number of target proteins in these groups are 664, 204, 95 and 26, respectively that interact with 445, 210, 223 and 54 drugs through 2926, 1476, 635 and 90 known interactions, respectively. A brief summary of these datasets are given in Table 9. These benchmark datasets have been used in many studies in the literature21,22,24,27 and are referred to as the ‘gold’ standard.

### Graph Construction from the Dataset

Based on the interactions of four types of proteins with known drugs, we build positive and negative samples for each dataset using a method similar to the one used in22 as follows. The drug-target interaction network for each dataset is a bipartite graph, G = (V, E), where the set of vertices is $$V=D\cup T$$ such that D is the set of drugs and T is the set of targets, $$D\cap T=\varnothing$$ and the set of edges is E. Here, any edge e = (d, t) $$\in$$E denotes an interaction only between a drug, d$$\in$$D with a protein target, t$$\in$$T. Now, for a particular graph from a dataset, all the known interactions in the graph represented by its edges are considered to be positive samples and the non-existent edges are taken as negative samples. Note that, here, non-existent edges refer to the possible valid edges only that are not there; i.e., they do not include edges among the vertices of the same partite set. Formally, a dataset is an union of positive and negative sets as follows:

$${\mathbb{S}}={{\mathbb{S}}}^{+}\cup {{\mathbb{S}}}^{-}$$
(1)

Here, $${{\mathbb{S}}}^{+}=\{(u,v):u\in D,v\in T,(u,v)\in E\}$$, and $${{\mathbb{S}}}^{-}=\{(u,v):u\in D,v\in T,(u,v)\notin E\}$$. For example, in the nuclear receptor, there are 54 drugs and 26 proteins with possible 54 × 26 = 1404 interactions. Since 90 interactions are known, these are treated to be positive and the rest 1314 as negative. The same procedure was followed for each of the datasets. As expected, the constructed datasets using this technique are imbalanced as the number of negative samples far outnumbers that of positive samples. This issue is attended to later by applying some balancing techniques. The majority class is the class denoting negative interaction. We define imbalance ratio as the number of instances in the majority class to the number of instances in the minority class. The imbalance ratio of each of the datasets used in this paper is reported in Table 9. Note that the enzymes dataset is with highest imbalance ratio near 100 and nuclear receptor dataset has got the lowest imbalance ratio.

### Feature Extraction

A dataset constructed in this way has drug-target pairs as instances. In the feature extraction phase, a drug identifier is looked up in the KEGG databased54 and the corresponding SMILES format is downloaded from the DrugBank database50. The features based on drugs are generated using this SMILES data.

Similarly, a protein target of each pair is first searched within the KEGG database54 to fetch the protein sequence. This protein sequence is then fed to two different software: Position Specific Iterated BLAST (PSI-BLAST)52 to fetch evolutionary profile based Position Specific Scoring Matrix (PSSM) and a secondary structure prediction tool called SPIDER240,41 to generate SPD files that contains the structural information. Three groups of features are extracted using these three files. The details are described in the rest of this section.

#### SMILES Based Features

Several descriptors are used to represent the features or properties of drug compounds57. To this end, one of the most popular features is molecular fingerprints which is widely used for similarity searching58, clustering59, and classification22. Each drug compound is represented by 881 chemical substructures defined in PubChem database60. The presence (absence) of a particular substructure is encoded as 1 (0). Thus the length of this molecular fingerprint based feature is 881. We used the rcdk package of R61 to extract these molecular fingerprints based features.

#### PSSM Based Features

We used the PSSM matrix returned by the PSI-BLAST software to generate evolutionary features from the protein target sequences. Each PSSM file contains a PSSM matrix that is constructed after multiple sequence alignment using the non redundant (NR) database. The PSSM file contains a matrix M of dimension L × 20, where L is the length of the protein and each of the entries in this matrix, m ij , represents the probability of substitution of the j-th amino acid in the i-th location of the given protein sequence. We first convert this matrix M to a normalized matrix using a normalization technique similar to that proposed in62,63. The dimension of this matrix is same as the original matrix M. After that we generate PSSM-bigram features using the following equation:

$$\mathrm{PSSM} \mbox{-} \mathrm{bigram}(k,l)=\frac{1}{L}\,\sum _{i=1}^{L-1}\,{N}_{i,k}{N}_{i+\mathrm{1,}l}\,(1\le k\le 20,1\le l\le 20)$$
(2)

Bigram features for PSSM were first proposed in64 and subsequently used successfully in drug-target interaction prediction in22. Total number of features generated using this method is 400.

#### Structure Based Features

The traditional drug discovery is a lock-key problem, where the lock is the target. The structure of the target thus plays a very important role in traditional drug discovery and is at the center of the docking based software. We make a hypothesis that even if the full structure is not present for the targets, estimated structural properties still can play an important role in drug-target interaction prediction. Structural features are generated using the structural information generated and stored in SPD files by SPIDER2 software. The information generated by SPIDER2 are: accessible surface area (ASA), secondary structural (SS) motifs, torsional angles (TA) and structural probabilities (SP)65,66,67. Following features are generated using these information:

1. 1.

Secondary Structure Composition: This feature is the normalized count or frequency of the structural motifs present at the amino-acid residue positions. There are three types of motifs: α-helix (H), β-sheet (E) and random coil (C). SPIDER2 returns a vector SS of dimension L × 1 containing this information. Thus we can define this feature as following:

$$\mathrm{SS} \mbox{-} \mathrm{Composition}(i)=\frac{1}{L}\,\sum _{j=1}^{L}\,{c}_{ij},1\le i\le 3$$
(3)

Here, L is the length of the protein and

$${c}_{ij}=\{\begin{array}{ll}1, & {\rm{if}}\,S{S}_{j}={f}_{i}\\ 0, & {\rm{else}}\end{array}$$

Here, SS j is the structural motif at position j of the protein sequence and f i is one of the 3 different motif symbols.

2. 2.

Accessible Surface Area Composition: The accessible surface area composition is the normalized sum of accessible surface area defined by:

$$\mathrm{ASA} \mbox{-} \mathrm{Composition}=\frac{1}{L}\,\sum _{i=1}^{L}\,ASA(i)$$
(4)

Here ASA is the vector of accessible surface area of dimension L × 1 containing the values of accessible surface area for all the amino acid residues.

3. 3.

Torsional Angles Composition: Four different types of torsional angles: φ, ψ, τ and θ are returned by SPIDER2 for each residue. First, we convert each of them into radians from degree angles and then take sign and cosine of the angles at each residue position. Thus we get a matrix of dimension L × 8. We denote this matrix by T. Torsional angles composition is defined as:

$$\mathrm{TA} \mbox{-} \mathrm{Composition}({\rm{k}})=\frac{1}{L}\,\sum _{i=1}^{L}\,{T}_{i,k}\,\mathrm{(1}\le k\le 8)$$
(5)
4. 4.

Torsional Angles Bigram: The Bigram for the torsional angles is similar to that of the PSSM matrix and is defined as:

$$\mathrm{TA} \mbox{-} \mathrm{bigram}(k,l)=\frac{1}{L}\,\sum _{i=1}^{L-1}\,{T}_{i,k}{T}_{i+1,l}\,\mathrm{(1}\le k\le 8,1\le l\le \mathrm{8)}$$
(6)
5. 5.

Structural Probabilities Bigram: Structural probabilities for each position of the amino-acid residue are given in the SPD2 file as a matrix of dimension L × 3, which we denote by P. The Bigram of the structural probabilities is similar to that of PSSM matrix and is defined as:

$$\mathrm{SP} \mbox{-} \mathrm{bigram}(k,l)=\frac{1}{L}\,\sum _{i=1}^{L-1}\,{P}_{i,k}{P}_{i+1,l}\,\mathrm{(1}\le k\le 3,1\le l\le \mathrm{3)}$$
(7)
6. 6.

Torsional Angles Auto-Covariance: This feature is also derived from the torsional angles and is defined as:

$$\mathrm{TA} \mbox{-} \mathrm{Auto} \mbox{-} \mathrm{Covariance}(k,j)=\frac{1}{L}\,\sum _{i=1}^{L-k}\,{T}_{i,j}{T}_{i+k,j}\,\mathrm{(1}\le j\le 8,1\le k\le DF)$$
(8)

This feature group depends on parameter DF which is the distance factor. In this study, we used DF = 10 and this value was selected for the parameter DF as it was shown as the most effective window size to extract features based on torsion angles and similar properties40,65,67,68.

7. 7.

Structural Probablities Auto-Covariance: This feature is also derived from the structural probabilities and is defined as:

$$\mathrm{SP} \mbox{-} \mathrm{Auto} \mbox{-} \mathrm{Covariance}(k,j)=\frac{1}{L}\,\sum _{i=1}^{L-k}\,{P}_{i,j}{P}_{i+k,j}\,\mathrm{(1}\le j\le 3,1\le k\le DF)$$
(9)

A brief summary of the three group of features derived from each drug-target pair is given in Table 1. Note that there are two types of features. Drug related features and target related features in four groups A, B, C and D.

### Balancing Methods

As it was specified earlier, our employed datasets are all imbalanced. Several sampling techniques in the literature have been employed to balance these data such as: random under sampling22, synthetic over sampling69, balanced random sampling (BRS)68,70, neighborhood cleaning rule71, and cluster based under sampling72,73. In this paper, we explore random under sampling (RUS) method as done previously for drug-target interaction prediction in22. We also propose a novel modified cluster based under sampling method based on73 as follows.

In this method, the dataset is first divided into two subsets as major class and minor class. In the major class k-means clustering is applied to divide the major class samples in k clusters while the minor class samples are kept unchanged. After that from the k clusters of major class samples, subsamples are chosen randomly to represent the entire major class. We denote this method as cluster based under sampling (CUS) throughout this paper. The random under sampling will be denoted as random under sampling (RUS). The pseudo-code for the CUS algorithm is given in Algorithm 1.

Our CUS algorithm depends on two parameters, namely, k and h. In our experiments, we have varied k for values from $$5\cdots 30$$ and found the the best performing value to be 23. However, more sophisticated clustering algorithms can be applied on this data. The role of the parameter h is to control the random under sampling of the clustered majority class samples. The details of the experimental results for selecting this hyper parameter h is given as supplementary material (Supplementary File 2).

### Description of the classifier

We have selected the adaptive boosting algorithm (AdaBoost)46 as our classification algorithm. Adaptive boosting is a meta or ensemble classifier that uses several weak learning algorithms or weak classifiers and improves over their performance. We choose decision tree classifiers as the weak classifiers. AdaBoost is a meta-classifier of the following form:

$$g=\sum _{t=1}^{T}\,{\alpha }_{t}{h}_{t}(x)$$
(10)

AdaBoost iteratively adds up a weak classifier h t (x) at each iteration of the algorithm weighted by α t where α t is the weight achieved from the error function ε t for the weak classifier h t (x) at iteration t. Each of these weak classifiers is chosen in a way so as to minimize the error on the training sample weighted by the distribution D t :

$${h}_{t}\in \mathop{argmin}\limits_{h\in H}\mathop{{\rm{\Pr }}}\limits_{i\sim {D}_{t}}\,[{h}_{t}(x)\ne {y}_{i}]=\mathop{argmin}\limits_{h\in H}\,\sum _{i=1}^{m}\,{D}_{t}\,{1}_{{h}_{t}(x)\ne {y}_{i}}$$
(11)

The algorithm of AdaBoost46 is sketched in Algorithm 2 following the notations of 74.

### Performance Evaluation

A large variety of performance metrics are used in the literature to compare the performance of supervised learning methods75. The gold datasets that are used in the literature of drug-target interaction prediction are largely imbalanced and the number of negative samples largely outnumbers that of the positive samples. Therefore, the typical measures like accuracy does not make much sense. Moreover, the output of the classifier generating probabilistic outputs depends on the thresholds or the values predicted by it for each of the predicting classes. In such cases, thresholds or values play an important role on the sensitivity and specificity of the classifiers. Two measures that are independent of the values or thresholds set for decision making are area under curve for Receiver Operating Characteristic (auROC) and area under precision recall curve (auPR). These two measures are widely used in the literature of drug-target interaction prediction22,24,30,76 and thus have become standard metrics for comparison.

Lets assume, P is the total number of positive samples in a dataset and N is the total number of negative samples in a dataset. Let TP denote the number of true positives, TN denote the number of true negatives, FN denote the number of false negatives and FP denote the number of false positives predicted by a classifier. True positives (negatives) are correctly classified positive (negative) samples by the classifier. Conversely, false positives (negatives) are negative (positive) samples incorrectly predicted as positives (negatives) by the classifier. Following these notions, we can define sensitivity or true positive rate as follows:

$$Sensitivity=\frac{TP}{TP+FN}$$
(12)

Therefore, sensitivity is the ratio of correctly predicted positive samples to the total number of positive samples. Precision is defined as the positive predictive rate (PPV) as follows:

$$Precision=\frac{TP}{TP+FP}$$
(13)

Therefore, precision shows the percentage of positive predictions by the classifiers that are accurate. Another important measure is specificity (SPC) or true negative rate defined as follows:

$$SPC=\frac{TN}{TN+FP}$$
(14)

Fall-out or false positive rate (FPR) is the ration of the number of wrongly classified negative instances to the total number of negative instances defined as follows:

$$FPR=\frac{FP}{FP+TN}=1-SPC$$
(15)

F1 Score is a statistical score based on precision and sensitivity and defined as follows:

$$F1=\frac{2TP}{2TP+FP+FN}$$
(16)

All theses performance measures have values within the range [$$0\cdots 1$$], 0 being the worst and 1 being the best.

Another score that is often used in comparison is called defined as follows:

$$MCC=\frac{(TP\times TN)-(FP\times FN)}{\sqrt{(TP+FP)\,(TP+FN)\,(TN+FP)\,(TN+FN)}}$$
(17)

Value of this coefficient ranges from −1 to +1, where +1 means a perfect predictor and −1 means a total disagreement.

Receiver operating characteristic (ROC) curve plots true positive rate or sensitivity against false positive rate or (1-specificity) at various threshold values. The performance of a predictor is calculated by the area under the ROC curve (auROC). A perfect classifier have a auROC value of 1 and a random classifier have a value of 0.5. However, for imbalanced datasets like ours, area under precision recall curve (auPR) is of more significance22 as follows: auPR curve plots the precision rate vs the recall rate at different threshold values. This score penalizes the false positives more as compared to auROC and thus more suitable for skewed datasets. The value of auPR ranges from 0 to 1 and the higher the value is the better.

It is very important to test the methods to check and balance the bias-variance trade-off77. Various methods of sampling are used to measure the performance of supervised learning algorithms78. Among them mostly used are k–fold cross validation and jack knife tests. Because of the high imbalance, dimensionality and cardinality of the datasets, in most of the methods in the literature, 5-fold cross validation have been preferred and used as the sampling method22,24,30,76. We also use the 5-fold cross validation to test our method for the sake of fair comparison with the other state-of-the-art methods.

In the 5-fold cross validations, first the dataset is randomly split into five equal parts retaining the ratio of imbalance in each split same to the original dataset. Each time one part of the dataset is used as test and the other four are used as training data. First the balancing techniques are applied to the training data (clustered or random) and then the classifier is used to train the data into a model. The stored model is used subsequently to predict the labels for the test data. Thus all the drug-target pairs in the datasets are used in testing the classifier performance using cross-validation. The measures reported are the average of all 5-fold results.

### Data and Material availability

All the data and materials used in this paper are available at: http://farshidrayhan.pythonanywhere.com/iDTI-ESBoost/.

## Conclusion

In this paper, we have presented iDTI-ESBoost, a novel method to predict and identify drug-target interactions. iDTI-ESBoost is unique in its exploitation of structural features along with the evolutionary features to predict drug-protein interactions. It also uses a novel balancing technique and a boosting technique. We have conducted extensive experiments to test and analyze the performance of iDTI-ESBoost. On four benchmark datasets known as the gold standard data in the literature, iDTI-ESBoost outperforms the state-of-the-art methods in terms of area under Receiver Operating Characteristic (auROC) curve.

Notably, the gold standard datasets used in the literature as benchmarks to analyze the performance of the methods for drug-target interactions prediction and identification are highly imbalanced with negative samples far outnumbering the positive samples. In the literature it has been argued that area under Precision Recall (auPR) curve is the most appropriate metric for comparison for such imbalanced datasets. To this end, iDTI-ESBoost also outperforms the latest and the best-performing method in the literature to-date in terms of area under precision recall (auPR) curve. We believe that the excellent performance of iDTI-ESBoost both in terms of auROC and auPR would motivate the researchers and practitioners to use it to predict drug-target interactions. To facilitate that, iDTI-ESBoost is publicly available for use at: http://farshidrayhan.pythonanywhere.com/iDTI-ESBoost/.

In addition of target proteins, there are some types of RNA molecules so called non-coding RNAs and ncRNAs which are not translated into proteins. These RNA molecules als can make a new class of drug targets. Recently, a new database called NRDTD has been developed to collect the experimentally validated associations between drugs and ncRNAs79. In the future, our aim is to use NRDTD database as a gold standard dataset for predicting new associations between drugs and ncRNAs which have not been experimentally verified. By replacing features of target proteins with a set of informative features for ncRNAs, which have been published in the literature, the model presented in this study can also be used for predicting drug-ncRNA interaction prediction.

## Additional information

Publisher's note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## References

1. 1.

Keiser, M. J. et al. Predicting new molecular targets for known drugs. Nat. 462, 175–181 (2009).

2. 2.

Cheng, F. et al. Prediction of polypharmacological profiles of drugs by the integration of chemical, side effect, and therapeutic space. J. chemical information modeling 53, 753–762 (2013).

3. 3.

Wu, Z. et al. Sdtnbi: an integrated network and chemoinformatics tool for systematic prediction of drug–target interactions and drug repositioning. Briefings bioinformatics 18, 333–347 (2017).

4. 4.

Campillos, M., Kuhn, M., Gavin, A.-C., Jensen, L. J. & Bork, P. Drug target identification using side-effect similarity. Sci. 321, 263–266 (2008).

5. 5.

Haggarty, S. J., Koeller, K. M., Wong, J. C., Butcher, R. A. & Schreiber, S. L. Multidimensional chemical genetic analysis of diversity-oriented synthesis-derived deacetylase inhibitors using cell-based assays. Chem. & biology 10, 383–396 (2003).

6. 6.

Kuruvilla, F. G., Shamji, A. F., Sternson, S. M., Hergenrother, P. J. & Schreiber, S. L. Dissecting glucose signalling with diversity-oriented synthesis and small-molecule microarrays. Nat. 416, 653–657 (2002).

7. 7.

Hopkins, A. L., Keserü, G. M., Leeson, P. D., Rees, D. C. & Reynolds, C. H. The role of ligand efficiency metrics in drug discovery. Nat. Rev. Drug Discov. 13, 105–121 (2014).

8. 8.

Keiser, M. J. et al. Relating protein pharmacology by ligand chemistry. Nat. biotechnology 25, 197–206 (2007).

9. 9.

Ma, D.-L., Chan, D. S.-H. & Leung, C.-H. Drug repositioning by structure-based virtual screening. Chem. Soc. Rev. 42, 2130–2141 (2013).

10. 10.

Pan, A. C., Borhani, D. W., Dror, R. O. & Shaw, D. E. Molecular determinants of drug–receptor binding kinetics. Drug discovery today 18, 667–673 (2013).

11. 11.

Mutowo, P. et al. A drug target slim: using gene ontology and gene ontology annotations to navigate protein-ligand target space in chembl. J. biomedical semantics 7, 59 (2016).

12. 12.

Plake, C. & Schroeder, M. Computational polypharmacology with text mining and ontologies. Curr. pharmaceutical biotechnology 12, 449–457 (2011).

13. 13.

Zhu, S., Okuno, Y., Tsujimoto, G. & Mamitsuka, H. A probabilistic model for mining implicit ‘chemical compound–gene’ relations from literature. Bioinforma. 21, ii245–ii251 (2005).

14. 14.

Morris, G. M. et al. Autodock4 and autodocktools4: Automated docking with selective receptor flexibility. J. computational chemistry 30, 2785–2791 (2009).

15. 15.

Mousavian, Z. & Masoudi-Nejad, A. Drug–target interaction prediction via chemogenomic space: learning-based methods. Expert. opinion on drug metabolism & toxicology 10, 1273–1287 (2014).

16. 16.

Yamanishi, Y., Araki, M., Gutteridge, A., Honda, W. & Kanehisa, M. Prediction of drug–target interaction networks from the integration of chemical and genomic spaces. Bioinforma. 24, i232–i240 (2008).

17. 17.

Bleakley, K. & Yamanishi, Y. Supervised prediction of drug–target interactions using bipartite local models. Bioinforma. 25, 2397–2403 (2009).

18. 18.

Wang, W., Yang, S. & Li, J. Drug target predictions based on heterogeneous graph inference. In Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing, 53. NIH Public Access (NIH Public Access, 2013).

19. 19.

Chen, X., Liu, M.-X. & Yan, G.-Y. Drug–target interaction prediction by random walk on the heterogeneous network. Mol. BioSystems 8, 1970–1978 (2012).

20. 20.

Alaimo, S., Pulvirenti, A., Giugno, R. & Ferro, A. Drug–target interaction prediction through domain-tuned network-based inference. Bioinforma. 29, 2004–2008 (2013).

21. 21.

Cheng, F. et al. Prediction of drug-target interactions and drug repositioning via network-based inference. PLoS Comput. Biol 8, e1002503 (2012).

22. 22.

Mousavian, Z., Khakabimamaghani, S., Kavousi, K. & Masoudi-Nejad, A. Drug–target interaction prediction from pssm based evolutionary information. J. pharmacological toxicological methods 78, 42–51 (2016).

23. 23.

Keum, J. & Nam, H. Self-blm: Prediction of drug-target interactions via self-training svm. PloS one 12, e0171839 (2017).

24. 24.

Chan, K. C., You, Z.-H. et al. Large-scale prediction of drug-target interactions from deep representations. In Neural Networks (IJCNN), 2016 International Joint Conference on, 1236–1243. IEEE (IEEE, 2016).

25. 25.

Xiao, X., Min, J.-L., Wang, P. & Chou, K.-C. icdi-psefpt: identify the channel–drug interaction in cellular networking with pseaac and molecular fingerprints. J. theoretical biology 337, 71–79 (2013).

26. 26.

He, Z. et al. Predicting drug-target interaction networks based on functional groups and biological features. PloS one 5, e9603 (2010).

27. 27.

Yamanishi, Y., Kotera, M., Kanehisa, M. & Goto, S. Drug-target interaction prediction from chemical, genomic and pharmacological data in an integrated framework. Bioinforma. 26, i246–i254 (2010).

28. 28.

Hao, M., Wang, Y. & Bryant, S. H. Improved prediction of drug-target interactions using regularized least squares integrating with kernel fusion technique. Anal. chimica acta 909, 41–50 (2016).

29. 29.

Gönen, M. Predicting drug–target interactions from chemical and genomic kernels using bayesian matrix factorization. Bioinforma. 28, 2304–2310 (2012).

30. 30.

Chen, H. & Zhang, Z. A semi-supervised method for drug-target interaction prediction with consistency in networks. PloS one 8, e62975 (2013).

31. 31.

Ba-Alawi, W., Soufan, O., Essack, M., Kalnis, P. & Bajic, V. B. Daspfind: new efficient method to predict drug–target interactions. J. cheminformatics 8, 15 (2016).

32. 32.

Huang, Y.-A., You, Z.-H. & Chen, X. A systematic prediction of drug-target interactions using molecular fingerprints and protein sequences. Curr. protein & peptide science (2016).

33. 33.

Wang, L. et al. Rfdt: A rotation forest-based predictor for predicting drug-target interactions using drug structure and protein sequence information. Curr. protein & peptide science (2016).

34. 34.

Yuan, Q. et al. Druge-rank: improving drug–target interaction prediction of new candidate drugs or targets by ensemble learning to rank. Bioinforma. 32, i18–i27 (2016).

35. 35.

Daminelli, S., Thomas, J. M., Durán, C. & Cannistraci, C. V. Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks. New J. Phys. 17, 113037 (2015).

36. 36.

Durán, C. et al. Pioneering topological methods for network-based drug–target prediction by exploiting a brain-network self-organization theory. Briefings Bioinforma. bbx041 (2017).

37. 37.

Ezzat, A., Wu, M., Li, X.-L. & Kwoh, C.-K. Drug-target interaction prediction via class imbalance-aware ensemble learning. BMC bioinformatics 17, 509 (2016).

38. 38.

Ezzat, A., Wu, M., Li, X.-L. & Kwoh, C.-K. Drug-target interaction prediction using ensemble learning and dimensionality reduction. Methods (2017).

39. 39.

Chen, X. et al. Drug–target interaction prediction: databases, web servers and computational models. Briefings bioinformatics 17, 696–712 (2015).

40. 40.

Heffernan, R. et al. Improving prediction of secondary structure, local backbone angles, and solvent accessible surface area of proteins by iterative deep learning. Sci. reports 5, 11476 (2015).

41. 41.

Yang, Y. et al. Spider2: A package to predict secondary structure, accessible surface area, and main-chain torsional angles by deep neural networks. Predict. Protein Second. Struct. 1484, 55–63 (2017).

42. 42.

López, Y. et al. Sucstruct: Prediction of succinylated lysine residues by using structural properties of amino acids. Anal. Biochem. 527 (2017).

43. 43.

Taherzadeh, G., Zhou, Y., Liew, A. W.-C. & Yang, Y. Structure-based prediction of protein-peptide binding regions using random forest. Bioinforma. btx614 (2017).

44. 44.

Chou, K.-C. Some remarks on protein attribute prediction and pseudo amino acid composition. J. theoretical biology 273, 236–247 (2011).

45. 45.

Pedregosa, F. et al. Scikit-learn: Machine learning in python. J. Mach. Learn. Res. 12, 2825–2830 (2011).

46. 46.

Freund, Y. & Schapire, R. E. A desicion-theoretic generalization of on-line learning and an application to boosting. In European conference on computational learning theory, 23–37. Springer (Springer, 1995).

47. 47.

Ho, T. K. The random subspace method for constructing decision forests. IEEE transactions on pattern analysis machine intelligence 20, 832–844 (1998).

48. 48.

Cortes, C. & Vapnik, V. Support-vector networks. Mach. learning 20, 273–297 (1995).

49. 49.

Nanni, L., Lumini, A. & Brahnam, S. A set of descriptors for identifying the protein–drug interaction in cellular networking. J. theoretical biology 359, 120–128 (2014).

50. 50.

Knox, C. et al. Drugbank 3.0: a comprehensive resource for ‘omics’ research on drugs. Nucleic acids research 39, D1035–D1041 (2011).

51. 51.

Kanehisa, M. & Goto, S. Kegg: kyoto encyclopedia of genes and genomes. Nucleic acids research 28, 27–30 (2000).

52. 52.

Altschul, S. F. et al. Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic acids research 25, 3389–3402 (1997).

53. 53.

Wishart, D. S. et al. Drugbank: a knowledgebase for drugs, drug actions and drug targets. Nucleic acids research 36, D901–D906 (2008).

54. 54.

Kanehisa, M. et al. Kegg for linking genomes to life and the environment. Nucleic acids research 36, D480–D484 (2008).

55. 55.

Schomburg, I. et al. Brenda, the enzyme database: updates and major new developments. Nucleic acids research 32, D431–D433 (2004).

56. 56.

Günther, S. et al. Supertarget and matador: resources for exploring drug-target relationships. Nucleic acids research 36, D919–D922 (2008).

57. 57.

Todeschini, R. & Consonni, V. Handbook of molecular descriptors, vol. 11 (John Wiley & Sons, 2008).

58. 58.

Tabei, Y. & Yamanishi, Y. Scalable prediction of compound-protein interactions using minwise hashing. BMC systems biology 7, S3 (2013).

59. 59.

Tabei, Y., Pauwels, E., Stoven, V., Takemoto, K. & Yamanishi, Y. Identification of chemogenomic features from drug–target interaction networks using interpretable classifiers. Bioinforma. 28, i487–i494 (2012).

60. 60.

Chen, B., Wild, D. & Guha, R. Pubchem as a source of polypharmacology. J. chemical information modeling 49, 2044–2055 (2009).

61. 61.

Guha, R. et al. Chemical informatics functionality in r. J. Stat. Softw. 18, 1–16 (2007).

62. 62.

Sharma, R. et al. Predict gram-positive and gram-negative subcellular localization via incorporating evolutionary information and physicochemical features into chou’s general pseaac. IEEE Transactions on NanoBioscience 14, 915–926 (2015).

63. 63.

Dehzangi, A. et al. Gram-positive and gram-negative protein subcellular localization by incorporating evolutionary-based descriptors into chou’s general pseaac. J. theoretical biology 364, 284–294 (2015).

64. 64.

Paliwal, K. K., Sharma, A., Lyons, J. & Dehzangi, A. A tri-gram based feature extraction technique using linear probabilities of position specific scoring matrix for protein fold recognition. IEEE Transactions on Nanobioscience 13, 44–50 (2014).

65. 65.

Heffernan, R. et al. Highly accurate sequence-based prediction of half-sphere exposures of amino acid residues in proteins. Bioinforma. 32, 843–849 (2015).

66. 66.

Lyons, J. et al. Predicting backbone cα angles and dihedrals from protein sequences by stacked sparse auto-encoder deep neural network. J. computational chemistry 35, 2040–2046 (2014).

67. 67.

Taherzadeh, G., Yang, Y., Zhang, T., Liew, A. W.-C. & Zhou, Y. Sequence-based prediction of protein–peptide binding sites using support vector machine. J. computational chemistry 37, 1223–1229 (2016).

68. 68.

Taherzadeh, G., Zhou, Y., Liew, A. W.-C. & Yang, Y. Sequence-based prediction of protein–carbohydrate binding sites using support vector machines. J. chemical information modeling 56, 2115–2122 (2016).

69. 69.

Chawla, N. V., Bowyer, K. W., Hall, L. O. & Kegelmeyer, W. P. Smote: synthetic minority over-sampling technique. J. artificial intelligence research 16, 321–357 (2002).

70. 70.

Yu, J. et al. Simple sequence-based kernels do not predict protein–protein interactions. Bioinforma. 26, 2610–2614 (2010).

71. 71.

Laurikkala, J. Improving identification of difficult small classes by balancing class distribution. In Conference on Artificial Intelligence in Medicine in Europe, 63–66. Springer (Springer, 2001).

72. 72.

Yen, S.-J. & Lee, Y.-S. Cluster-based under-sampling approaches for imbalanced data distributions. Expert. Syst. with Appl. 36, 5718–5727 (2009).

73. 73.

Rahman, M. M. & Davis, D. Cluster based under-sampling for unbalanced cardiovascular data. In Proceedings of the World Congress on Engineering, vol. 3, 3–5 (IAENG, 2013).

74. 74.

Mohri, M., Rostamizadeh, A. & Talwalkar, A. Foundations of machine learning (MIT press, 2012).

75. 75.

Powers, D. M. Evaluation: from precision, recall and f-measure to roc, informedness, markedness and correlation (2011).

76. 76.

Cao, D.-S. et al. Large-scale prediction of drug–target interactions using protein sequences and drug topological structures. Anal. chimica acta 752, 1–10 (2012).

77. 77.

Friedman, J. H. On bias, variance, 0/1—loss, and the curse-of-dimensionality. Data mining knowledge discovery 1, 55–77 (1997).

78. 78.

Efron, B. & Gong, G. A leisurely look at the bootstrap, the jackknife, and cross-validation. The Am. Stat. 37, 36–48 (1983).

79. 79.

Chen, X. et al. Nrdtd: a database for clinically or experimentally supported non-coding rnas and drug targets associations. Database 2017 (2017).

Download references

## Author information

### Affiliations

1. #### Department of Computuer Science and Engineering, United International University, House 80, Road 8A, Dhanmondi, Dhaka, 1209, Bangladesh

• Farshid Rayhan
• , Sajid Ahmed
• , Swakkhar Shatabda
•  & Dewan Md Farid
2. #### Department of Computer Science, School of Mathematics, Statistics, and Computer Science, University of Tehran, Tehran, Iran

• Zaynab Mousavian
3. #### Department of Computer Science, Morgan State University, Baltimore, Maryland, USA

• Abdollah Dehzangi
4. #### Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, ECE Building, West Palashi, Dhaka, 1205, Bangladesh

• M. Sohel Rahman

### Contributions

S.S. initiated the project with the idea of using structural features. F.R., S.A. and D.M.F. equally contributed to the idea of modified balancing method and boosting. F.R. and S.A. equally contributed in the implementation and experimentation of the system. All the methods, algorithms and results have been analyzed and verified by S.S., D.M.F., M.S.R., Z.M. and A.D. All authors contributed significantly in the preparation of the manuscript and approved the final version.

### Competing Interests

The authors declare that they have no competing interests.

### Corresponding author

Correspondence to Swakkhar Shatabda.

## About this article

### DOI

https://doi.org/10.1038/s41598-017-18025-2

## Further reading

• ### iPro70-FMWin: identifying Sigma70 promoters using multiple windowing and minimal features

• Md. Siddiqur Rahman
• , Usma Aktar
• , Md Rafsan Jani
•  & Swakkhar Shatabda

Molecular Genetics and Genomics (2018)

## Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.