Kuksa Pavel, Huang Pai-Hsi, Pavlovic Vladimir
Department of Computer Science, Rutgers University, Piscataway, NJ 08854, USA.
Comput Syst Bioinformatics Conf. 2008;7:133-43.
Establishing structural or functional relationship between sequences, for instance to infer the structural class of an unannotated protein, is a key task in biological sequence analysis. Recent computational methods such as profile and neighborhood mismatch kernels have shown very promising results for protein sequence classification, at the cost of high computational complexity. In this study we address the multi-class sequence classification problems using a class of string-based kernels, the sparse spatial sample kernels (SSSK), that are both biologically motivated and efficient to compute. The proposed methods can work with very large databases of protein sequences and show substantial improvements in computing time over the existing methods. Application of the SSSK to the multi-class protein prediction problems (fold recognition and remote homology detection) yields significantly better performance than existing state-of-the-art algorithms.
建立序列之间的结构或功能关系,例如推断未注释蛋白质的结构类别,是生物序列分析中的一项关键任务。最近的计算方法,如轮廓和邻域错配核,在蛋白质序列分类方面显示出非常有前景的结果,但代价是计算复杂度高。在本研究中,我们使用一类基于字符串的核——稀疏空间样本核(SSSK)来解决多类序列分类问题,这类核既有生物学动机又计算高效。所提出的方法可以处理非常大的蛋白质序列数据库,并且在计算时间上比现有方法有显著改进。将SSSK应用于多类蛋白质预测问题(折叠识别和远程同源性检测)产生的性能明显优于现有的最先进算法。