- Open Access
Prediction of DNA-binding residues from protein sequence information using random forests
© Wang et al; licensee BioMed Central Ltd. 2009
- Published: 7 July 2009
Protein-DNA interactions are involved in many biological processes essential for cellular function. To understand the molecular mechanism of protein-DNA recognition, it is necessary to identify the DNA-binding residues in DNA-binding proteins. However, structural data are available for only a few hundreds of protein-DNA complexes. With the rapid accumulation of sequence data, it becomes an important but challenging task to accurately predict DNA-binding residues directly from amino acid sequence data.
A new machine learning approach has been developed in this study for predicting DNA-binding residues from amino acid sequence data. The approach used both the labelled data instances collected from the available structures of protein-DNA complexes and the abundant unlabeled data found in protein sequence databases. The evolutionary information contained in the unlabeled sequence data was represented as position-specific scoring matrices (PSSMs) and several new descriptors. The sequence-derived features were then used to train random forests (RFs), which could handle a large number of input variables and avoid model overfitting. The use of evolutionary information was found to significantly improve classifier performance. The RF classifier was further evaluated using a separate test dataset, and the predicted DNA-binding residues were examined in the context of three-dimensional structures.
The results suggest that the RF-based approach gives rise to more accurate prediction of DNA-binding residues than previous studies. A new web server called BindN-RF http://bioinfo.ggc.org/bindn-rf/ has thus been developed to make the RF classifier accessible to the biological research community.
- Receiver Operating Characteristic Curve
- Random Forest
- Classifier Performance
- Evolutionary Information
- Prediction Strength
Many nuclear proteins perform essential functions through interaction with DNA. For instance, transcription factors activate or repress downstream gene expression by binding to specific DNA motifs in promoters . To understand the molecular mechanism of protein-DNA recognition, it is important to identify the DNA-binding residues in proteins. The identification is straightforward if the structure of a protein-DNA complex is known. However, it is rather expensive and time-consuming to solve the structure of a protein-DNA complex. Currently, only a few hundreds of protein-DNA complexes have structural data available in the Protein Data Bank . With the rapid accumulation of sequence data from many genomes, computational methods are needed for accurate prediction of DNA-binding residues in protein sequences. The prediction results can provide useful information for protein functional annotation, protein-DNA docking, and experimental studies such as site-directed mutagenesis.
Machine learning is particularly appealing for modelling the DNA-binding pattern of amino acid residues. Although some experimental observations have been made for DNA-binding residues in protein structures, the molecular recognition pattern is still poorly understood . It is thus desired that machine learning methods can be used to model the complex patterns hidden in the available structural data, and the resulting classifier can be applied to reliable identification of DNA-binding residues in protein sequences. The machine learning problem can be formally specified as follows: given the amino acid sequence of a protein that is supposed to interact with DNA, the task is to predict which amino acid residues may be located at the interaction interface. Since both the structure of the protein and the sequence of the target DNA are assumed to be unknown, it is challenging to predict DNA-binding residues from amino acid properties and local sequence patterns.
Several machine learning methods have been reported for predicting DNA-binding residues in protein sequences. Ahmad et al.  analyzed the structural data of representative protein-DNA complexes, and used the amino acid sequences in these structures to train artificial neural networks (ANNs) for DNA-binding site prediction. Yan et al.  constructed Naïve Bayes classifiers using the amino acid identities of DNA-binding sites and their sequence neighbours. However, the prediction accuracy was relatively low in these studies [4, 5], probably because amino acid sequences were directly used for classifier construction.
The use of domain-specific knowledge for input encoding has been shown to enhance classifier performance. Ahmad and Sarai  developed an ANN-based method to utilize evolutionary information in terms of position-specific scoring matrices (PSSMs). The scores in a PSSM indicate how well each amino acid position of a sequence is conserved among its homologues. Since functional sites tend to be conserved among homologous proteins, PSSMs may provide relevant information for predicting DNA-binding residues. It was found that the average of sensitivity and specificity could be increased by up to 8.7% using PSSMs when compared with ANN predictors using sequence information only . More recently, PSSMs were also used to train support vector machines (SVMs) and logistic regression models for accurate prediction of DNA-binding residues [7, 8].
In our previous studies [9, 10], ANN and SVM classifiers were constructed using relevant biochemical features, including the hydrophobicity index, side chain pKa value, and molecular mass of an amino acid. These features were used to represent biological knowledge, which might not be learned from the training data of DNA-binding residues. It was found that classifier performance was significantly improved by the use of biochemical features for input encoding, and the SVM classifier outperformed the ANN predictor [9, 10].
There are two main objectives of the present study. The first objective is to improve the prediction accuracy by combining different types of biological knowledge in classifier construction. Although either PSSMs or biochemical features have been used for input encoding, it is still unknown whether classifier performance can be further improved through a combination of relevant features, including new descriptors of evolutionary information. One potential problem is that the use of PSSMs for classifier construction gives rise to a large number of input variables. A training data instance normally includes multiple neighbouring residues for providing context information, and each residue has 20 PSSM scores. Considering the relatively small dataset currently available for modelling DNA-binding sites, too many input variables may result in model overfitting for most machine learning algorithms. Thus, the second objective is to investigate whether accurate classifiers can be constructed using the random forest (RF) learning algorithm, which has the capability to handle a large number of input variables and avoid model overfitting . The results obtained in this study indicate that DNA-binding site prediction can be significantly improved by using the RF-based approach with biochemical features and several new descriptors of evolutionary information for input encoding.
This study used two amino acid sequence datasets, PDNA-62 and PDC25t, which were extracted from the structural data of protein-DNA complexes available at the Protein Data Bank http://www.rcsb.org/pdb/. The PDNA-62 dataset was used classifier construction in this work as well as several previous studies [6–10]. The amino acid sequences in PDNA-62 were derived from 62 structures of representative protein-DNA complexes, and the dataset had less than 25% identity among the sequences. The PDC25t dataset was derived from the protein-DNA complexes that were not included in PDNA-62. The sequences in PDC25t had less than 25% identity among them as well as with the sequences in PDNA-62. In this study, PDC25t was used as a separate test dataset for classifier performance evaluation and comparison.
As in our previous studies [9, 10], an amino acid residue was designated as a binding site if the side chain or backbone atoms of the residue fell within a cutoff distance of 3.5 Å from any atoms of the DNA molecule in the complex. All the other residues were regarded as non-binding sites. Both PDNA-62 and PDC25t are imbalanced datasets with ~15% residues labelled as DNA-binding and ~85% residues being non-binding.
Classifiers were trained using residue-wise data instances derived from the sequence dataset (PDNA-62). Each data instance had eleven consecutive residues, and the target residue was positioned in the middle of the subsequence. A data instance was labelled as positive if the target residue was DNA-binding, or negative if the target residue was non-binding. The context information provided by the five neighbouring residues on each side of the target residue was previously shown to be optimal for sequence-based prediction of DNA-binding residues [9, 10].
In classifier construction, the input vector was generated by encoding each residue with three biochemical features and several descriptors of evolutionary information (see below). In our previous studies [9, 10], the three biochemical features, including the hydrophobicity index (feature H), side chain pKa value (feature K), and molecular mass (feature M) of an amino acid, were shown to be relevant for DNA-binding site prediction.
Evolutionary information extraction
For DNA-binding site prediction, the labelled datasets derived from the available structures are relatively small in size. However, there are abundant unlabeled sequence data in public databases such as UniProt . The unlabeled data contain evolutionary information about the conservation of each sequence position. Because DNA-binding residues tend to be conserved among homologous proteins , evolutionary information can be used to enhance classifier performance.
where f (a i , h j ) is set to 1 if a i is aligned to an identical or similar residue in h j , or 0 otherwise, and c is a pseudo-count (set to 10 in this work). The term (c/n) is used to scale the feature value, and it becomes smaller when n gets larger. If p has no hit in the database (n = 0), the feature value is set to 0. The B score was used to construct artificial neural network classifiers in our previous study .
where χ(a i , h j ) is the value of feature X for the amino acid residue in h j , which is aligned to a i at position i in p. The mean of feature X, also referred to as H m , K m or M m in this paper, captures the biochemical properties of an amino acid position in the sequence alignment. It has been shown that basic and polar amino acids are overrepresented while acidic and hydrophobic amino acids are underrepresented in the population of DNA-binding sites [4, 9]. The standard deviation of feature X, also called H d , K d or M d , reveals how well the biochemical properties of an amino acid position are conserved in the aligned homologous sequences.
(3) Position-specific scoring matrix (PSSM): The PSSM scores are generated by PSI-BLAST , and there are 20 values for each sequence position. The evolutionary information captured by PSSMs was previously shown to improve the performance of artificial neural networks and support vector machines for DNA-binding site prediction [6, 7]. However, PSSM is rather designed for BLAST searches, and it may not capture all the evolutionary information for modelling DNA-binding sites.
The use of evolutionary information for classifier construction results in a large number of input variables. In particular, since PSSM has 20 scores for each sequence position, it gives rise to 220 inputs for a data instance with eleven residues. Considering the relatively small size of the training dataset, too many inputs may result in model overfitting. In this study, we used the random forest learning algorithm, which was shown to have the capability of handling a large number of input variables and avoiding model overfitting .
Random forests (RFs) use a combination of independent decision trees to improve classifier performance. Specifically, each decision tree in a forest is constructed using a bootstrap sample from the training data. During tree construction, m variables out of all the n input variables (m <<n) are randomly selected at each node, and the tree node is split using the selected m variables. Because of the random feature selection, RFs can handle a large number of input variables and avoid overfitting. For classifying a data instance, a RF classifier combines the votes made by the decision trees, and gives the most popular class as the output of the ensemble. It has been shown that RFs outperform AdaBoost ensembles on noisy datasets, and can work well on data with many weak inputs . These characteristics of RFs are appealing since the DNA-binding data appear to be noisy and contain many weak sequence-derived features.
In this study, we used the software package available at http://www.stat.berkeley.edu/~breiman/RandomForests/to construct RF classifiers with the default parameter settings. In particular, the number of variables selected to split each node (m) was set to the floor of square root of the total number of input variables. Other values of m were also tested, but did not result in significant improvement of classifier performance for DNA-binding site prediction.
where TP is the number of true positives (binding residues with positive predictions); TN is the number of true negatives (non-binding residues with negative predictions); FP is the number of false positives (non-binding residues but predicted as binding sites); and FN is the number of false negatives (binding residues but predicted as non-binding sites). Since the datasets used in this study are imbalanced, the overall accuracy alone could be misleading. For instance, a classifier could achieve ~85% accuracy by simply predicting all the residues as negatives. Thus, both sensitivity and specificity are also computed from prediction results. Furthermore, the average of sensitivity and specificity, referred to as strength in this paper, may provide a fair measure of classifier performance as shown in previous studies [4, 9].
The Receiver Operating Characteristic (ROC) curve is probably the most robust approach for classifier evaluation and comparison . The ROC curve is drawn by plotting the true positive rate (i.e., sensitivity) against the false positive rate, which equals to (1 - specificity). In this work, the ROC curve has been generated by using different threshold values for the output of a classifier and plotting the true positive rate against false positive rate for each threshold value. The area under the ROC curve (AUC) can be used as a reliable measure of classifier performance . Since the ROC plot is a unit square, the maximum value of AUC is 1, which is achieved by a perfect classifier. Weak classifiers and random guessing have AUC values close to 0.5.
Random forests for sequence-based prediction of DNA-binding residues
As the first step to develop the new approach for DNA-binding site prediction, random forests (RFs) were trained with three biochemical features that were used to construct ANN and SVM predictors in our previous studies [9, 10]. The biochemical features, including the hydrophobicity index (feature H), side chain pKa value (K) and molecular mass (M) of an amino acid, were shown to provide relevant information for predicting DNA-binding residues . The input vector contained 33 feature values because each data instance was a subsequence of eleven consecutive residues with the target residue in the middle position (see Methods). The context information provided by the ten neighbouring residues was found to be optimal for DNA-binding site prediction [9, 10].
Performance of different classifiers constructed using biochemical features.
The results suggest that, with the three biochemical features, the RF classifier is slightly more accurate than the ANN and SVM predictors [9, 10]. By using the same dataset (PDNA-62), the ANN and SVM predictors achieved the prediction strength of 67.42% and 69.94%, respectively. The ROC AUC of the ANN and SVM predictors is also less than that of the RF classifier. However, RFs have the major advantage in handling a large number of input variables should various descriptors of evolutionary information be used for input encoding.
Improved classifier performance by using evolutionary information
Effect of evolutionary information on the performance of RF classifiers.
H m , H d , K m , K d
PSSM, H m , H d , K m , K d
However, RF classifier performance is significantly improved by using the PSSM descriptor of evolutionary information. PSSMs were derived from the PSI-BLAST search against the UniProtKB database as described in Methods. Because each residue was encoded with 20 PSSM scores and 3 biochemical features, the input vector contained 253 values for a data instance with eleven residues. As shown in Table 2, the use of PSSM for input encoding improved the prediction strength to 76.82%. The classifier also had higher ROC AUC (0.8521) than the RF classifier constructed using the three biochemical features alone (AUC = 0.7837). The results were obtained with 1000 decision trees in the forest and the training parameter m set to 15. Other parameter settings were also tested, but did not give rise to better classifier performance.
The means (H m , K m and M m ) and standard deviations (H d , K d and M d ) of the three biochemical features represent new descriptors of evolutionary information, which indicate how well the biochemical properties of an amino acid position are conserved in the sequence alignment from the PSI-BLAST search. It was found that the use of H m , K m , H d , and K d in classifier construction improved the prediction strength to 75.99% with AUC = 0.8422 (Table 2). The RF classifier was constructed using 1000 decision trees and m = 8. However, adding M m and M d to the input vector did not result in further improvement of classifier performance (data not shown).
Interestingly, the most accurate classifier was obtained with a combination of PSSM, H m , H d , K m and K d in addition to the three biochemical features for input encoding. Since the input vector had 297 variables (27 inputs for each of the eleven residues in a data instance), the training parameter m was set to 17 for the forest with 1000 decision trees. As shown in Table 2, the resulting classifier achieved the overall accuracy of 78.20% with 78.06% sensitivity and 78.22% specificity. The prediction strength reached 78.14%, representing an increase of 6.57% when compared with the performance achieved without evolutionary information (71.57%). This RF also had the highest level of ROC AUC (0.8605) among all the classifiers (Table 2).
Comparison of classifier performance using a separate test dataset
To further demonstrate the improved prediction of DNA-binding residues, the most accurate RF (also called BindN-RF) has been compared with the previous classifiers (BindN, DP-Bind and DBS-PSSM) using a separate test dataset, PDC25t. BindN uses the SVM classifier constructed using the three biochemical features (H, K and M) in our previous study . The DP-Bind web server http://lcg.rit.albany.edu/dp-bind/ provides PSSM-based SVM and kernel logistic regression predictors for DNA-binding site prediction [7, 8]. DBS-PSSM http://www.netasa.org/dbs-pssm/ is the ANN predictor trained with PSSM and sequence information . All the above classifiers have been constructed using the same training dataset, PDNA-62, which shares less than 25% sequence identity with the PDC25t dataset.
Comparison of classifier performance using a separate test dataset.
Structural validation of predicted DNA-binding residues
The BindN-RF web server
To make the accurate RF classifier available to the biological research community, we have developed the BindN-RF web server http://bioinfo.ggc.org/bindn-rf/. Users can enter an amino acid sequence in FASTA format, and specify the desired level of sensitivity or specificity for DNA-binding site prediction. For a query sequence, the system performs a three-iteration PSI-BLAST search against the UniProtKB database to extract evolutionary information as described in Methods. The RF classifier constructed in this work is then used to predict DNA-binding residues in the query sequence. The user-defined level of sensitivity or specificity is used to determine the output threshold for the RF classifier according to its ROC curve. Thus, users can choose a specificity level higher than the default value (85%) to reduce the number of false positive predictions. The output report of BindN-RF has been designed to be self-explanatory, and is similar to that of BindN. A detailed description about the report format can be found in our previous paper .
A random forest-based approach has been described in this paper for predicting DNA-binding residues in protein sequences. Since random forests can handle a large number of input variables and avoid model overfitting, accurate classifiers have been constructed by combining biochemical features with several descriptors of evolutionary information for input encoding. The new descriptors developed in the present work have been shown to enhance classifier performance when they are used together with the biochemical features and position-specific scoring matrices. Thus, the new descriptors capture certain evolutionary information that is not contained in position-specific scoring matrices previously used for DNA-binding site prediction. The best random forest classifier achieved 80.00% overall accuracy with 73.08% sensitivity and 80.63% specificity on a separate test dataset. Predictions at this level of accuracy may provide useful information for protein-DNA docking and experimental studies such as site-directed mutagenesis for understanding protein-DNA interactions. The new approach has been implemented in the BindN-RF web server for online prediction of DNA-binding residues in protein sequences.
This article has been published as part of BMC Genomics Volume 10 Supplement 1, 2009: The 2008 International Conference on Bioinformatics & Computational Biology (BIOCOMP'08). The full contents of the supplement are available online at http://0-www.biomedcentral.com.brum.beds.ac.uk/1471-2164/10?issue=S1.
- Ptashne M: Regulation of transcription: from lambda to eukaryotes. Trends Biochem Sci. 2005, 30: 275-279. 10.1016/j.tibs.2005.04.003.View ArticlePubMedGoogle Scholar
- Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE: The Protein Data Bank. Nucleic Acids Res. 2000, 28: 235-242. 10.1093/nar/28.1.235.PubMed CentralView ArticlePubMedGoogle Scholar
- Sarai A, Kono H: Protein-DNA recognition patterns and predictions. Annu Rev Biophys Biomol Struct. 2005, 34: 379-398. 10.1146/annurev.biophys.34.040204.144537.View ArticlePubMedGoogle Scholar
- Ahmad S, Gromiha MM, Sarai A: Analysis and prediction of DNA-binding proteins and their binding residues based on composition, sequence and structural information. Bioinformatics. 2004, 20: 477-486. 10.1093/bioinformatics/btg432.View ArticlePubMedGoogle Scholar
- Yan C, Terribilini M, Wu F, Jernigan RL, Dobbs D, Honavar V: Predicting DNA-binding sites of proteins from amino acid sequence. BMC Bioinformatics. 2006, 7: 262-10.1186/1471-2105-7-262.PubMed CentralView ArticlePubMedGoogle Scholar
- Ahmad S, Sarai A: PSSM-based prediction of DNA binding sites in proteins. BMC Bioinformatics. 2005, 6: 33-10.1186/1471-2105-6-33.PubMed CentralView ArticlePubMedGoogle Scholar
- Kuznetsov IB, Gou Z, Li R, Hwang S: Using evolutionary and structural information to predict DNA-binding sites on DNA-binding proteins. Proteins. 2006, 64: 19-27. 10.1002/prot.20977.View ArticlePubMedGoogle Scholar
- Hwang S, Gou Z, Kuznetsov IB: DP-Bind: a web server for sequence-based prediction of DNA-binding residues in DNA-binding proteins. Bioinformatics. 2007, 23: 634-636. 10.1093/bioinformatics/btl672.View ArticlePubMedGoogle Scholar
- Wang L, Brown SJ: Prediction of DNA-binding residues from sequence features. J Bioinform Comput Biol. 2006, 4: 1141-1158. 10.1142/S0219720006002387.View ArticlePubMedGoogle Scholar
- Wang L, Brown SJ: BindN: a web-based tool for efficient prediction of DNA and RNA binding sites in amino acid sequences. Nucleic Acids Res. 2006, 34: W243-W248. 10.1093/nar/gkl298.PubMed CentralView ArticlePubMedGoogle Scholar
- Breiman L: Random forests. Machine Learning. 2001, 45: 5-32. 10.1023/A:1010933404324.View ArticleGoogle Scholar
- Wu CH, Apweiler R, Bairoch A, Natale DA, Barker WC, Boeckmann B, Ferro S, Gasteiger E, Huang H, Lopez R, Magrane M, Martin MJ, Mazumder R, O'Donovan C, Redaschi N, Suzek B: The Universal Protein Resource (UniProt): an expanding universe of protein information. Nucleic Acids Res. 2006, 34: D187-D191. 10.1093/nar/gkj161.PubMed CentralView ArticlePubMedGoogle Scholar
- Panchenko AR, Kondrashov F, Bryant S: Prediction of functional sites by analysis of sequence and structure conservation. Protein Sci. 2004, 13: 884-892. 10.1110/ps.03465504.PubMed CentralView ArticlePubMedGoogle Scholar
- Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res. 1997, 25: 3389-3402. 10.1093/nar/25.17.3389.PubMed CentralView ArticlePubMedGoogle Scholar
- Swets JA: Measuring the accuracy of diagnostic systems. Science. 1988, 240: 1285-1293. 10.1126/science.3287615.View ArticlePubMedGoogle Scholar
- Bradley AP: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition. 1997, 30: 1145-1159. 10.1016/S0031-3203(96)00142-2.View ArticleGoogle Scholar
- Schumacher MA, Miller MC, Grkovic S, Brown MH, Skurray RA, Brennan RG: Structural basis for cooperative DNA binding by two dimers of the multidrug-binding protein QacR. EMBO J. 2002, 21: 1210-1218. 10.1093/emboj/21.5.1210.PubMed CentralView ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.