Here you can get back to the main page of the course.

Algoritmi e Linguaggi per Bioinformatica: Algoritmi

Program of the project presentations.

• Wed 29 May 2013, 8.30-10.30 - aula H
  
  1. KMP algorithm for exact matching (Michele Rossin)
  2. DP algorithm for affine gap penalties (Andrea Pegoraro)
  
  
• Tue 4 June 2013, 8.30 - 10.30 - aula H (We start at 8.30 punctually!)
  
  1. Optimal pairwise alignment in linear space (Monica Morellato)
  2. KMP algorithm for exact matching (Andrea Bortot, Edoardo D'Angelo)
  3. Nussinov algorithm for RNA folding (Mattia Di Giacobbe)
  
  
• Thu 6 June 2013, 11.30 - 13.30 - aula H
  
  1. WOTD algorithm for suffix tree construction (Aldo Tocci, Giada Pace)
  2. Ukkonen's algorithm for suffix tree construction (Cesare Centomo)
  
  
• Wed 17 July 2013, 9.00 - 12.00 - (aula H ?)
  
  1. Divide-and-conquer multiple sequence alignment (Lorenza Brusini)
  2. q-gram distance and de Bruijn graphs (Alessio Milanese)
  3. Jumbled pattern matching (Muhamed Barakovic)
  4. Burrows-Wheeler transform (Daniele Paltrinieri)
  
  
• Tue 23 July 2013, 9.00 - 12.00 - (aula H ?)
  
  1. DP algorithm for edit distance (Denise Peserico)
  2. Suffix trees: basic properties and exact matching (Jasmina Zanoncello, Tommaso Carlucci)
  3. WOTD algorithm for suffix tree construction (Giada Rossignoli)
  4. HMM (Tommaso Bellisola)
  
  
• Wed 24 July 2013, 9.00 - 12.00 - (aula H ?)
  
  1. BLOSUM matrices (Giulia Speziali)
  2. DP algorithm for edit distance (Elena Maresi)
  3. DP for general gap functions (Irena Masetto)
  4. Burrows-Wheeler transform (Luca Marcolungo, Andrea Biolo)