6 search results - page 1 / 2 » Pattern matching in Lempel-Ziv compressed strings: fast, sim... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
CIAC
2000
Springer
13 years 11 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...
22
Voted
IPL
2007
13 years 7 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
SIGIR
1998
ACM
13 years 11 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....