Though many compression methods are based on the use of variable length codes, there
has recently been a trend to search for alternatives in which the lengths of the codewords …

This review provides a survey of techniques for pattern matching in compressed text and
images. Normally compressed data needs to be decompressed before it is processed, but if …

In this study, we address the problem of improving variable-length-to-fixed-length codes (VF
codes). A VF code is an encoding scheme that uses a fixed-length code, which provides …

We address the problem of improving variable-length-to-fixed-length codes (VF codes). A VF
code that we deal here with is an encoding scheme that parses an input text into variable …

Abstract The String-to-Dictionary Matching Problem is defined, in which a string is searched
for in all the possible concatenations of the elements of a given dictionary, with applications …

We discuss an improved method of Variable-to-Fixed length code (VF code) encoding. A VF
code is a coding scheme that splits an input text into a consecutive sequence of substrings …

A classic idea to improve text compression is to replace words with references to a text
dictionary, either external or stored together with the archive. We advocate for the second …

We introduce our research on compressed pattern matching technology that combines data
compression and pattern matching. To show the results of this work, we explain the collage …

Data compression is a technique for reducing the storage space and the cost of transferring
a large amount of data, using redundancy hidden in the data. We focus on lossless …

A long time ago, long before the advent of Kindles and iPads, mankind managed to bend
space and time with the invention of clay tablets. This little gadget allowed to enclose an …