Increased bit-parallelism for approximate and multiple string matching
From MaRDI portal
Publication:3507750
DOI10.1145/1064546.1180617zbMath1140.68553OpenAlexW1973022026MaRDI QIDQ3507750
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro
Publication date: 20 June 2008
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064546.1180617
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)
Related Items (1)
This page was built for publication: Increased bit-parallelism for approximate and multiple string matching