A new compression method for compressed matching

Shmuel T. Klein, Dana Shapira · 2002

A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern matching problem, i.e., pattern matching directly in a compressed text without decompressing.

Read the paper · More papers on PaperTik