Logo image
Fine-grained protein fold assignment by support vector machines using generalized npeptide coding schemes and jury voting from multiple-parameter sets
Journal article   Open access   Peer reviewed

Fine-grained protein fold assignment by support vector machines using generalized npeptide coding schemes and jury voting from multiple-parameter sets

Chin-Sheng Yu, Jung-Ying Wang, Jinn-Moon Yang, Ping-Chiang Lyu, Chih-Jen Lin and Jenn-Kang Hwang
Proteins: Structure, Function and Genetics, Vol.50(4), pp.531-536
01/03/2003

Abstract

Fine-grained fold prediction Global sequence-coding scheme N-peptide Support vector machines
In the coarse-grained fold assignment of major protein classes, such as all-α, all-β, α + β, α/β proteins, one can easily achieve high prediction accuracy from primary amino acid sequences. However, the fine-grained assignment of folds, such as those defined in the Structural Classification of Proteins (SCOP) database, presents a challenge due to the larger amount of folds available. Recent study yielded reasonable prediction accuracy of 56.0% on an independent set of 27 most populated folds. In this communication, we apply the support vector machine (SVM) method, using a combination of protein descriptors based on the properties derived from the composition of n-peptide and jury voting, to the fine-grained fold prediction, and are able to achieve an overall prediction accuracy of 69.6% on the same independent set - significantly higher than the previous results. On 10-fold cross-validation, we obtained a prediction accuracy of 65.3%. Our results show that SVM coupled with suitable global sequence-coding schemes can significantly improve the fine-grained fold prediction. Our approach should be useful in structure prediction and modeling. © Wiley-Liss, Inc.
url
https://doi.org/10.1002/prot.10313View
Published (Version of record) Open

Related links

Metrics

1 Record Views

Details

Logo image