#MaxShiftM
MaxShiftM: An implementation of the MaxShift algorithm that supports long factors that span across multiple computer words and runs under the Hamming distance model.
When publishing work that is based on the results from MaxshiftM please cite:
*Solon P. Pissis and Ahmad Retha, "Generalised Implementation for Fixed-Length Approximate String Matching under Hamming Distance & Applications", in Proceedings of the 2015 IEEE 29th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, IEEE Computer Society.
Compiled with GCC (MingW64 on Windows). Build using the command make on Linux or mingw32-make on Windows.
Run the application by going into the dist folder and executing the program to see the list of flags that can be used.