PLoS Computational Biology (Sep 2009)

Fast mapping of short sequences with mismatches, insertions and deletions using index structures.

  • Steve Hoffmann,
  • Christian Otto,
  • Stefan Kurtz,
  • Cynthia M Sharma,
  • Philipp Khaitovich,
  • Jörg Vogel,
  • Peter F Stadler,
  • Jörg Hackermüller

DOI
https://doi.org/10.1371/journal.pcbi.1000502
Journal volume & issue
Vol. 5, no. 9
p. e1000502

Abstract

Read online

With few exceptions, current methods for short read mapping make use of simple seed heuristics to speed up the search. Most of the underlying matching models neglect the necessity to allow not only mismatches, but also insertions and deletions. Current evaluations indicate, however, that very different error models apply to the novel high-throughput sequencing methods. While the most frequent error-type in Illumina reads are mismatches, reads produced by 454's GS FLX predominantly contain insertions and deletions (indels). Even though 454 sequencers are able to produce longer reads, the method is frequently applied to small RNA (miRNA and siRNA) sequencing. Fast and accurate matching in particular of short reads with diverse errors is therefore a pressing practical problem. We introduce a matching model for short reads that can, besides mismatches, also cope with indels. It addresses different error models. For example, it can handle the problem of leading and trailing contaminations caused by primers and poly-A tails in transcriptomics or the length-dependent increase of error rates. In these contexts, it thus simplifies the tedious and error-prone trimming step. For efficient searches, our method utilizes index structures in the form of enhanced suffix arrays. In a comparison with current methods for short read mapping, the presented approach shows significantly increased performance not only for 454 reads, but also for Illumina reads. Our approach is implemented in the software segemehl available at http://www.bioinf.uni-leipzig.de/Software/segemehl/.