Accelerating a charged single α-helix search algorithm in protein sequences using FPGA
Conference: CNNA 2016 - 15th International Workshop on Cellular Nanoscale Networks and their Applications
08/23/2016 - 08/25/2016 at Dresden, Deutschland
Proceedings: CNNA 2016
Pages: 2Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Nagy, Zoltan (Faculty of Information Technology and Bionics, Pazmany Peter Catholic University, 1083 Budapest, Hungary & Cellular Sensory and Optical Wave Computing Laboratory, Hungarian Academy of Sciences, 1111 Budapest, Hungary)
Gaspari, Zoltan; Kovacs, Akos (Faculty of Information Technology and Bionics, Pazmany Peter Catholic University, 1083 Budapest, Hungary)
Processing and analyzing the immense amount of biological data generated each day requires fast and accurate bioinformatics algorithms. The main characteristic of the these algorithms is the low precision input data which can be stored on 2-5bits. Therefore reconfigurable architectures can be used more efficiently compared to conventional 32 or 64 bit microprocessors, because the accuracy of the functional units can be customized and a relatively small amount of configurable logic is required. In the paper a new architecture is introduced and implemented on FPGA to speed-up a structural motif search algorithm. The architecture can be implemented on a versatile medium range FPGA providing about two orders of magnitude speedup. The system can be efficiently scaled to process several sequences in parallel on a larger FPGA resulting in even higher speedup.