Efficient and succinct data structures for massive textual data

Dr. Solon Pissis

King’s College, London, UK

Prof. Paola Bonizzoni

University of Milano-Bicocca, Milano, Italy

Contents:

Advanced data structures:

– Suffix tree construction

– Suffix array construction and LCP array construction

Algorithms:

– Exact string matching (KMP, Karp & Rabin fingerprints, Boyer Moore)

– Approximate string matching

Advanced topics:

– Elastic-degenerate strings: a new representation for pattern matching in a collection of similar texts