48 search results - page 2 / 10 » Direct Pattern Matching on Compressed Text |
CPM
1999
Springer
13 years 9 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...
SIGIR
1998
ACM
13 years 9 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
COMPSAC
2002
IEEE
13 years 9 months ago
2002
IEEE
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...
DLT
2004
13 years 6 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
CPM
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...