Boyer-Moore String Matching over Ziv-Lempel Compressed Text

We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect, we can still use the characters explicitly represented in those formats to shift the pattern in the text. We present a basic approach and more advanced ones. Despite that the theoretical average complexity does not improve because still all the symbols in the compressed text have to be scanned, we show experimentally that speedups of up to 30% over the fastest previous approaches are obtained. Moreover, we show that using an encoding method that sacri ces some compression ratio our method is twice as fast as decompressing plus searching using the best available algorithms.

• Type: Conference
• Year: 2000
• Where: CPM
• Authors: Gonzalo Navarro, Jorma Tarhio
• Keywords: Boyer-Moore Approach, Combinatorics, CPM 2000, Text Characters, Theoretical Average Complexity