1MB602: Knowledge-based Systems in Bioinformatics 2007

 
   
  • Credit points: 5 (3 points: Exam, 1 point: hand-ins, 1 point: project)
  • Lecturer: Torgeir R. Hvidsten
  Aims and content:
  • The course teaches intelligent bioinformatics; principles and methods for biomedical knowledge representation and inference
    • Logic and knowledge representation
    • Heuristic search
    • Logical inference
    • Probabilistic approaches
    • Genetic algorithms and genetic programming
    • Decision trees and neural networks
    • Cellular automata
  • The course uses the programming language LISP/Scheme to illustrate intelligent bioinformatics and to teach principles of programming
    • Procedural and data abstraction
    • Lists and hiererachical structures
    • ...

Material:
  • Lecture slides, exercises and project, articles
  • Book 1: E. Keedwell, A. Narayanan, Intelligent bioinformatics: the application of artificial intelligence techniques to bioinformatics problems. Chichester : John Wiley, 2005. ISBN: 0-470-02175-6
  • Book 2: H. Abelson, G.J. Sussman, Structure and Interpretation of Computer Programs 2nd ed, The MIT Press, Cambridge, Massachusetts, 2000.
    NOTE: Available in HTML-format from the book homepage: http://mitpress.mit.edu/sicp/, pages 1-252 are the most relevant
  • DrScheme: Programming environment for LISP/Scheme: http://plt-scheme.org/software/drscheme/
    NOTE: Language -> Choose Language -> PLT -> Textual (MzScheme, includes R5RS)

Practical information:
  • Obligatory hand-in exercises (all exercises must be returned and approved)
  • Obligatory computer project
  • There will be a bonus point on the exam for each approved exercise handed in within the deadline and up to five bonus points if the project is approved and handed in within the deadline. Thus there will be a maximum of 10 bonus points amounting to 10% of the exam.
  • Exercises can be delivered by email, in Box 598 or directly to the lecturer.

Student evaluations: 2007

 
         

When/where?

Topics

Material

 
       
2007.11.23
Friday
10-12
D1:419, BMC
Lecture 1:
  • Course intro
  • Scheme basics
Slides
SICP: 1.0-1.2
IB: 1,2

 
2007.11.26
Monday
9-12
A10:0, BMC
Computer exercise 1
  • Scheme basics
Exercise 1  
2007.11.26
Monday
13-15
D1:419, BMC
Lecture 2:
  • Procedural and data abstraction
Slides
SICP: 1.3-2.2
 
2007.11.27
Tuesday
10-12
D1:411, BMC
Lecture 3:
  • Lists and sequences
Slides
SICP: 2.2
 
2007.11.27
Tuesday
13-15
Musen, EBC
Computer exercise 2
  • Lists and hierarchical data structures
Exercise 2  
2007.11.28
Wednesday
9-12
D1:415, BMC
Lecture 4:
  • Symbolic and abstract data, assignments and local state
Slides
SICP: 2.3.1-2.3.3,2.4,3.1
 
2007.11.28
Wednesday
13-15
A10:0, BMC
Computer exercise 2 (continued)
  • Lists and hierarchical data structures
   
Deadline exercise 1: Wednesdays Nov. 28th, 23.59  
2007.11.29
Thursday
10-12
A3:312, BMC
Lecture 5:
  • Logic and knowledge representation
Slides
Stevens et al.
Shapiro
(Bodenreider et al.)
 
2007.11.29
Thursday
13-15
A11:0, BMC
Computer exercise 3
  • Consensus sequences and recognition matrices

Exercise 3
consensus_lab.scm
lexA.txt
NC_000913.fna

 
2007.11.30
Friday
10-12
C8:305,BMC
Lecture 6:
  • Search
Slides
IB: 3.1-3.6
Russell
(McShan et al.)
 
2007.11.30
Friday
13-15
A3:312, BMC
Lecture 7:
  • Logical inference
Slides
Shapiro
Logical inference
 
Deadline exercise 2: Monday Dec. 3rd, 08.00  
2007.12.03
Monday
10-12
A11:0, BMC
Computer exercise 3 (continued)
  • Consensus sequences and recognition matrices
   
2007.12.03
Monday
13-15
A11:310, BMC
Lecture 8:
  • Probabilistic approaches
Slides
IB: 4
(Rabiner)
 
2007.12.04
Tuesday
10-12
A11:0, BMC
Computer exercise 4
  • Search
Exercise 4
4mc_lab.scm
 
2007.12.04
Tuesday
13-15
A5:01, BMC
Written exercise 5
  • Logics and logical inference
Exercise 5  
Deadline exercise 3: Tuesday Dec. 4th, 23.59  
2007.12.05
Wednesday
10-12
A11:0, BMC
Computer exercise 4 (continued)
  • Search
   
2007.12.05
Wednesday
13-15
D1:419, BMC
Lecture 9:
  • Genetic algorithms
  • Genetic programming
  • Project assignments
Slides
IB: 8,9
 
2007.12.06
Thursday
8-17
Hubben, EBC

Project work

Lecturer present: 10-12

2D folding: Bergeron and Durrett
Genomic distance: Lesh et al
 
2007.12.07
Friday
8-17
Hubben, EBC

Project work

Lecturer present: 10-12

   
Deadline exercise 4 and 5: Monday Dec. 10th, 10.00  
2007.12.10
Monday
10-12
A5:01, BMC
Lecture 10:
  • Decision trees
Slides
IB: 6
 
2007.12.10
Monday
13-15
A3:312, BMC
Lecture 11:
  • Neural networks
Slides
IB: 7
 
2007.12.11
Tuesday
8-17
Musen, EBC

Project work

Lecturer present: 9.30-11.30

   
2007.12.12
Wednesday
10-12
A5:01, BMC
Lecture 12:
  • Cellular automata
Slides
IB: 10
 
2007.12.13
Thursday
8-17
Musen, EBC

Project work

Lecturer present: 13-15

   
2007.12.14
Friday
8-17
Musen, EBC

Project work

Lecturer present: 13-15
Scheduled time for course evaluation: 12-13 (eValuering 2.1)
   
Deadline project report: Monday Dec. 17th, 8.15  
2007.12.17
Monday
9-12
A9:01, BMC
Project presentations    
2007.12.20
Thursday
9-14
B10:1-2, BMC
Exam Previous exams:
2004, 2005, 2006 (solutions), 2007
(Some of the material is outdated!)