Fast detection of maximal exact matches via fixed sampling of query k-mers and Bloom filtering of index k-mers
-
Updated
Jul 10, 2020 - C++
Fast detection of maximal exact matches via fixed sampling of query k-mers and Bloom filtering of index k-mers
Implementation of Rolling hash function supporting both string prefix and suffix hashing.
Add a description, image, and links to the rolling-hash topic page so that developers can more easily learn about it.
To associate your repository with the rolling-hash topic, visit your repo's landing page and select "manage topics."