Application of Systems Biology and Bioinformatics Methods in Biochemistry and Biomedicine 2014View this Special Issue
Research Article | Open Access
Yan Liu, Wenxiang Gu, Wenyi Zhang, Jianan Wang, "Predict and Analyze Protein Glycation Sites with the mRMR and IFS Methods", BioMed Research International, vol. 2015, Article ID 561547, 6 pages, 2015. https://doi.org/10.1155/2015/561547
Predict and Analyze Protein Glycation Sites with the mRMR and IFS Methods
Glycation is a nonenzymatic process in which proteins react with reducing sugar molecules. The identification of glycation sites in protein may provide guidelines to understand the biological function of protein glycation. In this study, we developed a computational method to predict protein glycation sites by using the support vector machine classifier. The experimental results showed that the prediction accuracy was 85.51% and an overall MCC was 0.70. Feature analysis indicated that the composition of -spaced amino acid pairs feature contributed the most for glycation sites prediction.
Glycation is one of the most important posttranslation modifications (PTMs) of proteins. Glycation is a two-step nonenzymatic reaction. First, generate the stable Amadori product based on the unstable Schiff base. Secondly, the advanced glycation end products (AGEs) are generated at the second step. According to the clinical researches , the advanced glycation end products are involved in a variety of human diseases, such as diabetes, Alzheimer’s disease, and Parkinson’s disease. The glycation mechanism might be a key to the treatment of the above diseases. Identification of the glycation sites in protein may provide guidelines to understand the biological function of proteins glycation.
It is important to note that glycation and glycosylation are different. Glycation is the result of typically covalent bonding of a protein or lipid molecule with a sugar molecule, such as fructose or glucose, without the controlling action of an enzyme. As opposed to the nonenzymatic chemical reaction of glycation, glycosylation is an enzyme-directed site-specific process. Five types of glycosylation are produced, including N-glycosylation, O-glycosylation, C-mannosylation, glypiation, and phosphoglycans linked through the phosphate of a phosphoserine .
Although some high-throughput proteomics experimental methods  have been developed to find posttranslational modification (PTM) sites [4–6], it is still difficult to confirm glycation sites by these methods. Several computational approaches to predict glycosylation sites have been reported. Li et al.  trained SVM based on physicochemical properties of amino acids and a 0/1 system which was only focusing on the O-glycosylation in mammalian proteins; Caragea et al.  used ensemble method to identify N-linked, O-linked, and C-linked glycosylation. Chen et al.  predicted mucin-type O-glycosylation serine/threonine (S/T) sites in mammalian proteins with the assistance of SVM based on the composition of -spaced amino acid pairs (CKSAAP) encoding scheme.
Compared with the glycosylation, the determination of protein glycation sites was more difficult. Therefore, to the best of our knowledge, such computer methods for prediction of glycation sites were rarely mentioned in literatures except the GlyNN . GlyNN was built by combining 60 artificial neural networks with a balloting procedure and obtained the maximal Matthews correlation coefficient (MCC) of 0.58 with the sequence size 23.
Here, we used support vector machine to develop a predictor for glycation sites of lysine. Amino acid occurrence frequency, amino acid factors, and the composition of -spaced amino acid pairs (CKSAAP) were used to encode glycation site peptides. We reduced the support vector machine classifier input features dimension by utilizing the maximum relevance minimum redundancy (mRMR) method followed by the incremental feature selection (IFS) procedure. The experimental result showed that our predictor achieved an overall MCC of 0.7063. Feature analysis prompted that the CKSAAP encoding was efficient to capture a glycation site’s characters. The detailed analysis results in this work may provide useful insights to detect glycation sites. A web server (PreGly) that implemented the proposed method was freely available: http://188.8.131.52:8080/GlycationPre/.
2. Materials and Methods
In this study, we took the GlyNN  dataset as the benchmark dataset. It was convenient to compare the performance of PreGly and GlyNN, since they were built on the same dataset. Johansen et al.  collected experimentally validated glycation sites by searching hundreds of research papers manually. The whole dataset contained 89 glycation sites (positive samples) and 126 nonglycation sites (negative samples) from 20 proteins.
Subsequently, we extracted each glycation site peptide with the window size 23, with 11 residues upstream and 11 residues downstream of the glycation site. To make sure that each sequence window size was fixed to 23, we complemented a nonexisting residue “O” to the peptide, less than 23 amino acid residues. The window size fixed to 23 is rational and has been confirmed experimentally .
However, for the amino acid site near the end of the peptide, 23 may be a too much window size. We removed peptides which extended too many “O” residues to test the influence of “O” residues on the predictor result. The experimental result yielded a prediction accuracy of 82.74% (Sn = 71.84%, Sp = 0.9136, and MCC = 0.6527) and the prediction performance was also better than GlyNN . To ensure the data integrity, we still applied the window size 23 on the entire data. The whole dataset was provided in the supporting information available online at http://dx.doi.org/10.1155/2015/561547 (Supporting Information S1).
2.2. Feature Space
2.2.1. Amino Acid Occurrence Frequency Feature
We calculated the occurrence frequencies of the 20 native amino acids in given proteins . Given a protein , is the length of the peptide in protein , and the number of th amino acid in the peptide is . We use as the amino acid occurrence frequency feature:
2.2.2. -Spaced Amino Acid Pairs Feature
The composition of -spaced amino acid pairs (CKSAAP) encode scheme has been employed to predict various PTMs [6, 9]. Given 20 native amino acids and one complementary residue “O,” there are 441 basic amino acid pair types: . The basic amino acid pair types are enlarged to the -spaced amino acid pair types. For example, the space number of “A∧∧A” is equal to 2. We examined three predictors built with the parameter , and 5 and obtained that the maximum accuracy was 85.51% with .
2.2.3. Amino Acid Factors Feature
AA Index database  collected the various physicochemical and biochemical properties of amino acids. Atchley et al.  performed multivariate statistical analyses on AA Index to produce five multidimensional patterns of attribute covariation which reflected polarity (AA Factor 1), secondary structure (AA Factor 2), molecular volume (AA Factor 3), codon diversity (AA Factor 4), and electrostatic charge (AA Factor 5). These five factors have been successfully used to solve several different biology problems, such as [7, 11].
As mentioned above, we encoded each glycation site peptide by 21 features of amino acid occurrence frequency, 5 features of amino acid factors, and 441 × 4 features of -spaced amino acid pairs. Therefore, for each peptide consisting of 23 amino acid residues, there were a total of 21 + 5 × 23 + 441 × 4 = 1900 features (Supporting Information S5).
2.3. The mRMR Method
The maximum relevancy minimum redundancy (mRMR) method  is used to rank features based on the criterion of maximum relevance to the target and the minimum redundancy between features. On the rank list, features with the small index are considered the “good” features, and these “good” features may provide more information for glycation site prediction.
The maximum relevancy criterion can be expressed aswhere calculates the relevance between the feature in and the target .
And the minimum redundancy (MR) can be represented aswhere is the already-selected features set with the set size and is the to-be-selected features set with the set size . The MR calculates the redundancy between the feature in and all the other features in .
2.4. Incremental Feature Selection
Incremental feature selection (IFS) method  is used to select the optimal features. Features in the mRMR feature rank list are added one by one during the IFS procedure. Then, we construct feature sets when there are features on the list and the th feature set is composed of features.
2.5. Support Vector Machine
Vapnik  first proposed the support vector machine (SVM) algorithm. In principle, SVM is a two-class classifier. Given training vectors and their class labels , , SVM solves the problem:where is a normal vector perpendicular to the hyperplane and are slake variables for allowing misclassifications.
The support vector machine has been widely used in bioinformation [9, 17]. In this work, we implement LIBSVM package  with RBF function. The two parameters penalty parameter and kernel parameter are found by using a grid search strategy based on 10-fold cross-validation.
2.6. Performance Evaluation
In statistical prediction, three cross-validation methods are often used to examine a predictor for its anticipated accuracy: -fold cross-validation test, independent dataset test, and jackknife test . We chose the 10-fold cross-validation test to examine the quality of our predictor. During the 10-fold cross-validation test process, the peptide samples were divided into ten parts. Each part of them was in turn as test samples, and the remaining nine parts were as the train samples.
Four parameters, sensitivity (Sn), specificity (Sp), accuracy (Ac), and Mathew correlation coefficients (MCC), are used to evaluate the predictor performance:where TP, TN, FP, and FN represent the true positive, the true negative, the false positive, and the false negative, respectively. MCC (Matthew correlation coefficient) reflects both the sensitivity and the specificity of a predictor.
3. Results and Discussion
3.1. The Predictors’ Performance with Different
In order to find the optimal value of the CKSAAP feature encoding which can detect the glycation sites with high accuracy, we investigated the predictor performance of , and 5. The highest accuracy was 85.51% when (Supporting Information S2).
3.2. The mRMR and IFS Results
First of all, by using the mRMR method, a total of 1900 features were ranked. Then we implemented the IFS procedure based on the mRMR rank list and generated 1900 feature sets. Subsequently, we built 1900 predictors and tested those predictors (Supporting Information S3) and plotted the IFS curve in Figure 1. It can be seen from Figure 1 that the maximum MCC was 0.7063 by using the top 167 features, and these 167 features (Supporting Information S4) were considered the optimal features to train our final predictor.
3.3. Optimal Features Analysis
In the 167 optimal features, over 90% features (153 CKSAAP features in 167 optimal features) were CKSAAP features. Thus, we inferred that the CKSAAP feature was the most importance feature for the prediction of glycation sites. We also listed the top 10 features of the optimal features in Table 1. It can be seen from Table 1 that there were 7 CKSAAP features in top 10 features. So we suggested that the CKSAAP feature was the most suitable feature for glycation sites prediction.
The feature selection methods could find out the most important CKSAAP pairs. For example, the first feature in Table 1 was the CKSAAP pair “S∧∧∧∧W,” which suggested that a potential glycation residue existed if the CKSAAP pair “S∧∧∧∧W” surrounding the residue have high abundance. We further investigated the classifications of the 20 native amino acids of the optimal features (Figure 2). From Figure 2, we can see that the polar amino acid and the nonpolar amino acid were vital characteristics for the glycation sites prediction.
We also noted that the AA Factor features played some roles in glycation sites’ prediction. There were one polarity factor, two secondary structure factors, five molecular volume factors, one codon diversity factor, and five electrostatic charge factors in the 14 AA Factor features. And the sites distributions of AA Factor were shown in Figure 3. Figure 3 indicated that site 23 was the most important site for glycation sites’ prediction and site 3 was the secondary important site for glycation sites prediction. Those results are consistent with the literature , which reported that the N-terminal parts of the human proteins have a higher predicted glycation potential than the other parts of the proteins.
3.4. Compare with Previous Method
In this section, we compared the proposed method with a previous method GlyNN . As can be seen from Table 2, the performance of PreGly was better than that of GlyNN. The prediction accuracy of PreGly was 85.51% and the MCC was 0.70 with 167 optimal features. And from these better prediction results, we speculated that the CKSAAP encoding may provide more information than the consensus sequence motif.
3.5. The Performance of PreGly on Independent Dataset
We have reported that PreGly could achieve a better prediction performance. To objectively assess our predictor, we further tested our method on an independent dataset. 17 protein sequences containing experimentally validated glycation sites were retrieved from Uniport as the independent dataset (Supporting Information S6). Glycation sites labeled by “potential” and “probable” were removed. Finally, a total of 82 glycation sites and 117 not glycated sites in 17 proteins were retrieved. For each glycation site or not glycated site, a 23-residue peptide containing central glycation/not glycated site and 11 residues upstream and 11 residues downstream of the glycation/not glycated site was extracted. The peptides with length less than 23 were extended by “O” residue.
After tenfold cross-validation, the average prediction accuracy (Ac), sensitivity (Sn), specificity (Sp), and MCC of PreGly on the independent dataset were 79.92%, 64.2%, 91.57%, and 0.5849.
In the 167 optimal features, there were 153 CKSAAP features, 14 AA Factor features, and none of the amino acid occurrence frequency features. The feature distribution of optimal features set was shown in Figure 4. Considering the better performance of PreGly, it was possible that the CKSAAP  encoding was particularly suitable for the prediction of glycation site, which was to say that the short linear motifs may be more important than position-specific patterns in glycation sites’ recognization. These analysis results reinforced the viewpoint that there may be no significant difference of mutations to other amino acids for each glycation site . Figure 4 also implied that the amino acid occurrence frequency feature was faintly contributed to glycation sites prediction.
The amino acids classification distribution (Figure 2) revealed that the polar amino acid and the nonpolar amino acid were effective for the glycation sites prediction. Apart from this, we further investigated the 20 native amino acids quantity in the optimal features (Figure 5). As shown in Figure 5, the numbers of Leucine and Valine were more than the other amino acids, whereas Asparagine and Tryptophan were the two kinds of amino acids in the least number. It was worthwhile to point out that the Asparagine and Tryptophan may provide useful clues to validate new glycation sites in protein sequences.
In this work, we built a predict model for protein glycation site prediction based on support vector machine. Our predictor reached an overall MCC of 0.706324, and sensitivity, specificity, and accuracy were 71.06%, 95.85%, and 85.51%, respectively. Glycation is involved in several diseases such as Alzheimer. It was advisable to identify glycation site for the associated diseases treatment. Detailed analysis conducted in this study may provide insights into understanding the mechanism of glycation and provide clues for the treatments of glycation related disease [21–28].
Conflict of Interests
The authors declare no conflict of interests.
This research was sponsored by the National Natural Science Foundation of China under no. 61370156 and no. 60803102 and Natural Science Foundation of Jilin Province under Grant nos. 201215006 and 201101004.
The supplementary material includes the training dataset and the independent dataset of our manuscript.
- X. Ling, N. Sakashita, M. Takeya, R. Nagai, S. Horiuchi, and K. Takahashi, “Immunohistochemical distribution and subcellular localization of three distinct specific molecular structures of advanced glycation end products in human tissues,” Laboratory Investigation, vol. 78, no. 12, pp. 1591–1606, 1998.
- N. Blom, T. Sicheritz-Pontén, R. Gupta, S. Gammeltoft, and S. Brunak, “Prediction of post-translational glycosylation and phosphorylation of proteins from the amino acid sequence,” Proteomics, vol. 4, no. 6, pp. 1633–1649, 2004.
- K. C. Chou and C. T. Zhang, “Prediction of protein structural classes,” Critical Reviews in Biochemistry and Molecular Biology, vol. 30, no. 4, pp. 275–349, 1995.
- G. Ji, X. Wu, Y. Shen, J. Huang, and Q. Q. Li, “A classification-based prediction model of messenger RNA polyadenylation sites,” Journal of Theoretical Biology, vol. 265, no. 3, pp. 287–296, 2010.
- L. L. Hu, S. B. Wan, S. Niu et al., “Prediction and analysis of protein palmitoylation sites,” Biochimie, vol. 93, no. 3, pp. 489–496, 2011.
- W. Zhang, X. Xu, M. Yin, N. Luo, J. Zhang, and J. Wang, “Prediction of methylation sites using the composition of K-spaced amino acid pairs,” Protein and Peptide Letters, vol. 20, no. 8, pp. 911–917, 2013.
- S. Li, B. Liu, R. Zeng, Y. Cai, and Y. Li, “Predicting O-glycosylation sites in mammalian proteins by using SVMs,” Computational Biology and Chemistry, vol. 30, no. 3, pp. 203–208, 2006.
- C. Caragea, J. Sinapov, A. Silvescu, D. Dobbs, and V. Honavar, “Glycosylation site prediction using ensembles of Support Vector Machine classifiers,” BMC Bioinformatics, vol. 8, article 438, 2007.
- Y.-Z. Chen, Y.-R. Tang, Z.-Y. Sheng, and Z. Zhang, “Prediction of mucin-type O-glycosylation sites in mammalian proteins using the composition of -spaced amino acid pairs,” BMC Bioinformatics, vol. 9, article 101, 2008.
- M. B. Johansen, L. Kiemer, and S. Brunak, “Analysis and prediction of mammalian protein glycation,” Glycobiology, vol. 16, no. 9, pp. 844–853, 2006.
- C. Zou, J. Gong, and H. Li, “An improved sequence based prediction protocol for DNA-binding proteins using SVM and comprehensive feature analysis,” BMC Bioinformatics, vol. 14, article 90, 2013.
- S. Kawashima, P. Pokarowski, M. Pokarowska, A. Kolinski, T. Katayama, and M. Kanehisa, “AAindex: amino acid index database, progress report 2008,” Nucleic Acids Research, vol. 36, no. 1, pp. D202–D205, 2008.
- W. R. Atchley, J. Zhao, A. D. Fernandes, and T. Druke, “Solving the protein sequence metric problem,” Proceedings of the National Academy of Sciences of the United States of America, vol. 102, no. 18, pp. 6395–6400, 2005.
- H. Peng, F. Long, and C. Ding, “Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 8, pp. 1226–1238, 2005.
- B.-Q. Li, L.-L. Hu, S. Niu, Y.-D. Cai, and K.-C. Chou, “Predict and analyze S-nitrosylation modification sites with the mRMR and IFS approaches,” Journal of Proteomics, vol. 75, no. 5, pp. 1654–1665, 2012.
- V. N. Vapnik, The Nature of Statistical Learning Theory, Springer, New York, NY, USA, 1995.
- T.-K. Seo, “Classification of nucleotide sequences using support vector machines,” Journal of Molecular Evolution, vol. 71, no. 4, pp. 250–267, 2010.
- C. C. Chang and C. J. Lin, “LIBSVM: a library for support vector machines,” 2001, http://www.csie.ntu.edu.tw/~cjlin/libsvm.
- V. Neduva, R. Linding, I. Su-Angrand et al., “Systematic discovery of new recognition peptides mediating protein interaction networks,” PLoS Biology, vol. 3, no. 12, 2005.
- R. Apweiler, M. J. Martin, C. O'Donovan et al., “The universal protein resource (UniProt) in 2010,” Nucleic Acids Research, vol. 38, pp. D142–D148, 2010.
- J. Gao, J. Wang, and M. Yin, “Experimental analyses on phase transitions in compiling satisfiability problems,” Science China Information Sciences, pp. 1–11, 2015.
- X. Li and M. Yin, “Modified cuckoo search algorithm with self adaptive parameter method,” Information Sciences, vol. 298, pp. 80–97, 2015.
- X. Li and M. Yin, “Modified differential evolution with self-adaptive parameters method,” Journal of Combinatorial Optimization, 2014.
- P. Huang and M. Yin, “An upper (lower) bound for Max (MIN) CSP,” Science China Information Sciences, vol. 57, no. 7, pp. 1–9, 2014.
- X. Li and M. Yin, “Multiobjective binary biogeography based optimization for feature selection using gene expression data,” IEEE Transactions on Nanobioscience, vol. 12, no. 4, pp. 343–353, 2013.
- X. Li and M. Yin, “An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure,” Advances in Engineering Software, vol. 55, pp. 10–31, 2013.
- X. Li and M. Yin, “Application of differential evolution algorithm on self-potential data,” PLoS ONE, vol. 7, no. 12, Article ID e51199, 2012.
- X. Zhao, W. Zhang, X. Xu, Z. Ma, and M. Yin, “Prediction of protein phosphorylation sites by using the composition of -spaced amino acid pairs,” PLoS ONE, vol. 7, no. 10, Article ID e46302, 2012.
Copyright © 2015 Yan Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.