Shift-And Approach to Pattern Matching in LZW Compressed Text.
Combinatorial Pattern Matching (CPM99),
, pp.1-13
(1999), [peer-reviewed]
Event Date:
July 22-24, 1999
@ Warwick, England
Abstract / 概要
This paper considers the Shift-And approach to the problem of pattern matching in LZW compressed text, and gives a new algorithm that solves it. The algorithm is indeed fast when a pattern length is at most 32, or the word length. After an O(m + |∑|) time and…