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.
Study Plan
This information is intended exclusively for students already enrolled in this course.If you are a new student interested in enrolling, you can find information about the course of study on the course page:
Laurea in Bioinformatica - Enrollment from 2025/2026The 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 enrollment year.
1° Year
| Modules | Credits | TAF | SSD |
|---|
2° Year activated in the A.Y. 2016/2017
| Modules | Credits | TAF | SSD |
|---|
3° Year activated in the A.Y. 2017/2018
| Modules | Credits | TAF | SSD |
|---|
One course to be chosen among the following2 courses to be chosen among the following| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
One course to be chosen among the following2 courses to be chosen among the followingLegend | 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.
Algorithms (2016/2017)
The teaching is organized as follows:
Learning outcomes
------------------------
MM: ALGORITMI PER BIOINFORMATICA
------------------------
The course aims at providing the fundamental (methodological) tools for the design and analysis of algorithms with some emphasis on problems of interests for bioinformatics. In the presentation of the main technique of algorithm design, applications and example will be preferably taken from the area of bioinformatics and computational biology. The course will provide the students with the knowledge and skills necessary to be able to model simple problems in terms of computational problems; to quantify the computational resources necessary to execute an algorithm, hence to compare different algorithmic solutions in terms of their computational cost. In particular, a student who profitably attended the course, will be able to evaluate the applicability and effectiveness of basic algorithmic design techniques to simple computational problems.
------------------------
MM: LABORATORIO DI PROGRAMMAZIONE II
------------------------
Objective of the course is to provide the basic knowledge to develop algorithms that are relevant to bioinformatics using object oriented programming.
Program
------------------------
MM: ALGORITMI PER BIOINFORMATICA
------------------------
Basic definitions: Computational Problems and Algorithms Analysis of algorithms: worst case and average case analysis; Algorithmic complexity: asymptotic notations; basic tools for the analysis of algorithms; solution of recurrences; Algorithms for searching sorting and selection. Data Structure for the implementing a dictionary: queues, heaps, binary search trees, hash tables; Design techniques: divide and conquer; greedy; dynamic programming; Graphs and Graph algorithms: graph traversals, basic connectivity problems, topological sorting
------------------------
MM: LABORATORIO DI PROGRAMMAZIONE II
------------------------
Java implementation of dynamic data structures and relevant algorithms. Recursion. Interfaces and packages. The student will acquire the necessary knowledge through assisted software development and realizing specific projects. Development of algorithms for sorting, search (greedy and exhaustive) and main algorithms on graphs, applied to problems that are relevant to bioinformatics. All the teaching material for this course is available on the course web page hosted on the teachers' web site.
Bibliography
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| J. Kleinberg, É. Tardos | Algorithm Design (Edizione 1) | Addison Wesley | 2006 | 978-0321295354 | |
| Neil C. Jones, Pavel A. Pevzner | An introduction to bioinformatics algorithms (Edizione 1) | MIT Press | 2004 | 0-262-10106-8 | |
| Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein | Introduction to Algorithms (Edizione 3) | MIT Press | 2009 | 978-0-262-53305-8 |
Examination Methods
------------------------
MM: ALGORITMI PER BIOINFORMATICA
------------------------
The exam verifies that the students have acquired sufficient confidence and skill in the use of basic algorithmic design and algorithmic analysis tools. The exam consists of a written test with open questions. The test includes some mandatory exercises and a set of exercises among which the student can choose what to work on. The mandatory exercises are meant to evaluate the student's knowledge of classical algorithms and analysis tools as seen during the course. "Free-choice" exercises test the ability of students to model "new" toy problems and design and analyse algorithmic solutions for it. The exam can also be passed via two midterm tests (structured as the main final exam). The relative weight of the midterm tests is proportional to the part of the course on which their are based. The overall result of the midterm exams is only valid towards the registration at the one of the exams in February session. The grade in "Algorithms" is given by the average of the grades achieved for the module "Algorithms for Bioinformatics" and the grade achieved for the module "Programming Laboratory II".
------------------------
MM: LABORATORIO DI PROGRAMMAZIONE II
------------------------
The grade in "Algorithms" is given by 50% AB + 50% LPII, where AB is the grade in "Algorithms for Bioinformatics" and LPII is the grade in "Programming Laboratory II". LPII = 50% P + 50% L, where P is a project in the lab and L is a lab test. The grade thus generated is registered at the first exam session in February. Alternatively, LPII = 100% EL, where EL is a lab test, hard enough to match the difficulty of P + L, respectively. All tests and projects are individual work. Cheating is strictly forbidden and will determine lowering of grades for all students involved.
