Abstract Pattern matching is one of the most fundamental operations in string processing. However, such methods cannot speed up the pattern matching since an extra work is needed to keep track of compression mechanism.
Decompression is fast and requires small work space.
Moreover, it is easy to decompress an arbitrary part of the original text. However, it has not been so popular since the compression is slow and the compression ratio is not as good as other methods such as Lempel-Ziv type compression. In this paper, we pull out a potential advantage of BPE compression. We show that it is suitable for speeding up pattern matching. We present an algorithm for searching BPE compressed files.