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. 2011/2012
| Modules | Credits | TAF | SSD |
|---|
3° Year activated in the A.Y. 2012/2013
| Modules | Credits | TAF | SSD |
|---|
Due insegnamenti a sceltaUn insegnamento a scelta| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
Due insegnamenti a sceltaUn insegnamento a sceltaLegend | 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 - ALGORITMI PER BIOINFORMATICA (2011/2012)
Teaching code
4S02709
Teacher
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
I semestre dal Oct 3, 2011 al Jan 31, 2012.
To show the organization of the course that includes this module, follow this link: Course organization
Learning outcomes
Objective of the course is to teach the basic principles in design and analysis of algorithms with emphasis on problems of interests for bioinformatics.
Program
Sorting algorithms. Divide-and-conquer algorithms. Data structures. Graph algorithms. Search algorithms. Greedy algorithms. Dynamic programming. Algorithms and complexity: big-O notation.
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| 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
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".
AB = 35% C1 + 40% C2 + 25% CC, LPII = 50% P + 50% L, where C1 is a written test (midterm exam), C2 is a written test (final exam), CC is the overall grade in the homeworks, 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, AB = 100% E, LPII = 100% EL, where E is a written test, and EL is a lab test, each hard enough to match the difficulty of C1 + C2 + CC and P + L, respectively.
Registration: all grades are registered. Withdrawal: Students may withdraw by informing the instructor. All tests and projects are to be carried out individually. Cheating is strictly forbidden and will determine lowering of grades for all students involved.
