I need one. I have a source string of generaly unknown (although known to be less than 100 characters) content, and I need to match it against a 5mb file of likewise-arranged strings (all less ...

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

In this article, we discuss an approximate string matching algorithm as a solution for a legally meaningful way of searching for a genetic sequence.

The authors develop GPU adaptations of the Aho-Corasick and multipattern Boyer-Moore string matching algorithms for the two cases GPU-to-GPU (input to the ...