DocumentCode
3384498
Title
Pattern matching by means of multi-resolution compression
Author
Orpaz, A. ; Weiss, S.
Author_Institution
Dept. of EE-Syst., Tel Aviv Univ., Israel
fYear
2003
fDate
25-27 March 2003
Firstpage
441
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; encoding; file organisation; pattern matching; text analysis; Calgary corpora; Canterbury corpora; compressed file; decompressing; multiresolution coding scheme; multiresolution compression; nonoverlapping subgroup; pattern matching; source alphabet; string; trading-off compression; Data compression; Decoding; Pattern matching; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2003. Proceedings. DCC 2003
ISSN
1068-0314
Print_ISBN
0-7695-1896-6
Type
conf
DOI
10.1109/DCC.2003.1194060
Filename
1194060
Link To Document