BMC Bioinformatics
|
Viewing options:Associated material:Related literature:- Articles citing this article
- Other articles by authors
- Related articles/pages
Tools:Post to:
|
Research articleIsoSVM – Distinguishing isoforms and paralogs on the protein levelMichael Spitzer1 , Stefan Lorkowski2,3 , Paul Cullen2 , Alexander Sczyrba4 and Georg Fuellen1,5  1
Division of Bioinformatics, Biology Department, Schlossplatz 4, 48149 Münster, Germany 2
Leibniz Institute of Arteriosclerosis Research, Domagkstr. 3, 48149 Münster, Germany 3
Institute of Biochemistry, Wilhelm-Klemm-Str. 2, 48149 Münster, Germany 4
Faculty of Technology, Research Group in Practical Computer Science, University of Bielefeld,Postfach 10 01 31, 33501 Bielefeld, Germany 5
Department of Medicine, AG Bioinformatics, Domagkstr. 3, 48149 Münster, Germany author email corresponding author email
BMC Bioinformatics 2006,
7:110doi:10.1186/1471-2105-7-110 Abstract
Background
Recent progress in cDNA and EST sequencing is yielding a deluge of sequence data. Like database search results and proteome databases, this data gives rise to inferred protein sequences without ready access to the underlying genomic data. Analysis of this information (e.g. for EST clustering or phylogenetic reconstruction from proteome data) is hampered because it is not known if two protein sequences are isoforms (splice variants) or not (i.e. paralogs/orthologs). However, even without knowing the intron/exon structure, visual analysis of the pattern of similarity across the alignment of the two protein sequences is usually helpful since paralogs and orthologs feature substitutions with respect to each other, as opposed to isoforms, which do not.
Results
The IsoSVM tool introduces an automated approach to identifying isoforms on the protein level using a support vector machine (SVM) classifier. Based on three specific features used as input of the SVM classifier, it is possible to automatically identify isoforms with little effort and with an accuracy of more than 97%. We show that the SVM is superior to a radial basis function network and to a linear classifier. As an example application we use IsoSVM to estimate that a set of Xenopus laevis EST clusters consists of approximately 81% cases where sequences are each other's paralogs and 19% cases where sequences are each other's isoforms. The number of isoforms and paralogs in this allotetraploid species is of interest in the study of evolution.
Conclusion
We developed an SVM classifier that can be used to distinguish isoforms from paralogs with high accuracy and without access to the genomic data. It can be used to analyze, for example, EST data and database search results. Our software is freely available on the Web, under the name IsoSVM. |