Speeding up Compressed Matching with SBNDM2
Kerttu Pollari-Malmi, Jussi Rautio, Jorma Tarhio · Prague Stringology Conference · 2014
We consider a compression scheme for natural-language texts and genetic data. The method encodes characters with variable-length codewords of k-bit base symbols. We present a new search algorithm, based on the SBNDM2 algorithm, for this encoding. The results of practical experiments show that the method supersedes the previous comparable methods in search speed.