Architecture model for approximate tandem repeat detection

Algorithms for biological sequence analysis, such as approximate string matching or algorithms for identification of sequence patterns supporting specific structural elements, present good opportunities for hardware acceleration. Implementation of these algorithms often results in architectures based on multidimensional arrays of computing elements. Mapping effectively these computational structures on FPGAs remains one of the challenging problems. This paper focuses on a specific hardware architecture for detection of approximate tandem repeats in sequences. We show how to create a parametrized architecture model combined with an automatic technique that can determine appropriate circuit dimensions with respect to input task parameters and the target platform properties.

[1]  Philip Heng Wai Leong,et al.  A Smith-Waterman Systolic Cell , 2003, FPL.

[2]  Martin C. Herbordt,et al.  Processing Repetitive Sequence Structures with Mismatches at Streaming Rate , 2004, FPL.

[3]  Tomás Martínek,et al.  NetCOPE: Platform for Rapid Development of Network Applications , 2008, 2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems.

[4]  Tomás Martínek,et al.  Hardware Acceleration of Approximate Tandem Repeat Detection , 2010, 2010 18th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines.

[5]  Martin C. Herbordt,et al.  Sizing of Processing Arrays for FPGA-Based Computation , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[6]  Tomás Martínek Evaluation of Biological Sequence Similarity Using FPGA Technology , 2011 .