250 search results - page 3 / 50 » Reorganizing compressed text |
CPM
1999
Springer
13 years 10 months ago
1999
Springer
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
CPM
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
SCCC
2002
IEEE
13 years 10 months ago
2002
IEEE
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
CPM
1999
Springer
13 years 10 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...