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 …

Rank minimization problem can be boiled down to either Nuclear Norm Minimization (NNM)
or Weighted NNM (WNNM) problem. The problems related to NNM (or WNNM) can be …

High-throughput sequencing technologies produce large collections of data, mainly DNA
sequences with additional information, requiring the design of efficient and effective …

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 size of electronic data is currently growing at a faster rate than computer memory and
disk storage capacities. For this reason compression appears always as an attractive choice …

Results on algorithmic problems on strings that are given in a compressed form via straight-
line programs are surveyed. A straight-line program is a context-free grammar that …