Pattern matching in Huffman encoded texts
Shmuel T. Klein, Dana Shapira · 2002
The possibility of locating a pattern directly in a text which has been encoded by a static Huffman code is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of false hits. The probability of false matches is analyzed and empirically tested.