Publication details
Automatic generation of circuits for approximate string matching
| Basic information | |
|---|---|
| Original title: | Automatic generation of circuits for approximate string matching |
| Authors: | Tomáš Martínek, Matej Lexa, Patrik Beck, Otto Fučík |
| Further information | |
|---|---|
| Citation: | MARTÍNEK, Tomáš  - LEXA, Matej - BECK, Patrik - FUČÍK, Otto. Automatic generation of circuits for approximate string matching. In Proceedings of 2007 IEEE Design and Diagnostics of Electronic Circuits and Systems. Krakow : IEEE Computer Society, 2007. ISBN 1-4244-1161-0, pp. 203-208. 2007, Krakow. |
| Original language: | English |
| Field: | Computer hardware and software |
| Type: | Article in Proceedings |
| Keywords: | Approximate string matching; systolic array architecture; FPGA; DNA sequence analysis |
Systolic array architectures for approximate string matching play a significant role as hardware accelerators in biological applications. However, their wider use is limited by the lack of flexibility required by often variable tasks. In this respect, it is desirable to develop a procedure for automatic design and implementation of such accelerators to reach high performance and efficiency with as little human effort on the side of the designer as possible. This paper describes such procedure.
Related projects:
