Mohammad, T.A.S. and Nagarajaram, H.A. (2011) A hierarchical approach to protein fold prediction. Journal of Integrative Bioinformatics, 8 (1). p. 185. ISSN 1613-4516

Text J Integ Bioinformatics 8 p185.pdf Restricted to Repository staff only Download (529Kb) | Request a copy

Abstract

Fold recognition, assigning novel proteins to known structures, forms an important component of the overall protein structure discovery process. The available methods for protein fold recognition are limited by the low fold-coverage and/or low prediction accuracies. We describe here a new Support Vector Machine (SVM)-based method for protein fold prediction with high prediction accuracy and high fold-coverage. The new method of fold prediction with high fold-coverage was developed by training and testing on a large number of folds in order to make the method suitable for large scale fold predictions. However, presence of large number of folds in the training set made the classification task difficult as a consequence of increased complexity involved in binary classifications of SVMs. In order to overcome this complexity we adopted a hierarchical approach where fold-prediction is made in two steps. At the first step structural class of the query is predicted and at the second step fold is predicted within the predicted structural class. This decreased the complexity of the classification problem and also improved the overall fold prediction accuracy. To the best of our knowledge this is the first taxonomic fold recognition method to cover over 700 protein-folds and gives prediction accuracy of around 70% on a benchmark dataset. Since the new method gives rise to state of the art prediction performance and hence can be very useful for structural characterization of proteins discovered in various genomes.

Item Type:	Article
Additional Information:	[Open Access from Publisher]
Depositing User:	Users 2 not found.
Date Deposited:	02 Sep 2015 11:28
Last Modified:	02 Sep 2015 11:28
URI:	http://cdfd.sciencecentral.in/id/eprint/450

Actions (login required)

View Item