Prediction of protein binding sites in protein structures using hidden Markov support vector machine.
Prediction of protein binding sites in protein structures using hidden Markov support vector machine.
复制标题
使用隐马尔可夫支持向量机预测蛋白质结构中的蛋白质结合位点
DOI:
10.1186/1471-2105-10-381
复制
发表时间:
2009-11-20
影响因子:
3
通讯作者:
Wang X
中科院分区:
文献类型:
--
作者:
Liu B;Wang X;Lin L;Tang B;Dong Q;Wang X
BackgroundPredicting 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.ResultsIn 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.ConclusionThe 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.
登录
查看更多内容
DOI:
10.1016/s0097-8485(96)80004-0
发表时间:
1996-03-01
期刊:
COMPUTERS & CHEMISTRY
影响因子:
--
作者:
Gribskov, M;Robinson, NL
通讯作者:
Robinson, NL
影响因子:
4.3
作者:
Kim WK;Henschel A;Winter C;Schroeder M
通讯作者:
Schroeder M
影响因子:
64.8
作者:
CHOTHIA, C;JANIN, J
通讯作者:
JANIN, J
影响因子:
2.4
作者:
Koike, A;Takagi, T
通讯作者:
Takagi, T
影响因子:
3
作者:
Henschel, Andreas;Winter, Christof;Kim, Wan Kyu;Schroeder, Michael
通讯作者:
Schroeder, Michael