We address the issue of compressing and indexing data. We devise a data structure whose
space occupancy is a function of the entropy of the underlying data set. We call the data …

The proliferation of online text, such as on the World Wide Web and in databases, motivates
the need for space-efficient index methods that support fast search. Consider a text T of n …

The rapid growth of digital libraries, e-governance, and internet based applications has
caused an exponential escalation in the volume of 'Big-data'particularly due to texts, images …

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 arbitrary part …

We present a fast compression technique for natural language texts. The novelties are that
(1) decompression of arbitrary portions of the text can be done very efficiently,(2) exact …

String matching and Compression are two widely studied areas of computer science. The
theory of string matching has a long association with compression algorithms. Data …

The current explosion of stored information necessitates a new model of pattern matching,
that ofcompressed matching. In this model one tries to find all occurrences of a pattern in a …

Self-indexes aim at representing text collections in a compressed format that allows
extracting arbitrary portions and also offers indexed searching on the collection. Current self …

We consider several basic problems for texts and show that if the input texts are given by
their Lempel-Ziv codes then the problems can be solved deterministically in polynomial time …

In this article, a fully compressed pattern matching problem is studied. The compression is
represented by straight-line programs (SLPs)—that is, context-free grammars generating …