Title :
Pattern matching in Huffman encoded texts
Author :
Klein, Shmuel T. ; Shapira, Dana
Author_Institution :
Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
Abstract :
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
Keywords :
Huffman codes; data compression; pattern matching; probability; text analysis; Huffman encoded texts; encoded pattern; false hits reduction; false match probability; pattern matching; static Huffman code; synchronization; Arithmetic; Decoding; Educational institutions; Encoding; Gallium nitride; Huffman coding; Internet; Pattern matching; Reservoirs; Testing;
Conference_Titel :
Data Compression Conference, 2001. Proceedings. DCC 2001.
Conference_Location :
Snowbird, UT
Print_ISBN :
0-7695-1031-0
DOI :
10.1109/DCC.2001.917176
