Acceleration of biological algorithms using reconfigurable logic

Efficiency in processing algorithms of biological systems is actually one of the most relevant areas in computational biology. On the other hand, the technological advances in development of reconfigurable devices as FPGAs, offers today the possibility of designing really efficient implementations, which takes advantages of their particular characteristics as high speed, high integration density and rescheduling facility. It is well-known that a hardware implementation has better time efficiency than software development. This paper presents the FPGA implementation of Sankoff and Kruskal Algorithm that solves the “RNA problem”, which consists in searching the secondary ideal structure of RNA's chain.

[1]  Enver Ever,et al.  Implementation of Non-Pipelined and Pipelined Data Encryption Standard (DES) Using Xilinx Virtex-6 FPGA Technology , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.

[2]  Lin Xu,et al.  An experimental study of optimizing bioinformatics applications , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[3]  Brent E. Nelson,et al.  Higher radix floating-point representations for FPGA-based arithmetic , 2005, 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05).

[4]  Alexandru Onea,et al.  An FPGA implementation of the time domain deadbeat algorithm for control applications , 2009, 2009 NORCHIP.

[5]  Shane S. Sturrock,et al.  Time Warps, String Edits, and Macromolecules – The Theory and Practice of Sequence Comparison . David Sankoff and Joseph Kruskal. ISBN 1-57586-217-4. Price £13.95 (US$22·95). , 2000 .

[6]  Shuvra S. Bhattacharyya,et al.  Systematic generation of FPGA-based FFT implementations , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[7]  Herman Schmit,et al.  Hidden Markov modeling and fuzzy controllers in FPGAs , 1995, Proceedings IEEE Symposium on FPGAs for Custom Computing Machines.

[8]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[9]  Brent E. Nelson,et al.  A Hardware Genetic Algorithm for the Travelling Salesman Problem on SPLASH 2 , 1995, FPL.

[10]  Alexandros Stamatakis,et al.  Efficient PC-FPGA Communication over Gigabit Ethernet , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.

[11]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[12]  Chengpeng Bi,et al.  A Genetic-Based EM Motif-Finding Algorithm for Biological Sequence Analysis , 2007, 2007 IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology.

[13]  Roger D. Chamberlain,et al.  Accelerating Nussinov RNA secondary structure prediction with systolic arrays on FPGAs , 2008, 2008 International Conference on Application-Specific Systems, Architectures and Processors.

[14]  Eric Lemoine,et al.  Run time reconfiguration of FPGA for scanning genomic databases , 1995, Proceedings IEEE Symposium on FPGAs for Custom Computing Machines.

[15]  Guoyong Cai,et al.  A Fast Exact Pattern Matching Algorithm for Biological Sequences , 2008, 2008 International Conference on BioMedical Engineering and Informatics.