Approximate k-mer matching using fuzzy hash maps
MetadataShow full item record
We present a fuzzy technique for approximate k-mer matching that combines the speed of hashing with the sensitivity of dynamic programming. Our approach exploits the collision detection mechanism used by hash maps, unifying the two phases of “seed and extend” into a single operation that executes in close to O(1) average time.
The following license files are associated with this item: