Sciweavers

35 search results - page 1 / 7
» LZW Based Compressed Pattern Matching
Sort
View
DCC
2004
IEEE
14 years 2 months ago
LZW Based Compressed Pattern Matching
Compressed pattern matching is an emerging research area that addresses the following problem: given a file in compressed format and a pattern, report the occurrence(s) of the pat...
Tao Tao, Amar Mukherjee
COMPSAC
2002
IEEE
14 years 3 months ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen
DCC
1998
IEEE
14 years 3 months ago
Multiple Pattern Matching in LZW Compressed Text
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Mas...
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
14 years 3 months ago
Shift-And Approach to Pattern Matching in LZW Compressed Text
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Set...
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
14 years 3 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...