Computationally efficient rolling window iterators for Python (sum, variance, min/max, etc.)
The Rabin-Karp algorithm, which uses a rolling hash to match patterns in text, is commonly used for exact string matching and plagiarism detection. This work presents a parallel version of the Accelerated Rabin-Karp algorithm, implemented using MPI and Distributed Python disPy.
packaged python implementation of a rolling hash function
Rabin-Karp string-matching algorithm
Add a description, image, and links to the rolling-hash-functions topic page so that developers can more easily learn about it.
To associate your repository with the rolling-hash-functions topic, visit your repo's landing page and select "manage topics."