Pattern matching by means of multi-resolution compression

Summary form only given. The problem of compressed pattern matching deals with the ways to find a pattern within a compressed file, without decompressing. The techniques for solving the problem fall into two major categories, creating a unique compression scheme that enables efficient pattern matching; or using some known compression scheme and develop algorithms to search the files being produced. The first approach, which is the trade off compression for fast pattern matching, is selected. This proposed algorithm was also implemented and tested with some known files, such as Calgary and Canterbury corpora.