Pattern matching by means of multi-resolution compression

A. Orpaz, S. Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationProceedings - DCC 2003
Subtitle of host publicationData Compression Conference
EditorsJames A. Storer, Martin Cohn
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0769518966
StatePublished - 2003
EventData Compression Conference, DCC 2003 - Snowbird, United States
Duration: 25 Mar 200327 Mar 2003

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


ConferenceData Compression Conference, DCC 2003
Country/TerritoryUnited States


  • Data compression
  • Decoding
  • Pattern matching
  • Testing


Dive into the research topics of 'Pattern matching by means of multi-resolution compression'. Together they form a unique fingerprint.

Cite this