Title :
Suffix Tree Based VF-Coding for Compressed Pattern Matching
Author_Institution :
Grad. Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo
Abstract :
We propose an efficient variable-length-to-fixed-length code (VF code for short), called ST-VF code. It utilizes a frequency-base-pruned suffix tree as a parse tree. VF codes as typified by Tunstall code have a preferable aspect to compressed pattern matching. It is unnecessary to distinguish code boundaries on compressed texts since all codewords have the same length.
Keywords :
data compression; pattern matching; tree data structures; trees (mathematics); variable length codes; ST-VF code; Tunstall code; compressed pattern matching; frequency-base-pruned suffix tree; parse tree; suffix tree based VF-coding; variable-length-to-fixed-length code; Data compression; Pattern matching;
Conference_Titel :
Data Compression Conference, 2009. DCC '09.
Conference_Location :
Snowbird, UT
Print_ISBN :
978-1-4244-3753-5
DOI :
10.1109/DCC.2009.58
