Speeding Up Pattern Matching by Text Compression

Byte pair encoding (BPE) is a simple universal text compression scheme with fast decompression which requires small work space which allows decompression of an arbitrary part of the original text. Compression is rather slow with ratios less than Lempel-Ziv type compression. This paper, brings out a potential advantage of BPE compression showing that it is very suitable from a practical view point of compressed pattern matching, where the goal is to find a pattern directly in
compressed text without decompressing it explicitly.