String mathcing with stopper compression

We consider string searching in compressed texts. We utilize a
compression method related to static Huffman compression, where
characters are encoded as variable-length sequences of symbols, each
of which is represented by a fixed number of bits. In addition, we
split the symbols into two parallel files in order to allow faster
access. Our searching algorithm is a variation of the
Boyer-Moore-Horspool algorithm. The shift function is based on several
symbols in order to achieve longer jumps than the ordinary occurrence
heuristic. Our approach enables faster searching of string patterns
than the best Boyer-Moore variants in uncompressed texts.