Academic Journals Database
Disseminating quality controlled scientific knowledge

Prediction of protein binding sites in protein structures using hidden Markov support vector machine

ADD TO MY LIST
 
Author(s): Liu Bin | Wang Xiaolong | Lin Lei | Tang Buzhou | Dong Qiwen | Wang Xuan

Journal: BMC Bioinformatics
ISSN 1471-2105

Volume: 10;
Issue: 1;
Start page: 381;
Date: 2009;
Original page

ABSTRACT
Abstract Background Predicting the binding sites between two interacting proteins provides important clues to the function of a protein. Recent research on protein binding site prediction has been mainly based on widely known machine learning techniques, such as artificial neural networks, support vector machines, conditional random field, etc. However, the prediction performance is still too low to be used in practice. It is necessary to explore new algorithms, theories and features to further improve the performance. Results In this study, we introduce a novel machine learning model hidden Markov support vector machine for protein binding site prediction. The model treats the protein binding site prediction as a sequential labelling task based on the maximum margin criterion. Common features derived from protein sequences and structures, including protein sequence profile and residue accessible surface area, are used to train hidden Markov support vector machine. When tested on six data sets, the method based on hidden Markov support vector machine shows better performance than some state-of-the-art methods, including artificial neural networks, support vector machines and conditional random field. Furthermore, its running time is several orders of magnitude shorter than that of the compared methods. Conclusion The improved prediction performance and computational efficiency of the method based on hidden Markov support vector machine can be attributed to the following three factors. Firstly, the relation between labels of neighbouring residues is useful for protein binding site prediction. Secondly, the kernel trick is very advantageous to this field. Thirdly, the complexity of the training step for hidden Markov support vector machine is linear with the number of training samples by using the cutting-plane algorithm.

Tango Rapperswil
Tango Rapperswil

     Save time & money - Smart Internet Solutions