Projects

Compressed Indexes for k-mer Sets

We research compact and fast data structures to represent large sets of genomic k-mers (strings of length k over the DNA alphabet).

People: Giulio Ermanno Pibiri, Alessio Campanelli, Davide Cologni

Compressed Indexes for Strings

We study compressed space algorithms and data structures to process and index large genomic textual datasets

People: Ruben Becker, Davide Cenzato, Nicola Prezza

Algorithmic Fairness

We study computational problems with a focus on fairness guarantees, predominantly problems related to social networks.

People: Ruben Becker

Minimal Perfect Hashing

This research line investigates the design of minimal perfect hash functions that enable constant-time, collision-free access to large static datasets while compressing storage requirements near the information-theoretic lower bound.

People: Giulio Ermanno Pibiri

Compressed Indexes for Regular Languages - REGINDEX

Compressed Indexes for Regular Languages with Applications to Computational Pan-genomics.

People: Nicola Prezza, Alessio Campanelli, Daniel Puttini, Carlo Tosoni, Riccardo Maso, Davide Cenzato, Davide Tonetto, Ruben Becker

Grant: European Research Council (ERC) grant agreement No. 101039208.

Streaming and Sketching

We study streaming and sketching algorithms for processing large datasets

People: Ruben Becker, Davide Cenzato, Nicola Prezza, Carlo Tosoni