Accurate splice site prediction using support vector machines

157Citations
Citations of this article
113Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Background: For splice site recognition, one has to solve two classification problems: discriminating true from decoy splice sites for both acceptor and donor sites. Gene finding systems typically rely on Markov Chains to solve these tasks. Results: In this work we consider Support Vector Machines for splice site recognition. We employ the so-called weighted degree kernel which turns out well suited for this task, as we will illustrate in several experiments where we compare its prediction accuracy with that of recently proposed systems. We apply our method to the genome-wide recognition of splice sites in Caenorhabditis elegans, Drosophila melanogaster, Arabidopsis thaliana, Danio rerio, and Homo sapiens. Our performance estimates indicate that splice sites can be recognized very accurately in these genomes and that our method outperforms many other methods including Markov Chains, GeneSplicer and SpliceMachine. We provide genome-wide predictions of splice sites and a stand-alone prediction tool ready to be used for incorporation in a gene finder. © 2007 Sonnenburg et al; licensee BioMed Central Ltd.

Cite

CITATION STYLE

APA

Sonnenburg, S., Schweikert, G., Philips, P., Behr, J., & Rätsch, G. (2007). Accurate splice site prediction using support vector machines. In BMC Bioinformatics (Vol. 8). https://doi.org/10.1186/1471-2105-8-S10-S7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free