A unifying framework for compressed pattern matching

Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa

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

33 Citations (Scopus)

Abstract

We introduce a general framework which is suitable to capture an essence of compressed pattern matching according to various dictionary based compressions, and propose a compressed pattern matching algorithm for the framework. The goal is to find all occurrences of a pattern in a text without decompression, which is one of the most active topics in string matching. Our framework includes such compression methods as Lempel-Ziv family, (LZ77, LZSS, LZ78, LZW) (J. Ziv and A. Lempel, 1978), byte-pair encoding, and the static dictionary based method. Technically, our pattern matching algorithm extends that for LZW compressed text presented by A. Amir et al. (1996).

Original languageEnglish
Title of host publicationString Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages89-96
Number of pages8
ISBN (Electronic)0769502687, 9780769502687
DOIs
Publication statusPublished - 1999
Event1999 String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999 - Cancun, Mexico
Duration: 1999 Sept 221999 Sept 24

Publication series

NameString Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

Conference

Conference1999 String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999
Country/TerritoryMexico
CityCancun
Period99/9/2299/9/24

Fingerprint

Dive into the research topics of 'A unifying framework for compressed pattern matching'. Together they form a unique fingerprint.

Cite this