Přístupnostní navigace
E-application
Search Search Close
Publication detail
MARTÍNEK, T. LEXA, M.
Original Title
Architecture Model for Approximate Tandem Repeat Detection
Type
article in a collection out of WoS and Scopus
Language
English
Original Abstract
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.
Keywords
Approximate tandem repeat; Architecture model; Automated mapping; FPGA;
Authors
MARTÍNEK, T.; LEXA, M.
RIV year
2011
Released
13. 6. 2011
Publisher
IEEE Computer Society
Location
Santa Monica, California
ISBN
978-1-4577-1290-6
Book
22nd IEEE International Conference on Application-specific Systems, Architectures and Processors
Pages from
239
Pages to
242
Pages count
4
URL
https://www.fit.vut.cz/research/publication/9671/
BibTex
@inproceedings{BUT76394, author="Tomáš {Martínek} and Matej {Lexa}", title="Architecture Model for Approximate Tandem Repeat Detection", booktitle="22nd IEEE International Conference on Application-specific Systems, Architectures and Processors", year="2011", pages="239--242", publisher="IEEE Computer Society", address="Santa Monica, California", doi="10.1109/ASAP.2011.6043277", isbn="978-1-4577-1290-6", url="https://www.fit.vut.cz/research/publication/9671/" }