Thesis are available for both bachelor and master degree in Computer Engineering or Information Engineering.

Topics are related to algorithms and data structures for the analysis of sequences and graphs, with application to genomics (DNA of a single species) and to metagenomics (DNA of more species living in the same environment). Problems might concern pattern discovery, clustering, classification, efficient data representation.

For the three-year degrees, theses are also available that investigate specific types of data structures, for example by filtering (e.g. bloom filter, cuckoo filter), sketching (minhash, count-min-sketch, etc), representation through compressed data structures (fm-index, structures based on suffixes: suffix tree and suffix array). These theses can be purely compilative or have a more implementing/experimental cut, depending on the preference of the student.

Due to the general purpose of data structures that are used for data modelling in terms of strings and graphs, it is possibile that thesis will be available also in other application fields (e.g. text processing, data compression, web mining).