Abstract
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.
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.
Original language | English |
---|---|
Title of host publication | BCB '10 Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology |
Publisher | ACM |
Pages | 154-159 |
Number of pages | 6 |
ISBN (Print) | 978-1-4503-0438-2 |
DOIs | |
Publication status | Published - 2010 |
Event | BCB' 10 ACM International Conference on Bioinformatics and Computational Biology - Niagara Falls, NY, United States Duration: 2 Aug 2010 → 4 Aug 2010 |
Conference
Conference | BCB' 10 ACM International Conference on Bioinformatics and Computational Biology |
---|---|
Country/Territory | United States |
City | Niagara Falls, NY |
Period | 2/08/2010 → 4/08/2010 |
Keywords
- mapping, next generation sequencing, pattern matching, reads, string algorithms