A compressed full-text self-index represents a text in a compressed form and still answers
queries efficiently. This represents a significant advancement over the (full-) text indexing …

The combination of incessant advances in sequencing technology producing large amounts
of data and innovative bioinformatics approaches, designed to cope with this data flood, has …

We propose algorithms that, given the input string of length n over integer alphabet of size σ,
construct the Burrows–Wheeler transform (BWT), the permuted longest-common-prefix …

Abstract Given a text T [1.. u] over an alphabet of size σ, the full-text search problem consists
in finding the occ occurrences of a given pattern P [1.. m] in T. In indexed text searching we …

In this thesis we address the problem of the efficiency in Information Retrieval by presenting
new compressed data structures and algorithms that can be used in different application …

A compressed full-text self-index is a data structure that replaces a text and in addition gives
indexed access to it, while taking space proportional to the compressed text size. This is very …

Semistatic word-based byte-oriented compressors are known to be attractive alternatives to
compress natural language texts. With compression ratios around 30–35%, they allow fast …