Optimal spliced alignments of short sequence reads

被引:65
作者
De Bona, Fabio [1 ]
Ossowski, Stephan [2 ]
Schneeberger, Korbinian [2 ]
Raetsch, Gunnar [1 ]
机构
[1] Max Planck Soc, Friedrich Miescher Lab, D-72076 Tubingen, Germany
[2] Max Planck Inst Dev Biol, D-72076 Tubingen, Germany
关键词
D O I
10.1093/bioinformatics/btn300
中图分类号
Q5 [生物化学];
学科分类号
071010 [生物化学与分子生物学]; 081704 [应用化学];
摘要
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 reads 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.
引用
收藏
页码:I174 / I180
页数:7
相关论文
共 27 条
[1]
Abouelhoda MI, 2002, LECT NOTES COMPUT SC, V2452, P449
[2]
Altun Y., 2003, P INT C MACHINE LEAR, P3
[3]
CORTES C, 1995, MACH LEARN, V20, P273, DOI 10.1023/A:1022627411411
[4]
Durbin R., 1998, Biological sequence analysis: Probabilistic models of proteins and nucleic acids
[5]
A computer program for aligning a cDNA sequence with a genomic DNA sequence [J].
Florea, L ;
Hartzell, G ;
Zhang, Z ;
Rubin, GM ;
Miller, W .
GENOME RESEARCH, 1998, 8 (09) :967-974
[6]
A decision-theoretic generalization of on-line learning and an application to boosting [J].
Freund, Y ;
Schapire, RE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) :119-139
[7]
Gene recognition via spliced sequence alignment [J].
Gelfand, MS ;
Mironov, AA ;
Pevzner, PA .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (17) :9061-9066
[8]
Whole-genome sequencing and variant discovery in C-elegans [J].
Hillier, LaDeana W. ;
Marth, Gabor T. ;
Quinlan, Aaron R. ;
Dooling, David ;
Fewell, Ginger ;
Barnett, Derek ;
Fox, Paul ;
Glasscock, Jarret I. ;
Hickenbotham, Matthew ;
Huang, Weichun ;
Magrini, Vincent J. ;
Richt, Ryan J. ;
Sander, Sacha N. ;
Stewart, Donald A. ;
Stromberg, Michael ;
Tsung, Eric F. ;
Wylie, Todd ;
Schedl, Tim ;
Wilson, Richard K. ;
Mardis, Elaine R. .
NATURE METHODS, 2008, 5 (02) :183-188
[9]
Kececioglu J, 2006, LECT NOTES COMPUT SC, V3909, P441, DOI 10.1007/11732990_37
[10]
Kent WJ, 2002, GENOME RES, V12, P656, DOI [10.1101/gr.229202. Article published online before March 2002, 10.1101/gr.229202]