Fast and accurate multi-class protein fold recognition with spatial sample kernels

Pavel Kuksa, Pai-Hsi Huang, Vladimir Pavlovic*

Department of Computer Science, Rutgers University, Piscataway, NJ 08854, USA. vladimir@cs.rutgers.edu

Proc LSS Comput Syst Bioinform Conf. August, 2008. Vol. 7, p. 133-143. Full-Text PDF

*To whom correspondence should be addressed.

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.