Prague Stringology Conference 2017
Fernando J. Fiori, Waltteri Pakalén and Jorma Tarhio
Counting Mismatches with SIMD
| 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 SIMD (Single Instruction Multiple Data) instruction set extensions for patterns of up to 32 characters. We apply SIMD computation in two ways: in counting of mismatches and in calculation of fingerprints. We demonstrate the competitiveness of our solutions by practical experiments. |
| Download paper: |  |
 |
 |
| PostScript | BibTeX reference |