A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Bioinformatics
Bioinformatics
Bioinformatics
An algorithm for mapping short reads to a dynamically changing genomic sequence
Journal of Discrete Algorithms
DynMap: mapping short reads to multiple related genomes
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
GapsMis: flexible sequence alignment with a bounded number of gaps
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Hi-index | 0.00 |
Motivation: The constant advances in sequencing technology are turning whole-genome sequencing into a routine procedure, resulting in massive amounts of data that need to be processed. Tens of gigabytes of data in the form of short reads need to be mapped back to reference sequences, a few gigabases long. A first generation of short read alignment software successfully employed hash tables, and the current second generation uses Burrows-Wheeler Transform, further improving mapping speed. However, there is still demand for faster and more accurate mapping. Results: In this paper, we present REad ALigner, an efficient, accurate and consistent tool for aligning short reads obtained from next generation sequencing. It is based on a new, simple, yet efficient mapping algorithm that can match and outperform current BWT-based software.