Optimal spliced alignments of short sequence reads
- 9 August 2008
- journal article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 24 (16), i174-i180
- https://doi.org/10.1093/bioinformatics/btn300
Abstract
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. 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. 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.Keywords
This publication has 21 references indexed in Scilit:
- Velvet: Algorithms for de novo short read assembly using de Bruijn graphsGenome Research, 2008
- Accurate splice site prediction using support vector machinesBMC Bioinformatics, 2007
- Whole-Genome Sequencing and Assembly with High-Throughput, Short-Read TechnologiesPLOS ONE, 2007
- PALMA: mRNA to genome alignments using large margin algorithmsBioinformatics, 2007
- Learning Interpretable SVMs for Biological Sequence ClassificationBMC Bioinformatics, 2006
- Improved spliced alignment from an information theoretic approachBioinformatics, 2005
- An introduction to kernel-based learning algorithmsIEEE Transactions on Neural Networks, 2001
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Support-vector networksMachine Learning, 1995
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981