The advancement of sequencing technologies has made it feasible for researchers to consider many high-throughput biological applications. A core step of these applications is to align an enormous amount of short reads to a reference genome. For example, to resequence a human genome, billions of reads of 35 bp are produced in 1-2 weeks, putting a lot of pressure of faster software for alignment. Based on existing indexing and pattern matching technologies, several short read alignment software have been developed recently. Yet this is still strong need to further improve the speed. In this paper, we show a new indexing data structure called bi-directional BWT, which allows us to build the fastest software for aligning short reads. When compared with existing software (Bowtie is the best), our software is at least 3 times faster for finding unique best alignments, and 25 times faster for finding all possible alignments. We believe that bi-directional BWTis an interesting data structure on its own and couldbe applied to other pattern matching problems.
['Tak Wah Lam', 'Ruiqiang Li', 'Alan Tam', 'Sk Wong', 'Edward Wu', 'Siu-Ming Yiu']
High Throughput Short Read Alignment via Bi-directional BWT