1MB304: Discrete structures for bioinformatics II 2008
- Book: An introduction to bioinformatics algorithms, Jones and Pevzner, ISBN 0-262-10106-8.
- Credit points: 5 (4 points: Exam, 1 point: hand-ins/project)
- Lectures: Torgeir R. Hvidsten, Assistant: Feifei Xu
- Obligatory hand-in exercises (all exercises must be handed in, student corrected and approved)
- One obligatory computer project (each student pair hand in a written report, present the results to the other students and review one other report)
- There will be up to one bonus point on the exam for each approved exercise handed in within the two deadlines (see student correction to the right) and up to four bonus points for the project. Thus there will be a maximum of 10 bonus points amounting to 10% of the exam.
- Sequence motif finding
- Genome assembly
- Genome rearrangements
- Multiple alignments
- Gene finding
- Ongoing research at the Linnaeus Centre for Bioinformatics
- You have one week to hand in a copy of your answers to each exercise. You then get the teacher's suggestion for solutions and have another week to hand in your original answers with your own corrections.
- Bonus points: You only get bonus points if you meet both deadlines and have satisfactory answers/corrections.
After this course students should be able to:
1.describe the different algorithm design techniques and discuss their pros and cons.
2.sketch a solution to a bioinformatics problem using pseudo-code and analyze its time/space complexity
3.recognize the algorithm design technique used in an existing bioinformatics solution, analyze its time/space complexity and the plausibility of using other techniques.
4.translate a given a biological problem into a representation that lends itself to be solved by one of the techniques, and discuss/argue for your solution.