169 search results - page 2 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
DCC
1998
IEEE
13 years 9 months ago
1998
IEEE
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...
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
APPROX
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...