8794

Burrows-Wheeler Aligner: A Parallel Approach

Sheridan Lee Wright
San Diego State University
San Diego State University, 2012

@article{wright2013burrows,

   title={Burrows-Wheeler Aligner: a parallel approach},

   author={Wright, S.L.},

   year={2013},

   publisher={San Diego State University}

}

Download Download (PDF)   View View   Source Source   

1384

views

The advent of mainframe computing brought about a fundamentally different way of approaching problems for many branches of science. But none has transformed quite like the science of biology. With genome sequencing now commonplace, an organism may be completely represented as a sequence of numbers. Harnessing the power of computers, sequences of genomes (and thus organisms) may be compared in meaningful ways. Burrows-Wheeler Aligner (BWA) is one such utility for performing these comparisons. As expected, a sequence of genes may consist of millions of characters; efficient processing might still require days of computing. Due to BWA’s prevalence in bioinformatics research, the aim of this project is to reduce the time required to perform alignment utilizing parallel computation strategies. The paper explores two parallel architectures, MPI and CUDA, and the computational advantages of each as applied to the BWA-SW genome sequence alignment algorithm.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: