Reconfigurable Architecture for Biological Sequence Comparison in Reduced Memory Space

DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in quadratic space and time. For long sequences, quadratic complexity makes the use of this algorithm impractical. In this scenario, the use of a reconfigurable architecture is a very attractive alternative. This article presents the design and evaluation of an FPGA-based architecture that obtains the similarity score between DNA sequences, as well as its coordinates. The results obtained in a Xilinx xc2vp70 FPGA prototype presented a speedup of 246.9 over the software solution to compare sequences of size 100MBP and 100BP, respectively. Different from others hardware solutions that just calculate alignment scores, our design was able to avoid architecture’s bottlenecks and accelerate the most computer intensive part of a sequence alignment software algorithm.

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Azzedine Boukerche, Jan Mendonca Correa, Alba Cristina Magalhaes Alves de Melo, Ricardo P. Jacobi, Adson Ferreira Rocha
• Keywords: Distributed And Parallel Computing, DNA Sequence Alignment, Dna Sequences, IPPS 2007, Sequence Alignment