TY - CONF AB - An FPGA accelerator for the computation of the semi-global Levenshtein distance between a pattern and a reference text is presented. The accelerator provides an important benefit to reduce the execution time of read-mappers used in short-read genomic sequencing. Previous attempts to solve the same problem in FPGA use the Myers algorithm following a column approach to compute the dynamic programming table. We use an approach based on diagonals that allows for some resource savings while maintaining a very high throughput of 1 alignment per clock cycle. The design is implemented in OpenCL and tested on two FPGA accelerators. The maximum performance obtained is 91.5 MPairs/s for 100 × 120 sequences and 47 MPairs/s for 300 × 360 sequences, the highest ever reported for this problem. AU - Castells-Rufas, David AU - Marco-Sola, Santiago AU - Aguado-Puig, Quim AU - Espinosa-Morales, Antonio AU - Moure, Juan Carlos AU - Alvarez, Lluc AU - Moreto, Miquel ID - 35131 KW - pc2-harp-ressources T2 - 2021 31st International Conference on Field-Programmable Logic and Applications (FPL) TI - OpenCL-based FPGA Accelerator for Semi-Global Approximate String Matching Using Diagonal Bit-Vectors ER -