Combinatorics on words has arisen independently within several branches of mathematics,
for instance, number theory, group theory and probability, and appears frequently in …

Digital geometry is about deriving geometric information from digital pictures. The field
emerged from its mathematical roots some forty-years ago through work in computer-based …

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

Digitized images are known to be extremely space consuming. However, regularities in the
images can often be exploited to reduce the necessary storage area. Thus we find that many …

The discrete mathematics and theoretical computer science communities have recently
witnessed explosive growth in the area of algorithmic combinatorics on words. The next …

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 …

A new text compression scheme is presented in this article. The main purpose of this
scheme is to speed up string matching by searching the compressed file directly. The …

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 searching in LZW compressed text directly, and present a new
algorithm for finding multiple patterns by simulating the move of the Aho-Corasick (1975) …