@inproceedings{66606afd690243cb8537b4f3ff9ab901,
title = "Pattern matching by means of multi-resolution compression",
abstract = "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.",
keywords = "Data compression, Decoding, Pattern matching, Testing",
author = "A. Orpaz and S. Weiss",
note = "Publisher Copyright: {\textcopyright} 2003 IEEE.; Data Compression Conference, DCC 2003 ; Conference date: 25-03-2003 Through 27-03-2003",
year = "2003",
doi = "10.1109/DCC.2003.1194060",
language = "אנגלית",
series = "Data Compression Conference Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "441",
editor = "Storer, {James A.} and Martin Cohn",
booktitle = "Proceedings - DCC 2003",
address = "ארצות הברית",
}