Learned random-walk kernels and empirical-map kernels for protein sequence classification.
Biological sequence classification (such as protein remote homology detection) solely based on sequence data is an important problem in computational biology, especially in the current genomics era, when large amount of sequence data are becoming available. Support vector machines (SVMs) based on mismatch string kernels were previously applied to solve this problem, achieving reasonable success. However, they still perform poorly on difficult protein families. In this paper, we propose two approaches to solve the protein remote homology detection problem: one uses a convex combination of random-walk kernels to approximate the random-walk kernel with the optimal random steps, and the other constructs an empirical-map kernel using a profile kernel. Both resulting kernels make use of a large number of pairwise sequence similarity information and unlabeled data; and have much better prediction performance than the best profile kernel directly derived from protein sequences. On a competitive Structural Classification Of Proteins (SCOP) benchmark dataset, the overall mean ROC(50) scores on 54 protein families we obtained using both approaches are above 0.90, which significantly outperform previous published results.
Min
Renqiang
R
Department of Computer Science, University of Toronto, Toronto, Canada.
Bonner
Anthony
A
Li
Jingjing
J
Zhang
Zhaolei
Z
D000595:Amino Acid Sequence; D019295:Computational Biology / Q000379:methods*; D017434:Protein Structure, Tertiary; D011506:Proteins / Q000737:chemistry* / Q000145:classification*; D020539:Sequence Analysis, Protein; D017386:Sequence Homology, Amino Acid
D011506:Proteins