Pattern matching in Huffman encoded texts

Shmuel T. Klein; Dana Shapira

doi:10.1016/j.ipm.2003.08.008

Pattern matching in Huffman encoded texts

Shmuel T. Klein
, Dana Shapira

Department of Computer Science

Brandeis University

Research output: Contribution to journal › Article › peer-review

31 Scopus citations

Abstract

For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of erroneously declared matches. The probability of such false matches is analyzed and empirically tested.

Original language	English
Pages (from-to)	829-841
Number of pages	13
Journal	Information Processing and Management
Volume	41
Issue number	4
DOIs	https://doi.org/10.1016/j.ipm.2003.08.008
State	Published - Jul 2005

Keywords

Compressed matching
Data compression
Huffman codes
Pattern matching

Access to Document

10.1016/j.ipm.2003.08.008

Cite this

@article{a1158ac919344ac2a3b3628d0f23416d,

title = "Pattern matching in Huffman encoded texts",

abstract = "For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of erroneously declared matches. The probability of such false matches is analyzed and empirically tested.",

keywords = "Compressed matching, Data compression, Huffman codes, Pattern matching",

author = "Klein, \{Shmuel T.\} and Dana Shapira",

year = "2005",

month = jul,

doi = "10.1016/j.ipm.2003.08.008",

language = "אנגלית",

volume = "41",

pages = "829--841",

journal = "Information Processing and Management",

issn = "0306-4573",

publisher = "Elsevier Ltd.",

number = "4",

}

TY - JOUR

T1 - Pattern matching in Huffman encoded texts

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2005/7

Y1 - 2005/7

N2 - For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of erroneously declared matches. The probability of such false matches is analyzed and empirically tested.

AB - For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of erroneously declared matches. The probability of such false matches is analyzed and empirically tested.

KW - Compressed matching

KW - Data compression

KW - Huffman codes

KW - Pattern matching

UR - https://www.scopus.com/pages/publications/11144222214

U2 - 10.1016/j.ipm.2003.08.008

DO - 10.1016/j.ipm.2003.08.008

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:11144222214

SN - 0306-4573

VL - 41

SP - 829

EP - 841

JO - Information Processing and Management

JF - Information Processing and Management

IS - 4

ER -

Pattern matching in Huffman encoded texts

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this