Prediction of GTP interacting residues, dipeptides and tripeptides in a protein from its evolutionary information
© Chauhan et al; licensee BioMed Central Ltd. 2010
Received: 11 February 2010
Accepted: 3 June 2010
Published: 3 June 2010
Guanosine triphosphate (GTP)-binding proteins play an important role in regulation of G-protein. Thus prediction of GTP interacting residues in a protein is one of the major challenges in the field of the computational biology. In this study, an attempt has been made to develop a computational method for predicting GTP interacting residues in a protein with high accuracy (Acc), precision (Prec) and recall (Rc).
All the models developed in this study have been trained and tested on a non-redundant (40% similarity) dataset using five-fold cross-validation. Firstly, we have developed neural network based models using single sequence and PSSM profile and achieved maximum Matthews Correlation Coefficient (MCC) 0.24 (Acc 61.30%) and 0.39 (Acc 68.88%) respectively. Secondly, we have developed a support vector machine (SVM) based models using single sequence and PSSM profile and achieved maximum MCC 0.37 (Prec 0.73, Rc 0.57, Acc 67.98%) and 0.55 (Prec 0.80, Rc 0.73, Acc 77.17%) respectively. In this work, we have introduced a new concept of predicting GTP interacting dipeptide (two consecutive GTP interacting residues) and tripeptide (three consecutive GTP interacting residues) for the first time. We have developed SVM based model for predicting GTP interacting dipeptides using PSSM profile and achieved MCC 0.64 with precision 0.87, recall 0.74 and accuracy 81.37%. Similarly, SVM based model have been developed for predicting GTP interacting tripeptides using PSSM profile and achieved MCC 0.70 with precision 0.93, recall 0.73 and accuracy 83.98%.
These results show that PSSM based method performs better than single sequence based method. The prediction models based on dipeptides or tripeptides are more accurate than the traditional model based on single residue. A web server "GTPBinder" http://www.imtech.res.in/raghava/gtpbinder/ based on above models has been developed for predicting GTP interacting residues in a protein.
Many proteins such as protein kinase, G-protein, dehydrogenase enzymes, Ras group of proteins and Src group proteins bind to nucleotide (adenine and guanine) for their function [1, 2]. These proteins play an important role in cellular transport mechanisms, cell signaling, muscle contraction and cellular motility. At present the number of known protein structures has increased enormously due to rapid advancement in the structural genomics projects. Protein Data Bank (PDB), a representative database of biomolecular structures contains about 64000 experimentally determined protein structures including different types of ligands. The gap between the number of reported sequences and experimental structures continues to increase. Finding and predicting nucleotide-binding residues in a protein structures are important for understanding the function of these proteins. Previous studies on protein nucleotide interactions show that these proteins have binding site of specific characteristics. For example, Walker's A motif, a motif present in P-loop [3, 4], has been proposed for phosphate binding site. But this motif is not sufficient for identification of all GTP interacting residues. Many nucleotide-binding proteins share common features but molecular recognition studies show that adenine and guanine ligand binding site in these protein are different, in terms of binding site amino acid propensities and propensities to form hydrogen bonds to the bases [5, 6].
So there is a need to develop alternate technique, such as computational techniques for predicting ligand-interacting residues in a protein. Broadly, the existing method of predicting function of a protein can be divided in two categories; I) protein level prediction, where function of whole protein is predicted [7–9] and II) residue level prediction where function of each residue in a protein is predicted [10–13]. In this study, we have used the second approach for predicting GTP interacting residues in a protein from its amino acid sequence. The GTP ligand is crucial for various protein receptors for activation of enzymatic reaction. Mutations in the GTP binding site alter the biochemical reaction and reduce GTPase activity . Thus the GTP binding site will act as potential site for docking studies. Identification of GTP interacting residues from its amino acid sequence is very important for researchers working in the filed of drug discovery. During last few years, many nucleotides (GTP) binding proteins have been discovered due to advancement in sequence technology. This poses a challenge for bioinformaticians to identify GTP interacting residues in newly sequenced GTP binding proteins; identification of GTP interacting techniques is time consuming and costly. To the best of our knowledge, no sequenced based method has been developed so far for predicting GTP interacting residue in a protein.
In this study, we have used two powerful machine-learning techniques, Artificial Neural Network (ANN) and Support Vector Machines (SVM), for developing prediction models. First, ANN based method developed using amino acid sequence and evolutionary information. Secondly, we used SVM based technique, which has been used for developing various bioinformatics methods in the past like predicting protein subcellular location , protein structure class , specificity of GalNAc-transferase , protein-ligand interacting residues . It has been shown in number of studies that SVM perform better than ANN [17, 18]. In existing residue level prediction methods, a pattern is generated to predict function of a central residue - for example, a pattern/window of 17 residues contains query residue, 8 residue left and 8 residue right of query residue. In this study, for the first time, we have introduced new concept for generating patterns for predicting dipeptide (two consecutive GTP interacting residues) and tripeptide (three consecutive GTP interacting residues) from a single pattern.
Concept of amino/di/tripeptide
All existing interacting residue prediction method uses single residue based technique (SRT), where patterns are generated and discriminated to predict central residue of a pattern (see Materials and Methods). We have also implemented same SRT in this study, where we have generated 876 positive patterns (GTP interacting central residue) from 44 non-redundant protein chains. In this study, we have introduced two new concepts for predicting GTP interacting residues using dipeptide based technique (DPT) and tripeptides based technique (TPT). In case of DPT, we have generated 451 positive patterns where central dipeptide (two consecutive residues) is GTP interacting (see Materials and Methods). In case of TPT, we have generated 256 positive patterns where central tripeptide (three consecutive residues) is GTP interacting. Figure S1 (Additional file 1) shows the above concept visually.
Artificial Neural Network based Models
The performance of ANN models using single residue based technique (SRT) from amino acids sequence of protein.
The performance of ANN model using single residue based technique (SRT) from evolutionary information of protein (PSSM profile).
SVM based Models
Single Residue based Technique (SRT)
The performance of SVM models on main dataset using using SRT, DPT and TPT (See Additional file 1 Table S1-6 for detail)
Types of patterns
Dipeptide based Technique (DPT)
All the above models were based on SRT where patterns are generated and classified for predicting function of a single central residue of a pattern. In this study, we have generated and classified pattern for predicting function of two central residues of a pattern called DPT. First we have generated patterns of length 16 residues which contained either GTP interacting or non-interacting central dipeptide. Total 451 positive patterns with two central interacting residues (dipeptides) were obtained. Finally we have developed SVM model using DPT for predicting GTP interacting in a proteins from its amino acid sequence and achieved maximum MCC 0.48 with precision 0.81, recall 0.60, accuracy 73.28% and F1 score 0.69. In order to improve the performance of SVM models using DPT, we have developed PSSM based models instead of single sequence based model and achieved MCC 0.64 with precision 0.87, recall 0.74, accuracy 81.37% and F1 score 0.80 (Table 3).
Tripeptide based Technique (TPT)
Performance of SVM on Realistic dataset
The performance of SVM model on realistic dataset using SRT, DPT and TPT (See Additional file 1 Table S7-12 for detail)
Types of patterns
The GTP interacting proteins play a vital role in signaling pathways, in which GTP is used as a substrate by kinases that phosphorylate proteins. Finding and predicting GTP-binding residues in protein are important subjects in protein interaction studies. The identification of GTP interacting residues is difficult by using in-vitro techniques, so there is a need for computational method to identify GTP binding sites on the basis of protein sequence. In the past, the structural based method for predicting GTP binding site using empirical scores system was developed . This method detects GTP binding sites with low accuracy but do not provide information about GTP interacting residues. There is no method which can predict GTP-interacting residues in a protein using their amino acid sequence.
In this study, we have analyzed GTP interacting residues and its neighbors, and found that there is a significant difference in interacting and non-interacting residues. In this method, first we considered single GTP interacting residue, then we introduced new concepts of predicting GTP interacting dipeptide (two consecutive GTP interacting residues) and tripeptide (three consecutive GTP interacting residues). First, we have develop a neural network based method for predicting GTP interacting residues but its performance was poor. The earlier method shows that SVM performs better than any other artificial intelligence technique in predicting interacting residues. We have developed SVM models based on binary patterns of single GTP interacting residue, GTP interacting dipeptide and GTP interacting tripeptide. It has been shown in number of previous studies that the models based on evolutionary information are more accurate than models based on single sequence [10, 16]. Thus, we have also developed SVM model based on evolutionary information (PSSM profiles) and observed that SVM models based on evolutionary are more accurate than SVM models based on single sequence.
One of the novelties of this study is the application of new strategy for prediction. We have used a pattern to predict dipeptide or tripeptides instead of single residue. Our models based on dipeptide or tripeptides are much more accurate than models based on single residue.
One of the major problems is selection of threshold that same MCC and F1 score may be obtained for different threshold (Additional file 1 Table S1 to S12). This raises a question which threshold score one should select as each one has different combination of sensitivity, accuracy and precision. In this study, we have varied threshold in the range of -1 to +1. Normally we select those thresholds where maximum values are maximum in the following order MCC, accuracy and precision with least difference in sensitivity and specificity. But this criteria is not always achievable, because the higher the recall, the lower the precision and vice versa. In this work, when we have used main dataset, there is least difference between recall and specificity with maximum MCC at specific threshold, but in realistic datasets we have achieved maximum MCC where recall was very less than specificity at specific threshold. Finally, we have computed the area under the ROC curve (AUC) for further analyzing the significance of the results (Figure 2). The ROC curve have been generated by varying threshold score, it has been observed that evolutionary information was important for the prediction of GTP interacting residues.
This study raises a question whether models should be developed based on SRT or DPT or TPT. As we know SRT is almost a standard in the filed and used in all studies, It's major advantage is that it does not bother the distribution of GTP interacting residues so it cover all residues. In case of DPT and TPT, coverage will depend on distribution of residues. In this study, we have obtained 876, 451 and 256 examples in case of DPT and TPT. In case of DPT and DPT, large number interacting residues which were alone were not covered. As shown above, the performance is better in case of DPT and TPT than SRT. The authors feel that one should used all three types of models for predicting GTP interacting residues rather than using individual method in order to achieve high accuracy.
In this study, for the first time, a method has been developed to predict GTP interacting residues in a protein form its amino acid sequence with reasonably high accuracy. It has been observed that SVM models perform better than ANN based models in the prediction of GTP binding residues. The performance of models improved when PSSM profile has been used instead of single amino acid sequence of protein. First time, we have introduced and demonstrated that pattern could be used to predict more than one residue (e.g., dipeptide, tripeptides). The new models based on DPT and TPT perform better than standard models based on SRT. Though DPT and TPT improve performance but will decrease coverage so it is advisable to use all three models. Finally, web server has been developed which will serve the scientific community in understanding GTP-protein interaction.
First we extracted 247 protein PDB IDs that interact with GTP from SuperSite encyclopedia . We downloaded the sequence of all the chains of these PDB IDs from PDB. These sequences were filtered with 40% sequence identity using the program CD-HIT. Finally, we got 44 GTP binding chains, where no two sequences have more than 40% sequence identity. We used software Ligand Protein Contact (LPC) software  for assigning GTP-interacting and non-interacting residues in these 44 non-redundant protein chains.
Pattern or window size
We generate overlapping patterns/segments/strings of size (or window size) 17. If the central residue of pattern is GTP interacting then we assigned the pattern as positive/interacting pattern otherwise pattern is assigned negative/non-interacting pattern [10, 16]. To generate a pattern corresponding to the terminal residues in a protein sequence, we added (L-1)/2 dummy residue "X" at both termini of the protein (where L is the length of pattern). For window size 17 of SR patterns, we have added 8 "X" before N-terminal and 8 "X" after C-terminal, in order to create N patterns from the sequence of length N. We have generated a total 876 unique positive patterns from 44 protein chains. In this study, we have created two types of dataset - i) main dataset contains 876 positive patterns and equal number of randomly selected negative patterns; ii) realistic dataset contains 876 positive patterns and 16831 negative patterns. This is a standard technique for creating pattern around a single residue, almost of all the previous studies used this technique for developing method for predicting RNA-interacting residues , ATP-interacting residues , cleavage sites , signal peptides . In this study, we called this a single residue based technique (SRT), as it is used to predict whether single central residue in pattern is interacting or non-interacting.
In this study, we have introduced two new techniques for predicting GTP interacting residues; i) dipeptide based technique (DPT) and ii) tripeptide based technique (TPT). In DPT, we have generated overlapping patterns/segments having interacting and non-interacting dipeptides (two consecutive residues) in center of peptides. In this case, positive patterns are those, which have two central residues GTP-interacting. Similarly, negative patterns are those, which have two central residues non-interacting (see Additional file 1 Figure S1). In TPT, we have generated overlapping patterns having interacting and non-interacting tripeptides (three consecutive residues) in center of peptides. In this case, the positive patterns are those, which have three central residues GTP-interacting. Similarly, the negative patterns are those, which have three central residues non-interacting (see Additional file 1 Figure S1).
In statistical prediction methods, there are three frequently used cross-validation techniques - single independent dataset test, sub-sampling (e. g., 5 or 10-fold cross-validation), test and jackknife test are widely used for examining the accuracy of a statistical prediction method [26, 27]. In our study, we have used 5-fold cross-validation procedure to develop the prediction method, where five subsets have been constructed randomly from the data set as used in previous study . Five-fold cross-validation is a popular cross-validation technique, which has no biasness in data selection. In this method, patterns are randomly divided into five sets. The methods have been trained on four sets, and the performance is measured on the remaining fifth set. This process is repeated five times in such a way that each set is used once for testing. The final performance is obtained by averaging the performances of all five sets.
Artificial Neural Network
In this study, we have used SNNS (version 4.2 from) for implementing artificial neural network (ANN). This software is available free for academic use from Stuttgart University . One of the beauties of this software is that it allows generating code in ANSI C for implementing neural models; this allows us to use in web-based implementation. The training is carried out using error back-propagation with a sum of square error function (SSE) . The learning parameter was set to 0.01. The magnitude of the error sum in the test and training set was monitored after each cycle of training. Ultimately, the number of cycles is determined where the network during training converges.
Support Vector Machine (SVM)
In this study, SVM_light has been used to implement SVM . The SVM is a supervised machine-learning technique, based on the structural risk minimization principle from statistical learning theory. This package SVM_Light is freely available from http://www.cs.cornell.edu/People/ti/svm_light for academic use. Further detail about SVM can be obtained from Vapnik, 1995 . The SVM_Light allows for choosing number of parameters and kernels (e.g. linear, polynomial, radial basis function, sigmoid) or any user-defined kernel.
Amino acid Binary patterns
Assigning binary values to the amino acids in fixed length patterns generate amino acid binary patterns [10, 16, 32]. Previous studies on nucleotide interacting proteins prediction shows that 17 window patterns perform better than other window size [10, 16]. A vector of dimension N × 21 represents the pattern of length N in binary form. Each residue was represented by a vector of dimension 21 (e.g. Ala by 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0; Cys by 0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0), which contains 20 amino acids and one dummy amino acid "X".
Position Specific Scoring Matrix (PSSM)
The PSSM profile for each protein was generated using PSI-BLAST by searching the protein against SWISS-PROT dataset . In PSI-BLAST we use three iteration, after each iterative search in which sequences found in one round of searching are used to build a score model for the next round of searching. After three iterations with cut-off E-value of 0.001, PSI-BLAST generated a PSSM profile. The PSSM scores were normalized in order to get values between 0 and 1, and then position specific score of each amino acid was calculated. The matrix consisted of 21 × N elements (20 amino acids and one dummy amino acid "X"), where N is the length of the target sequence, and each element represents the frequency of occurrence of each of the 20 amino acids at one position in the alignment. It means that evolutionary information for each amino acid is encapsulated in a vector of 21 dimensions where the size of PSSM matrix of a protein with N residues is 21 × N. The resultant matrix with 357 elements for pattern of length 17-residue, was used as input feature for ANN or SVM.
- 1.Precision or probability of positive values (PPV) is the probability of correct prediction of interacting/positive residues.
- 2.Recall (R) is also called sensitivity or percent of coverage of GTP interacting residues in a protein. It is percentage of correctly predicted GTP-interacting residues in proteins.
- 3.F1 measure is the harmonic mean of precision (P) and recall (R).
- 4.Specificity is percentage of correctly predicted non-interacting residues in a protein.
- 5.Accuracy is the percentage of correctly predicted residues (interacting and non-interacting).
- 6.MCC - Matthews's correlation coefficient is the statistical parameter to access the quality of prediction and taking care of unbalancing in data. An MCC equal to 1 regarded as a perfect prediction, whereas 0 is for a completely random prediction.
AUC (Area under the ROC Curve) - Receiver Operating Curve (ROC) is a threshold independent parameter It is a plot between true positive proportion (TP/TP+FN) and false positive proportion (FP/FP+TN). We plot ROC and calculate AUC by using SPSS package.
Where, TP and TN are true positive (correctly predicted interacting) positive and true negative (correctly predicted non-interacting) residues respectively. FP and FN are false positive and false negatives respectively.
Availability and requirements
Project name: GTPBinder: A server for prediction of GTP interacting protein residues
Project home page: http://www.imtech.res.in/raghava/gtpbinder
Operating system(s): Platform independent;
Programming language: PERL, CGI-PERL;
Other requirements: None;
Any restrictions to use by non-academics: No restrictions.
Sincere thanks to Mr. Hifzur Rahman Ansari for his help in developing the webserver. We are also thankful to Dr Alok Kumar Mondal for proof reading of manuscript. This work was supported by grants from Council of Scientific and Industrial Research (CSIR) and Department of Biotechnology (DBT), Government of India.
- Limbird LE: Activation and attenuation of adenylate cyclase. The role of GTP-binding proteins as macromolecular messengers in receptor--cyclase coupling. Biochem J 1981, 195: 1–13.View ArticlePubMedPubMed CentralGoogle Scholar
- Chou KC: Coupling interaction between thromboxane A2 receptor and alpha-13 subunit of guanine nucleotide-binding protein. Journal of Proteome Research 2005, 4: 1681–1686. 10.1021/pr050145aView ArticlePubMedGoogle Scholar
- Walker JE, Saraste M, Runswick MJ, Gay NJ: Distantly related sequences in the alpha- and beta-subunits of ATP synthase, myosin, kinases and other ATP-requiring enzymes and a common nucleotide binding fold. EMBO J 1982, 1: 945–951.PubMedPubMed CentralGoogle Scholar
- Saraste M, Sibbald PR, Wittinghofer A: The P-loop--a common motif in ATP- and GTP-binding proteins. Trends Biochem Sci 1990, 15: 430–434. 10.1016/0968-0004(90)90281-FView ArticlePubMedGoogle Scholar
- Nobeli RA, Laskowski WS, Valdar , Thornton JM: On the molecular discrimination between adenine and guanine by proteins. Nucl Acids Res 2001, 29: 4294–4309. 10.1093/nar/29.21.4294View ArticlePubMedPubMed CentralGoogle Scholar
- Basu G, Sivanesan D, Kawabata T, Go N: Electrostatic Potential of Nucleotide-free Protein is Sufficient for Discrimination Between Adenine and Guanine-specific Binding Sites. Journal of Molecular Biology 2004, 342: 1053–1066. 10.1016/j.jmb.2004.07.047View ArticlePubMedGoogle Scholar
- Garg A, Bhasin M, Raghava GPS: Support vector machine-based method for subcellular localization of human proteins using amino acid compositions, their order, and similarity search. J Biol Chem 2005, 280: 14427–14432. 10.1074/jbc.M411789200View ArticlePubMedGoogle Scholar
- Kumar M, Gromiha MM, Raghava GPS: Identification of DNA-binding proteins using support vector machines and evolutionary profiles. BMC Bioinformatics 2007, 8: 463. 10.1186/1471-2105-8-463View ArticlePubMedPubMed CentralGoogle Scholar
- Cai YD, Liu XJ, Xu XB, Chou KC: Prediction of protein structural classes by support vector machines. Comput Chem 2002, 26: 293–296. 10.1016/S0097-8485(01)00113-9View ArticlePubMedGoogle Scholar
- Kumar M, Gromiha MM, Raghava GPS: Prediction of RNA binding sites in a protein using SVM and PSSM profile. Proteins 2007, 71: 189–194. 10.1002/prot.21677View ArticleGoogle 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/btg432View ArticlePubMedGoogle Scholar
- Terribilini M, Lee JH, Yan C, Jernigan RL, Honavar V, Dobbs D: Prediction of RNA binding sites in proteins from amino acid sequence. RNA 2006, 12: 1450–1462. 10.1261/rna.2197306View ArticlePubMedPubMed CentralGoogle Scholar
- Jeong E, Miyano S: A Weighted profile based method for protein-RNA interacting residue prediction. Lecture notes in computer science 2006, 3939: 123–139. full_textView ArticleGoogle Scholar
- Masters SB, Miller RT, Chi MH, Chang FH, Beiderman B, Lopez NG, Bourne HR: Mutations in the GTP-binding site of GS alpha alter stimulation of adenylyl cyclase. J Biol Chem 1989, 264: 15467–15474.PubMedGoogle Scholar
- Cai YD, Liu XJ, Xu XB, Chou KC: Support vector machines for predicting the specificity of GalNAc-transferase. Peptides 2002, 23: 205–208. 10.1016/S0196-9781(01)00597-6View ArticlePubMedGoogle Scholar
- Chauhan JS, Mishra NK, Raghava GP: Identification of ATP binding residues of a protein from its primary sequence. BMC Bioinformatics 2009, 10: 434. 10.1186/1471-2105-10-434View ArticlePubMedPubMed CentralGoogle Scholar
- Lata S, Sharma BK, Raghava GPS: Analysis and prediction of antibacterial peptides. BMC Bioinformatics 2007, 8: 263. 10.1186/1471-2105-8-263View ArticlePubMedPubMed CentralGoogle Scholar
- Garg A, Raghava GPS: A machine learning based method for the prediction of secretory proteins using amino acid composition, their order and similarity-search. In Silico Biology 2008, 8: 0012.Google Scholar
- Kaur H, Raghava GPS: Prediction of beta-turns in proteins from multiple alignment using neural network. Protein Sci 2003, 12: 627–634. 10.1110/ps.0228903View ArticlePubMedPubMed CentralGoogle Scholar
- Chou KC, Shen HB: ProtIdent: A web server for identifying proteases and their types by fusing functional domain and sequential evolution information. Biochem Biophys Res Comm 2008, 376: 321–325. 10.1016/j.bbrc.2008.08.125View ArticlePubMedGoogle Scholar
- Saito M, Go M, Shira T: An empirical approach for detecting nucleotide-binding sites on proteins. Protein Eng Des Sel 2006, 19: 67–75. 10.1093/protein/gzj002View ArticlePubMedGoogle Scholar
- Bauer RA, Günther S, Jansen D, Heeger C, Thaben P, Preissner R: SuperSite: dictionary of metabolite and drug binding sites in proteins. Nucleic Acids Res 2009, 37: 195–200. 10.1093/nar/gkn618View ArticleGoogle Scholar
- Sobolev V, Sorokine A, Prilusky J, Abola EE, Edelman M: Automated analysis of interatomic contacts in proteins. Bioinformatics 1999, 15: 327–332. 10.1093/bioinformatics/15.4.327View ArticlePubMedGoogle Scholar
- Bhasin M, Raghava GPS: Pcleavage: an SVM based method for prediction of constitutive proteasome and immunoproteasome cleavage sites in antigenic sequences. Nucleic Acids Res 2005, 33: W202–7. 10.1093/nar/gki587View ArticlePubMedPubMed CentralGoogle Scholar
- Chou KC, Shen HB: Signal-CF: a subsite-coupled and window-fusing approach for predicting signal peptides. Biochem Biophys Res Comm 2007, 357: 633–640. 10.1016/j.bbrc.2007.03.162View ArticlePubMedGoogle Scholar
- Chou KC, Zhang CT: Review: Prediction of protein structural classes. Crit Rev Biochem Mol Biol 1995, 30: 275–349. 10.3109/10409239509083488View ArticlePubMedGoogle Scholar
- Zhou XB, Chen C, Li ZC, Zou XY: Using Chou's amphiphilic pseudo-amino acid composition and support vector machine for prediction of enzyme subfamily classes. J Theor Biol 2007, 248: 546–551. 10.1016/j.jtbi.2007.06.001View ArticlePubMedGoogle Scholar
- Zell A, Mamier G: Stuttgart neural network simulator, version 4.2. University of Stuttgart, Stuttgart, Germany;
- Rumelhart DE, Hinton GE, Williams RJ: Learning representations by back-propagating errors. Nature 1986, (323):533–536. 10.1038/323533a0
- Joachims T: Making large scale SVM learning practical. In Advances in kernel methods:Support Vector Learning. Edited by: Scholkopf B, Burges C, Smola A. Cambridge: MIT Press; 1999:169–184.Google Scholar
- Vapnik V: The nature of statistical learning theory. New York:Springer; 1995.View ArticleGoogle Scholar
- Xiao X, Lin WZ, Chou KC: Using grey dynamic modeling and pseudo amino acid composition to predict protein structural classes. J Comput Chem 2008, 29: 2018–2024. 10.1002/jcc.20955View 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.3389View ArticlePubMedPubMed CentralGoogle 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.