Two decades ago, a breakthrough in indexing string collections made it possible to
represent them within their compressed space while at the same time offering indexed …

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 …

We design two compressed data structures for the full-text indexing problem that support
efficient substring searches using roughly the space required for storing the text in …

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 …

Recent years have witnessed a dramatic increase of interest in sophisticated string matching
problems, especially in information retrieval and computational biology. This book presents …

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 …

We introduce new type of context-free grammars, AVL-grammars, and show their
applicability to grammar-based compression. Using this type of grammars we present O (n …

Zero-day polymorphic worms pose a serious threat to the security of Internet infrastructures.
Given their rapid propagation, it is crucial to detect them at edge networks and automatically …

New text indexing functionalities of the compressed suffix arrays are proposed. The
compressed suffix array proposed by Grossi and Vitter is a space-efficient data structure for …

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 …