Skip Navigation

Bioinformatics 2008 24(16):i174-i180; doi:10.1093/bioinformatics/btn300
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by De Bona, F.
Right arrow Articles by Rätsch, G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by De Bona, F.
Right arrow Articles by Rätsch, G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Optimal spliced alignments of short sequence reads

Fabio De Bona 1, Stephan Ossowski 2, Korbinian Schneeberger 2 and Gunnar Rätsch 1,*

1Friedrich Miescher Laboratory, Max Planck Society, Spemannstr. 39, 72076 Tübingen and 2Max Planck Institute for Developmental Biology, Spemannstr. 35, 72076 Tübingen, Germany

*To whom correspondence should be addressed.


   Abstract

Motivation: Next generation sequencing technologies open exciting new possibilities for genome and transcriptome sequencing. While reads produced by these technologies are relatively short and error prone compared to the Sanger method their throughput is several magnitudes higher. To utilize such reads for transcriptome sequencing and gene structure identification, one needs to be able to accurately align the sequence reads over intron boundaries. This represents a significant challenge given their short length and inherent high error rate.

Results: We present a novel approach, called QPALMA, for computing accurate spliced alignments which takes advantage of the read's quality information as well as computational splice site predictions. Our method uses a training set of spliced reads with quality information and known alignments. It uses a large margin approach similar to support vector machines to estimate its parameters to maximize alignment accuracy. In computational experiments, we illustrate that the quality information as well as the splice site predictions help to improve the alignment quality. Finally, to facilitate mapping of massive amounts of sequencing data typically generated by the new technologies, we have combined our method with a fast mapping pipeline based on enhanced suffix arrays. Our algorithms were optimized and tested using reads produced with the Illumina Genome Analyzer for the model plant Arabidopsis thaliana.

Availability: Datasets for training and evaluation, additional results and a stand-alone alignment tool implemented in C++ and python are available at http://www.fml.mpg.de/raetsch/projects/qpalma.

Contact: Gunnar.Raetsch{at}tuebingen.mpg.de



Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Brief BioinformHome page
D. S. Horner, G. Pavesi, T. Castrignano, P. D. De Meo, S. Liuni, M. Sammeth, E. Picardi, and G. Pesole
Bioinformatics approaches for genomics and post genomics applications of next-generation sequencing
Brief Bioinform, October 27, 2009; (2009) bbp046v1.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
C. Trapnell, L. Pachter, and S. L. Salzberg
TopHat: discovering splice junctions with RNA-Seq
Bioinformatics, May 1, 2009; 25(9): 1105 - 1111.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
R. Homann, D. Fleer, R. Giegerich, and M. Rehmsmeier
mkESA: enhanced suffix array construction tool
Bioinformatics, April 15, 2009; 25(8): 1084 - 1085.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.