in-memory key value server (based on radix-tree) with fuzzy search capabilities
-
Updated
Nov 22, 2020 - C
in-memory key value server (based on radix-tree) with fuzzy search capabilities
Source code for the software implementations of the GenASM algorithms proposed in our MICRO 2020 paper: Senol Cali et. al., "GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysis" at https://people.inf.ethz.ch/omutlu/pub/GenASM-approximate-string-matching-framework-for-genome-analys…
Add a description, image, and links to the approximate-string-matching topic page so that developers can more easily learn about it.
To associate your repository with the approximate-string-matching topic, visit your repo's landing page and select "manage topics."