Algorithms in Bioinformatics - #22125

Information for participants

GENERAL SCHEDULE
Lectures will be in the morning from 9.00 - 12.00, and exercises in the afternoon from 13.00 - 17.00.

The morning sessions will consist of lectures and small practical exercises introducing the different algorithms, and the afternoon sessions will consist of programming exercises where the algorithms will be implemented.

The main programming language will be Python and all program templates provided in the course will be written in Python. Prior detailed knowlegde of Python programming is NOT required. However, basic programming skills are required to follow the course.

PROGRAMS AND TOOLS


Course Programme
Please note that the programme is updated on a regular basis - click the 'refresh' button once in a while to make sure that you have the most updated information

LITERATURE:

O Thursday, 2. June

Introduction to course. PSSM construction from pre-aligned sequences including pseudo count. Python recap
Morten Nielsen

  • BACKGROUND TEXTS Essentials: Additionals:
    9.00 - 9.15
    Introduction to course
    Introduction to course [PDF] (MP4).
    9.15 - 9.30
    Introduction to the immune system [PDF] (MP4).
    9.30 - 11.20 (coffee break included)
    Weight matrix construction[PDF]. [PPTX] Weight matrix construction (MP4).
    Logo Handout
    Answers
    Handout. Estimation of pseudo counts
    Answer
    11.20 - 12.00
    Some notes on sequence alignment [PDF]
    12.00 - 13.00
    Lunch
    13.00 - 13.30
    Questions to the mornings lectures and other general issues
    Checking that we all have python and jupyter-notebook installed and running
    13.30 - 17.00
    A brief introduction to Python programming and Jupyter-notebooks
    Python intro
    Python Answers
    Implementation of PSSM construction from pre-aligned sequences including pseudo count correction for low counts and sequence clustering
    PSSM construction and evaluation
    PSSM answers


    O Friday, 3. June

    Sequence alignment, Dynamic programming, and Psi-Blast
    Morten Nielsen

    BACKGROUND TEXTS
    Essentials: Additionals:
    9.00 - 9.30
    Questions to yesterdays lectures and exercises
    9.30 - 11.00
    Blosum matrices [PDF] (MP4)
    Sequence alignment [PDF] . [PPTX] . (MP4)
    Handout (O3)
    Handout (O2)
    Handout answers
    11.00 - 12.00
    Blast alignment heuristics, Psi-Blast, and sequence profiles [PDF] . [PPTX] .
    Psi-Blast handout.
    12.00 - 13.00
    Lunch
    13.00 - 17.00
    Implementation of the Smith-Waterman Dynamic programming algorithm
    Matrix dumps from alignment programs (to be used for debugging)
    Answers to sequence alignment exercise

    O Monday, 6. June. Holiday

    O Tuesday, 7. June
    Data redundancy reduction algortihms
    Optimizations methods
    Gibbs sampling
    Morten Nielsen

    BACKGROUND TEXTS
    Essentials: Additionals:
    9.00 - 9.30
    Questions to yesterdays lectures and exercises
    9.30 - 10.00
    Data redundancy reduction algorithms (Hobohm1 and Hobohm2) [PDF]. [PPTX]. (MP4).
    10.00 - 10.45
    Optimization procedures - Gradient decent, Monte Carlo
    Optimization procedures [PDF] [PPTX] (MP4)
    GD handout
    10.45 - 11.00
    Break
    11.00 - 12.00
    Gibbs sampling and Gibbs clustering
    Gibbs sampling [PDF] . [PPTX] . (MP4).
    12.00 - 13.00
    Lunch
    13.00 - 17.00
    Hobohm redundancy reduction algorithms
    Answers to Hobohm programming exercise
    Implementating of a Gibbs sampling algorithm for prediction of MHC class II binding
    Answers

    O Wednesday, 8. June
    Hidden Markov Models
    Morten Nielsen

  • BACKGROUND TEXTS
    9.00 - 9.30
    Questions to yesterdays lectures and exercises
    9.30 - 11.00
    Hidden Markov models (with a break around 10.30)
    Viterbi decoding, Forward/Backward algorithm, Posterior decoding, Baum-Welsh learning
    [PDF]. [PPTX] HMM (MP4)
    Viterbi Handout
    Answers
    Forward Handout
    Answers
    11.00 - 12.00
    Profile Hidden Markov Models
    12.00 - 13.00
    Lunch
    13.00 - 17.00
    Implementation of Viterbi and posterior decoding.
    Hidden Markov exercises
    Answer to Hidden Markov exercises

    O Thursday, 9. June
    Cross validation and training of data driven prediction methods. Stabilization matrix method (SMM)
    Morten Nielsen

  • BACKGROUND TEXTS
    9.00 - 9.30
    Questions to yesterdays lectures and exercises
    9.30 - 10.00
    Cross validation and training of data driven prediction methods
    [PDF] . [PPTX] . [MP4].
    10.00 - 10.30
    Stabilization matrix method (SMM) background
    [PDF] . [PPTX] . [MP4].
    SMM handout
    10.30 - 10.45
    Break
    10.45 - 12.00
    Implementing and evaluating SMM algorithms using cross-validation
    12.00 - 13.00
    Lunch
    13.00 - 13.30
    Quiz with questions capturing essential parts of course up to now Quiz
    Description of potential projects and formation of groups
    Project suggestions, and descriptions.
    Document for project signup.
    14.00 - 17.00
    Continuation of exercise
    Answers

    O Friday, 10. June
    Artificial neural networks. Sequence encoding, feedforward and backpropagation algorithm
    Morten Nielsen

  • BACKGROUND TEXTS
    9.00 - 9.30
    Questions to yesterdays lectures and exercises
    9.30 - 10.30
    Artificial neural networks[PDF] . [PPTX] . Artificial neural networks Part 1 (MP4). Artificial neural networks Part 2 (MP4).
    Handout
    Answers
    10.30 - 10.40
    Break
    10.40 - 12.00
    Network training - backpropagation
    Training of artificial neural networks [PDF] . [PPTX] . (MP4)..
    Handout
    12.00 - 13.00
    Lunch
    13.00 - 17.00
    Artificial neural networks (Feedforward and Backpropagation)
    ANN answers

    O Monday, 13. June
    An introduction to Deep neural network architectures
    Morten Nielsen

  • BACKGROUND TEXTS
    9.00 - 9.30
    Questions to yesterdays lectures and exercises
    9.30 - 10.00
    Trick for ANN training [PDF].
    10.00 - 10.30
    NNAlign, alignment using ANN's [PDF]
    10.30 - 12.00
    Exercise: Constructing and training Deep ANN methods (Jonas Birkelund Nilsson && Yuchen Li)
    Pytorch Intro slides.pdf.
    deep_neural_nets slides.pdf.
    code.tar.gz.
    data.tar.gz.
    12.00 - 13.00
    Lunch
    13.00 -17.00
    Exercise: Constructing and training Deep ANN methods (Jonas Birkelund Nilsson && Yuchen Li) cont.


    O Tuesday, 14. June
    An introduction to Deep neural network architectures
    Introduction to the project work
    Morten Nielsen

  • BACKGROUND TEXTS
    9.00 - 10.30
    Some more on Deep Learning (Jonas Birkelund Nilsson) [PDF]
    10.30 - 11.10
    What goes on inside a CNN? (Morten Nielsen) [PDF]
    11.10 - 11.30
    Doing things in C
    11.30 - 12.00
    Selection of projects, formation of project groups and start of project work Document for project signup.
    12.00 - 13.00
    Lunch
    13.00 - 14.00
    Cont - Selection of projects, formation of project groups and start of project work Document for project signup.

    O Wednesday 15. - Tuesday 21. June. Project work
    No lectures. Project work
    Projects must be submitted (in PDF format) via campusnet Tuesday 21. of June 11.59

    O Wedensday, 22. June, Exam

    The written exam will be available at the course page Wedensday 22th of June at 8.59, and need to be handed in via DTU Learn Wedensday 22th of June before 11.00. The exam is open book, meaning that you can seek information at the internet. You however cannot consult anyone, and plagiarism is seriously condemned. The exam will take place in the usual class room building 321 class room 033.

    exam.ipynb (NoteBook)
    exam.html (HTML)


    O Wednesday 22. June (afternoon) and Thursday, 23. June

    Project evaluation

    Each group has 20 minutes to present their project including 5 minutes for questions. Note, only the group will be present for the presentation of the individual projects. The project presentations will take place in the usual class room building 321 class room 033.

    Wednesday 22nd of June
    13.00 - 13.20
    Group 9	
    Comparative study of PSSM, ANN, SMM for MHC peptide binding	
    Lasse Rene, Helene Wegener, Jonathan Møller, Alberte Estad
    
    13.20 - 13.40
    Group 6	
    Gene expression profiling as a tool for cell type prediction	
    Laura Machado, Jonas Dalsberg Joergensen, Fredrik Junghus
    
    13.40 - 14.00
    Group 3	
    Gibbs sampler approach to the prediction of MHC class II binding motifs including pseudo counts and sequences weighting clustering (Hobohm) techniques	
    Angeliki Kallia Spentza, Javiera Laing Carmona, Klara Alicja Kotkowska, Mads Cort Nielsen
    
    14.10 - 14.30
    Group 15	
    Comparison of "fake" versus "true" cross-validation	
    Inigo Miguelez Goyeneche, Sergio Esteban Echeverra, Niels Jakob Larsen, Jake Pham
    
    14.30 - 14.50
    Group 1
    Method evaluation using cross validation (Comparison between "fake" and "true" CV)
    Casper Rasmussen, Line Sandvad Nielsen, Bogdan Capsa
    
    14.50 - 15.10
    Group 14	
    Peptide MHC binding predictions using position specific scoring matrices including pseudo counts and sequences weighting clustering (Hobohm) techniques	
    Karolina Krzesinska, Dave Rojas, Mads Hartmann, Myeonghyun Jonathan Yoou
    
    15.10 - 15.25 
    Break
    
    15.25 - 15.45
    Group 2	
    Prediction of transcript factor binding sites in Escherichia coli based on iModulons	
    Viktor Hesselberg-Thomsen, Jorge Carrasco, Shannara Taylor Parkins, Mikkel Anbo
    
    15.45 - 16.05
    Group 4	
    Comparison of fake versus true cross-validation	
    Eskild Fisker Angen, Esben Vestergaard Ayan, Chen Chen, Yi Huang
    
    16.05 - 16.25
    Group 5	
    Comparative study of PSSM, ANN, SMM for peptide MHC binding	
    Chatpakorn Christiansen, Aleksander Moldt Haack, Camilla Reiter Elbæk, Yat-Tsai Richie Wan
    
    Thursday 23rd of June
    9.00 - 9.20
    Group 7	
    Comparative study of PSSM, ANN, SMM for MHC peptide binding	
    Prince Ravi Leow, Adikrishna Murali Mohan, Baris Kara
    
    9.20 - 9.40
    Group 8	
    Comparative study of PSSM, ANN, SMM for MHC peptide binding	
    Siddhi Jain, Dimitrios Loukas, Christopher Sonne Hansen, Lasse Schnell Danielsen
    
    9.40 - 10.00
    Group 11 	
    Gibbs sampler approach to the prediction of MHC class II binding motifs including pseudo counts and sequences weighting clustering (Hobohm) techniques	
    Maurice Kappelmeyer, Jonathan Funk, Alem Gusinac, Eric Bautista
    
    10.10 - 10.30
    Group 12	
    Comparative study of PSSM, ANN, SMM for MHC peptide binding	
    Enrique Martinez Diez, Aldis Helga Bjorgvinsdottir, Bernat Godayol Farran
    
    

    Go to