Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts

This paper presents a compressed pattern matching in Huffman encoded texts. A modified Knuth-Morris-Pratt (KMP) algorithm is used in order to overcome the problem of false matches. This paper also proposes a bitwise KMP algorithm that can move one extra bit in the case of a mismatch, since the alphabet is binary. The KMP algorithm is combined with two Huffman decoding algorithms called sk-kmp and win-kmp to handle more than a single bit per machine operation. However, skeleton trees are used for efficient decoding of Huffman encoded texts.