title: Parallel Implementation of MAFFT on CUDA-Enabled Graphics Hardware.
abstract: Multiple sequence alignment (MSA) constitutes an extremely powerful tool for many biological applications including phylogenetic tree estimation, secondary structure prediction, and critical residue identification. However, aligning large biological sequences with popular tools such as MAFFT requires long runtimes on sequential architectures. Due to the ever increasing sizes of sequence databases, there is increasing demand to accelerate this task. In this paper, we demonstrate how graphic processing units (GPUs), powered by the compute unified device architecture (CUDA), can be used as an efficient computational platform to accelerate the MAFFT algorithm. To fully exploit the GPU's capabilities for accelerating MAFFT, we have optimized the sequence data organization to eliminate the bandwidth bottleneck of memory access, designed a memory allocation and reuse strategy to make full use of limited memory of GPUs, proposed a new modified-run-length encoding (MRLE) scheme to reduce memory consumption, and used high-performance shared memory to speed up I/O operations. Our implementation tested in three NVIDIA GPUs achieves speedup up to 11.28 on a Tesla K20m GPU compared to the sequential MAFFT 7.015.
authors.forename: Xiangyuan
authors.initials: X
authors.lastname: Zhu
authors.forename: Kenli
authors.initials: K
authors.lastname: Li
authors.forename: Ahmad
authors.initials: A
authors.lastname: Salah
authors.forename: Lin
authors.initials: L
authors.lastname: Shi
authors.forename: Keqin
authors.initials: K
authors.lastname: Li
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000295:instrumentation / Q000379:methods*; D003196:Computer Graphics; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA; D020539:Sequence Analysis, Protein