DocumentCode
2482302
Title
Fast protein homology and fold detection with sparse spatial sample kernels
Author
Kuksa, Pavel ; Huang, Pai-Hsi ; Pavlovic, Vladimir
Author_Institution
Dept. of Comput. Sci., Rutgers Univ., Piscataway, NJ
fYear
2008
fDate
8-11 Dec. 2008
Firstpage
1
Lastpage
4
Abstract
In this work we present a new string similarity feature, the sparse spatial sample (SSS). An SSS is a set of short substrings at specific spatial displacements contained in the original string. Using this feature we induce the SSS kernel (SSSK) which measures the agreement in the SSS content between pairs of strings. The SSSK yields better prediction performance at substantially reduced computational cost than existing algorithms for sequence classification tasks. We show that on the task of predicting the functional and structural classes of proteins, the SSSK results in state-of-the-art performance across several benchmark sets in both supervised and semi-supervised learning settings. The results have immediate practical value for accurate protein superfamily and fold classification and may be similarly extended to other sequence modeling domains.
Keywords
biology computing; learning (artificial intelligence); molecular biophysics; proteins; fast protein homology; fold detection; semisupervised learning; sequence classification; sparse spatial sample kernels; supervised learning; Biological system modeling; Biology computing; Classification algorithms; Computational efficiency; Computer science; Hidden Markov models; Kernel; Protein engineering; Semisupervised learning; Sequences;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2008. ICPR 2008. 19th International Conference on
Conference_Location
Tampa, FL
ISSN
1051-4651
Print_ISBN
978-1-4244-2174-9
Electronic_ISBN
1051-4651
Type
conf
DOI
10.1109/ICPR.2008.4761450
Filename
4761450
Link To Document