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 …

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 …

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 …

The rapid advance of DNA sequencing technologies has yielded databases of thousands of
genomes. To search and index these databases effectively, it is important that we take …

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 introduce a general framework which is suitable to capture the essence of compressed
pattern matching according to various dictionary-based compressions. It is a formal system …

We show an efficient pattern-matching algorithm for strings that are succinctly described in
terms of straight-line programs, in which the constants are symbols and the only operation is …

We address the problem of string matching on Ziv-Lempel compressed text. The goal is to
search a pattern in a text without uncompressing it. This is a highly relevant issue to keep …

We address the problem of searching in LZW compressed text directly, and present a new
algorithm for finding multiple patterns by simulating the move of the Aho-Corasick (1975) …

Given a string S of length N on a fixed alphabet of σ symbols, a grammar compressor
produces a context-free grammar G of size n that generates S and only S. In this paper we …