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 ...

Abstract: Approximate string matching has been widely used in many areas, such as web searching, and deoxyribonucleic acid sequence matching, etc. Approximate string matching allows difference between ...

On Friday the 19th of February 2021, M.Sc. Pengfei Xu will defend his doctoral thesis on Efficient Approximate String Matching with Synonyms and Taxonomies. The thesis is related to research done in ...

Abstract: Approximate string matching is the problem of finding all factors of a text t of length n with a distance at most k from a pattern x of length m ≤ n. Fixed-length approximate string matching ...

Add a description, image, and links to the approximate-string-matching topic page so that developers can more easily learn about it.

On Friday, 19th of February 2021, M.Sc. Pengfei Xu defended his doctoral thesis Efficient Approximate String Matching with Synonyms and Taxonomies. The event has invited Professor Jiaheng Lu ...