Indexing highly repetitive texts—such as genomic databases, software repositories and
versioned text collections—has become an important problem since the turn of the …

Social Media encourages networks in the complex and dynamic environment within which
firms are immersed. The purpose of this study is to analyze the role and impact of Social …

Abstract The Lempel-Ziv parsing of a string (LZ77 for short) is one of the most important and
widely-used algorithmic tools in data compression and string processing. We show that the …

Computing the LZ77 factorization is a fundamental task in text compression and indexing,
being the size z of this compressed representation closely related to the self-repetitiveness …

In this paper we present a really simple linear-time algorithm constructing a context-free
grammar of size 4 g log 3/2⁡(N/g) for the input string, where N is the size of the input string …

In this paper we present DYNAMIC, an open-source C++ library implementing dynamic
compressed data structures for string manipulation. Our framework includes useful tools …

Abstract The Lempel-Ziv (LZ77) factorization of a string is a widely-used algorithmic tool that
plays a central role in data compression and indexing. For a length-n string over integer …

We introduce a new approach to LZ77 factorization that uses \O(n/d) words of working space
and \O(dn) time for any d≥ 1 (for polylogarithmic alphabet sizes). We also describe carefully …

Abstract The Lempel-Ziv (LZ) 77 factorization of a string is a widely-used algorithmic tool that
plays a central role in compression and indexing. For a length-n string over a linearly …

Suffix sorting (or suffix array construction) is one of the most important tasks in string
processing, with dozens of applications, particularly in text indexing and data compression …