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 ...
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 an important problem in many applications such as computer security, bioinformatics, and time series analysis. This paper presents a simple data structure for ...
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 ...
Abstract: Approximate string match (ASM) is the key technique in text correction and some kinds of information retrieval application. The major problem in ASM is the efficiency of the process to find ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback