Title

Lzw Based Compressed Pattern Matching

Abstract

The compressed pattern matching in LZW compressed files was studied. The study was based on 'almost-optimal' algorithm and was improved to search not only the first occurrence of the pattern but also all other occurrences. The search performance was tested and not only the 'decompress-then-search' approach but also the best available compressed pattern matching algorithms were compared. The results show that LZW is one of the most efficient compression algorithms and the method requires no modification on the compression algorithm.

Publication Date

6-14-2004

Publication Title

Data Compression Conference Proceedings

Number of Pages

568-

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

2642582696 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/2642582696

This document is currently not available here.

Share

COinS