A Boyer-Moore type algorithm for compressed pattern matching

Recently the compressed pattern matching problem has attracted special concern, where the goal is to find a pattern in a compressed text without decompression. In previous work, we proposed an Aho-Corasick (AC) type algorithm for searching in text files compressed by the so-called byte pair encoding (BPE). The searching time is reduced at the same rate as the compression ratio compared with AC. In this paper, we show a Boyer-Moore (BM) type algorithm for pattern matching in BPE compressed files. Experimental results show that the algorithm runs about 1.5 ∼ 3.0 times faster than the exact match routines based on the BM algorithm in the software package Agrep, which is known as the fastest pattern matching tool