TITLE: Compressing and indexing strings and labeled trees.

ABSTRACT:
In this talk we will investigate theoretically and experimentally the
design of compressed data structures for supporting substring search
queries, as the ones that occur in genomic or text mining applications,
and path-based queries, as the ones that occur in XML processing
applications. We will introduce the notion of "compressed index" and
will survey the most recent advancements on this algorithmic topic that
stands at the crossing point of data compression and data structure
design.