Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Academic calendar
The academic calendar shows the deadlines and scheduled events that are relevant to students, teaching and technical-administrative staff of the University. Public holidays and University closures are also indicated. The academic year normally begins on 1 October each year and ends on 30 September of the following year.
Course calendar
The Academic Calendar sets out the degree programme lecture and exam timetables, as well as the relevant university closure dates..
| Period | From | To |
|---|---|---|
| I sem. | Oct 3, 2016 | Jan 31, 2017 |
| II sem. | Mar 1, 2017 | Jun 9, 2017 |
| Session | From | To |
|---|---|---|
| Sessione invernale Appelli d'esame | Feb 1, 2017 | Feb 28, 2017 |
| Sessione estiva Appelli d'esame | Jun 12, 2017 | Jul 31, 2017 |
| Sessione autunnale Appelli d'esame | Sep 1, 2017 | Sep 29, 2017 |
| Session | From | To |
|---|---|---|
| Sessione estiva Appelli di Laurea | Jul 19, 2017 | Jul 19, 2017 |
| Sessione autunnale Appelli di laurea | Oct 18, 2017 | Oct 18, 2017 |
| Sessione invernale Appelli di laurea | Mar 21, 2018 | Mar 21, 2018 |
| Period | From | To |
|---|---|---|
| Festa di Ognissanti | Nov 1, 2016 | Nov 1, 2016 |
| Festa dell'Immacolata Concezione | Dec 8, 2016 | Dec 8, 2016 |
| Vacanze di Natale | Dec 23, 2016 | Jan 8, 2017 |
| Vacanze di Pasqua | Apr 14, 2017 | Apr 18, 2017 |
| Anniversario della Liberazione | Apr 25, 2017 | Apr 25, 2017 |
| Festa del Lavoro | May 1, 2017 | May 1, 2017 |
| Festa della Repubblica | Jun 2, 2017 | Jun 2, 2017 |
| Vacanze estive | Aug 8, 2017 | Aug 20, 2017 |
Exam calendar
Exam dates and rounds are managed by the relevant Science and Engineering Teaching and Student Services Unit.
To view all the exam sessions available, please use the Exam dashboard on ESSE3.
If you forgot your login details or have problems logging in, please contact the relevant IT HelpDesk, or check the login details recovery web page.
Should you have any doubts or questions, please check the Enrolment FAQs
Academic staff
Bloisi Domenico Daniele
domenico.bloisi@univr.it
Study Plan
The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University. Please select your Study Plan based on your enrolment year.
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
1° Year
| Modules | Credits | TAF | SSD |
|---|
2° Year
| Modules | Credits | TAF | SSD |
|---|
Legend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Computational analysis of genomic sequences (2017/2018)
Teaching code
4S004556
Teacher
Coordinatore
Credits
6
Language
English
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
I sem. dal Oct 2, 2017 al Jan 31, 2018.
Learning outcomes
In this course we study data structures and algorithms for textual data (strings, sequences). The recent explosion of the amounts of data available ("big data") is one of the major challenges for computer science today. Much of this data is in form of text (or can be easily rendered in textual form): genomic sequences and other biological sequences, webpages, emails, scanned books, musical data, and many others. In order to be able to efficiently store, process, and extract information from this data, we need dedicated data structures and algorithms, i.e. data structures specifically developed for strings, also referred to as text indices.
In the recent progress of research in computational biology, the use of these data structures has been decisive, while the methods can be, and are being, applied to all other kinds of textual data.
The course will provide:
- an understanding of the fundamental challenges and issues in processing textual data,
- knowledge of the most common computational problems on strings in applications (pattern matching, repeat finding, string statistics, etc.),
- familiarity with the most important text indices.
Program
Following an introduction to strings (sequences), their basic properties and fundamental issues (alphabet size, character comparison, string sorting), the course covers basics of the following text indices:
- tries
- suffix trees
- suffix arrays, enhanced suffix arrays
- Burrows-Wheeler Transform (BWT)
For each of these, we will study their properties, efficient construction, and applications to specific string problems.
We will also cover (or recall, as appropriate) some classical exact pattern matching algorithms that are not index-based.
Main textbooks:
1) Enno Ohlebusch, Bioinformatics Algorithms, 2013
2) Dan Gusfield, Algorithms on Strings, Trees, and Sequences, 1997
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| Dan Gusfield | Algorithms on Strings, Trees, and Sequences | Cambridge University Press | 1997 | 0 521 58519 8 | |
| Enno Ohlebusch | Bioinformatics Algorithms | 2013 | 978-3-00-041316-2 |
Examination Methods
Final exam: written and oral. In the written exam, both theoretical questions will be asked (running times and storage space of algorithms, properties of the data structures studied), and concrete examples will have to be solved (compute the suffix tree, suffix array, BWT etc. of a given string, apply certain algorithms). In the oral exam, the student will have the opportunity to explain in detail his/her solution and show to what extent he/she has understood the topics studied.
The exam will show that the student
- has acquired sufficient understanding of the most important issues with respect to handling large textual data (alphabet type, comparison of strings, string sorting, size of textual data)
- can apply, explain, and analyze the algorithms studied for string sorting
- can apply, explain, and analyze the data structures studied, in particular construction algorithms for and storage space required by these data structures (inverted index, trie, suffix tree, suffix array, BWT)
- can apply, explain, and analyze some applications of these data structures to problems on strings, such as pattern matching, matching statistics, palindromes, etc.
The exam is the same for all students (whether or not they followed the lectures).
Bibliography
Type D and Type F activities
Modules not yet included
Career prospects
Module/Programme news
News for students
There you will find information, resources and services useful during your time at the University (Student’s exam record, your study plan on ESSE3, Distance Learning courses, university email account, office forms, administrative procedures, etc.). You can log into MyUnivr with your GIA login details.
Further services
I servizi e le attività di orientamento sono pensati per fornire alle future matricole gli strumenti e le informazioni che consentano loro di compiere una scelta consapevole del corso di studi universitario.
Graduation
Attendance
As stated in point 25 of the Teaching Regulations for the A.Y. 2021/2022, attendance at the course of study is not mandatory.Please refer to the Crisis Unit's latest updates for the mode of teaching.
