The Community for Technology Leaders
Green Image
Issue No. 06 - June (2010 vol. 59)
ISSN: 0018-9340
pp: 808-821
Azzedine Boukerche , University of Ottawa, Ottawa
Jan M. Correa , University of Brasilia, Brasilia
Alba Cristina M.A. de Melo , University of Brasilia, Brasilia
Ricardo P. Jacobi , University of Brasilia, Brasilia
The recent and astonishing accomplishments in the field of Genomics would not have been possible without the techniques, algorithms, and tools developed in Bioinformatics. Biological sequence comparison is an important operation in Bioinformatics because it is used to determine how similar two sequences are. As a result of this operation, one or more alignments are produced. DIALIGN is an exact algorithm that uses dynamic programming to obtain optimal biological sequence alignments in quadratic space and time. One effective way to accelerate DIALIGN is to design FPGA-based architectures to execute it. Nevertheless, the complete retrieval of an alignment in hardware requires modifications on the original algorithm because it executes in quadratic space. In this paper, we propose and evaluate two FPGA-based accelerators executing DIALIGN in linear space: one to obtain the optimal DIALIGN score (DIALIGN-Score) and one to retrieve the DIALIGN alignment (DIALIGN-Alignment). Because it appears to be no documented variant of the DIALIGN algorithm that produces alignments in linear space, we here propose a linear space variant of the DIALIGN algorithm and have designed the DIALIGN-Alignment accelerator to implement it. The experimental results show that impressive speedups can be obtained with both accelerators when comparing long biological sequences: the DIALIGN-Score accelerator achieved a speedup of 383.4 and the DIALIGN-Alignment accelerator reached a speedup of 141.38.
Biology and genetics, dynamic programming, special-purpose and application-based systems.

A. Boukerche, A. C. de Melo, R. P. Jacobi and J. M. Correa, "A Hardware Accelerator for the Fast Retrieval of DIALIGN Biological Sequence Alignments in Linear Space," in IEEE Transactions on Computers, vol. 59, no. , pp. 808-821, 2010.
85 ms
(Ver 3.3 (11022016))