-
Views
-
Cite
Cite
Fernando J Fiori, Waltteri Pakalén, Jorma Tarhio, Approximate String Matching with SIMD, The Computer Journal, Volume 65, Issue 6, June 2022, Pages 1472–1488, https://doi.org/10.1093/comjnl/bxaa193
- Share Icon Share
Abstract
We consider the |$k$| mismatches version of approximate string matching for a single pattern and multiple patterns. For these problems, we present new algorithms utilizing the single instruction multiple data (SIMD) instruction set extensions for patterns of up to 32 characters. We apply SIMD computation in three ways: in counting of mismatches, in comparison of substrings and in calculation of fingerprints. We show the competitiveness of the new algorithms by practical experiments.
© The British Computer Society 2021. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com
This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/open_access/funder_policies/chorus/standard_publication_model)
Issue Section:
Section A: Computer Science Theory, Methods and Tools
You do not currently have access to this article.