I have used Rabin Karp Rolling Hash for searching a pattern $P$ in a text $T$. Now I am allowing $k$-mismatches, but not able to do a faster implementation.I tried modifying RK algorithm by splitting the pattern into few blocks, but that does not improve the speed. I'm trying to use locality sensitive hashing, but not sure how could I calculate hash with sliding window manner. Any help would be appreciated. For my case, the length of $P$ is 50~75 and $T$ is 100~150.
pattern search with k-mismatch
algorithms;strings;searching;rolling hash