String searching with mismatches using AVX2 and AVX-512 instructions
Loading...
Access rights
openAccess
CC BY
CC BY
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
5
Series
Information Processing Letters, Volume 189, pp. 1-5
Abstract
We present new algorithms for the k mismatches version of approximate string matching. Our algorithms utilize the SIMD (Single Instruction Multiple Data) instruction set extensions, particularly AVX2 and AVX-512 instructions. Our approach is an extension of an earlier algorithm for exact string matching with SSE2 and AVX2. In addition, we modify this exact string matching algorithm to work with AVX-512. We demonstrate the competitiveness of our solutions by practical experiments. Our algorithms outperform earlier algorithms for both exact and approximate string matching on various benchmark data sets.Description
Publisher Copyright: © 2025 The Author(s)
Other note
Citation
Chhabra, T, Ghuman, S S & Tarhio, J 2025, 'String searching with mismatches using AVX2 and AVX-512 instructions', Information Processing Letters, vol. 189, 106557, pp. 1-5. https://doi.org/10.1016/j.ipl.2025.106557