Recent advances in biotechnology and web technology are continuously generating huge
collections of similar strings. People now face the problem of storing them compactly while …

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 …

Suffix trees are by far the most important data structure in stringology, with myriads of
applications in fields like bioinformatics and information retrieval. Classical representations …

The LZ-index is a theoretical proposal of a lightweight data structure for text indexing, based
on the Ziv-Lempel trie. If a text of u characters over an alphabet of size σ is compressible to n …

A compressed full-text self-index for a text T, of size u, is a data structure used to search for
patterns P, of size m, in T, that requires reduced space, ie space that depends on the …

Background Publicly available DNA sequence databases such as GenBank are large, and
are growing at an exponential rate. The sheer volume of data being dealt with presents …

Suffix trees are by far the most important data structure in stringology, with myriads of
applications in fields like bioinformatics, data compression and information retrieval …

A compressed full-text self-index for a text T is a data structure requiring reduced space and
able of searching for patterns P in T. Furthermore, the structure can reproduce any substring …

Given a text T [1.. u] over an alphabet of size σ= O (polylog (u)) and with k-th order empirical
entropy Hk (T), we propose a new compressed full-text self-index based on the Lempel-Ziv …

We present a new search procedure for approximate string matching over suffix trees. We
show that hierarchical verification, which is a well-established technique for on-line …