7 search results - page 1 / 2 » Regular Expression Searching over Ziv-Lempel Compressed Text |
CPM
2001
Springer
14 years 3 months ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
CPM
2007
Springer
14 years 5 months ago
2007
Springer
CPM
1999
Springer
14 years 3 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
CPM
2000
Springer
14 years 3 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
IR
2008
13 years 11 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...