Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

Graph-based text representation is one of the important preprocessing steps in data and text
mining, Natural Language Processing (NLP), and information retrieval approaches. The …

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

A well-known fact in the field of lossless text compression is that high-order entropy is a
weak model when the input contains long repetitions. Motivated by this fact, decades of …

High-throughput sequencing has revolutionised the field of biological sequence analysis. Its
application has enabled researchers to address important biological questions, often for the …

We show that suffix trees store various kinds of redundant information. We exploit these
redundancies to obtain more space efficient representations. The most space efficient of our …

We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that
we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+ 1 …

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 …

This book describes exciting new opportunities for utilizing robust graph representations of
data with common machine learning algorithms. Graphs can model additional information …

A method for applying adaptive data compression in a relational database system using a
filter cascade having at least one compression filter stage in the filter cascade. The method …