Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Fiori et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: