Support vector machine prediction of signal peptide cleavage site using a new class of kernels for strings.
A new class of kernels for strings is introduced. These kernels can be used by any kernel-based data analysis method, including support vector machines (SVM). They are derived from probabilistic models to integrate biologically relevant information. We show how to compute the kernels corresponding to several classical probabilistic models, and illustrate their use by building a SVM for the problem of predicting the cleavage site of signal peptides from the amino-acid sequence of a protein. At a given rate of false positive this method retrieves up to 47% more true positives than the classical weight matrix method.
Vert
J P
JP
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan. Jean-Philippe.Vert@mines.org
D000465:Algorithms; D001185:Artificial Intelligence; D001665:Binding Sites; D005189:False Positive Reactions; D006868:Hydrolysis; D007700:Kinetics; D008390:Markov Chains; D021382:Protein Sorting Signals / Q000235:genetics*; D011506:Proteins / Q000737:chemistry*
D021382:Protein Sorting Signals; D011506:Proteins