Course code
Name of lecturer
Maria Paola Bonacina
Number of ECTS credits allocated
Academic sector
Language of instruction
I semestre dal Oct 4, 2010 al Jan 31, 2011.
Web page

To show the organization of the course that includes this module, follow this link * Course organization

Lesson timetable

I semestre
Day Time Type Place Note
Monday 2:30 PM - 4:30 PM lesson Lecture Hall D  
Thursday 11:30 AM - 1:30 PM lesson Lecture Hall D  

Learning outcomes

Objective of the course is to teach the basics in design and analysis of algorithms with emphasis on problems of interests for bioinformatics.


Algorithms and complexity: big-O notation. Divide-and-conquer algorithms. Sorting algorithms. Data structures. Graph algorithms. Exhaustive search. Greedy algorithms. Dynamic programming.

Reference books
Author Title Publisher Year ISBN Note
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

Assessment methods and criteria

The grade in Algorithms for Bioinformatics (AB) is worth 50% of the grade in the Algorithms class.

AB via multiple tests (only for the exams at the end of the course (February)): AB = 35% C1 + 40% C2 + 25% CC, where C1 and C2 are written tests in class and CC are the homeworks.

AB via single test: AB = 100% E, where E is a written test, whose difficulty equals that of C1 + C2 + CC.

If a student hands in E, the vote determined by C1 + C2 is cancelled. There is no choosing of grades.

In order to withdraw it is sufficient not to hand-in the test.