Course Syllabus
Titolo
Efficient Algorithms
Docente(i)
Paola Bonizzoni, Yuri Pirola, Raffaella Rizzi
Lingua
English
Breve descrizione
You must enrol at least one week before the first lecture.
If you are unable to enrol, send an email to the teacher(s).
The content of the course is the following
- Introduction to text indexing: Suffix Trees, Suffix Arrays
- Enhanced suffix arrays
- Burrows-Wheeler Transform (BWT), FM-index
- Probabilistic filters and data structures
- Sketching data streams
- MinHashing
- Suffixient sets
The exam consists in exercises, that can be solved by small groups of students.
Each student must write individually a detailed solution of the exercises.
We expect the student to have a clear understanding of basic algorithms and data structures, such as those presented in the undergraduate Algorithms courses
CFU / Ore
2 CFU.
The course consists of 16 hours of lectures. No lab activities is planned.
Periodo di erogazione
January 2027
Sustainable Development Goals
Title
Efficient Algorithms
Teacher(s)
Paola Bonizzoni, Yuri Pirola, Raffaella Rizzi
Language
English
Short description
You must enrol at least one week before the first lecture.
If you are unable to enrol, send an email to the teacher(s).
The content of the course is the following
- IIntroduction to text indexing: Suffix Trees, Suffix Arrays
- Enhanced suffix arrays
- Burrows-Wheeler Transform (BWT), FM-index
- Probabilistic filters and data structures
- Sketching data streams
- MinHashing
- Suffixient sets
The exam consists in exercises, that can be solved by small groups of students.
Each student must write individually a detailed solution of the exercises.
We expect the student to have a clear understanding of basic algorithms and data structures, such as those presented in the undergraduate Algorithms courses
CFU / Hours
2 CFU.
The course consists of 16 hours of lectures. No lab activities is planned.
Teaching period
January 2027
