開課單位系所

 

  資訊系

 

 

課   程

█一般課程

(含必、選修)

□  通識課程

 

□教育學程

 

□軍訓課程

 

□体育課程

□(1人文 2社會

3物質 4生命

課號：

班次：

學分：3

名稱：生物序列分析演算法(Algorithms for Analyzing Biological Sequences)

授 課 教 師

趙坤茂 (Kun-Mao Chao)

 

課程大綱內容(含進度、教科書或參考書目、成績評量方式)

Web site: http://www.csie.ntu.edu.tw/~kmchao/seq05fall

 

Prerequisites: Some basic knowledge on algorithm development and program design is required. Background in bioinformatics and computational biology is welcome but not required for taking this course.

Outline:

1.          Introduction to sequence analysis

2.          Dynamic programming strategy revisited

3.          Maximum-sum and maximum-density segments

4.          Pairwise sequence alignment

5.          Multiple sequence alignment

6.          Suboptimal alignment

7.          Hidden Markov models (the Viterbi algorithm et al.)

8.          Comparative genomics

9.          Phylogenetic trees

10.      SNP and haplotype data analysis

11.      Genome annotation

12.      Other advanced topics

 

References:

1.          Class notes

2.          Related journal and conference papers

3.     Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, by Dan Gusfield (1997)

4.          Biological Sequence Analysis, by Richard Durbin et al. (1998)

5.                      Computational Molecular Biology: An Algorithmic Approach, by Pavel Pevzner (2000)

6.       An Introduction to Bioinformatics Algorithms, by Neil C. Jones and Pavel Pevzner (2004)

 

Coursework:

Programming assignments and Class participation(30%)

One exam (40%)

Final project (Oral presentation of selected papers) (30%)