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.

Academic calendar

Course calendar

The Academic Calendar sets out the degree programme lecture and exam timetables, as well as the relevant university closure dates..

For the year 2015/2016 No calendar yet available

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.

Exam calendar

Should you have any doubts or questions, please check the Enrolment FAQs

Academic staff

A B C D F G L M P S

Accordini Simone

symbol email simone.accordini@univr.it symbol phone-number +39 045 8027657

Belussi Alberto

symbol email alberto.belussi@univr.it symbol phone-number +39 045 802 7980

Bicego Manuele

symbol email manuele.bicego@univr.it symbol phone-number +39 045 802 7072

Bombieri Cristina

symbol email cristina.bombieri@univr.it symbol phone-number 045-8027284

Bombieri Nicola

symbol email nicola.bombieri@univr.it symbol phone-number +39 045 802 7094

Cicalese Ferdinando

symbol email ferdinando.cicalese@univr.it symbol phone-number +39 045 802 7969

Combi Carlo

symbol email carlo.combi@univr.it symbol phone-number 045 802 7985

Constantin Gabriela

symbol email gabriela.constantin@univr.it symbol phone-number 045-8027102

Cristani Marco

symbol email marco.cristani@univr.it symbol phone-number +39 045 802 7841

Daducci Alessandro

symbol email alessandro.daducci@univr.it symbol phone-number +39 045 8027025

Delledonne Massimo

symbol email massimo.delledonne@univr.it symbol phone-number 045 802 7962; Lab: 045 802 7058

Franco Giuditta

symbol email giuditta.franco@univr.it symbol phone-number +39 045 802 7045

Giugno Rosalba

symbol email rosalba.giugno@univr.it symbol phone-number 0458027066

Laudanna Carlo

symbol email carlo.laudanna@univr.it symbol phone-number 045-8027689

Liptak Zsuzsanna

symbol email zsuzsanna.liptak@univr.it symbol phone-number +39 045 802 7032

Malerba Giovanni

symbol email giovanni.malerba@univr.it symbol phone-number 045/8027685

Manca Vincenzo

symbol email vincenzo.manca@univr.it symbol phone-number 045 802 7981

Marcon Alessandro

symbol email alessandro.marcon@univr.it symbol phone-number +39 045 802 7668

Menegaz Gloria

symbol email gloria.menegaz@univr.it symbol phone-number +39 045 802 7024

Perduca Massimiliano

symbol email massimiliano.perduca@univr.it symbol phone-number +39 045 802 7984

Sala Pietro

symbol email pietro.sala@univr.it symbol phone-number 0458027850

Salvagno Gian Luca

symbol email gianluca.salvagno@univr.it symbol phone-number 045 8124308-0456449264

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.

Training offer to be defined

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.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S004556

Coordinatore

Zsuzsanna Liptak

Credits

6

Language

English en

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Period

II sem. dal Mar 1, 2017 al Jun 9, 2017.

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.

Upon successful completion of the course, the student:

- will be able to choose the right data structure for an application on textual data,
- will be able to solve new problems using the data structures studied,
- will be aware of what issues to pay attention to when choosing an algorithm or data structure (e.g. alphabet size, storage space, compressibility).

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

Reference texts
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.

???AdattamentoProvaEsameDSA???

Type D and Type F activities

Training offer to be defined

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.

Graduation

For schedules, administrative requirements and notices on graduation sessions, please refer to the Graduation Sessions - Science and Engineering service.

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.

Career management


Area riservata studenti