| ANNOUNCEMENTS |
|
|
Computational methods are fueling a revolution in the biological sciences. Computers are already nearly as indispensable as microscopes for analyzing and interpreting biological data. As a result, two new multidisciplinary fields, bioinformatics and computational biology, have emerged. This course will explore the computational methods and algorithmic principles driving this revolution. It will cover basic topics in molecular biology, genetics, and proteomics. The course also addresses basic computational theory and algorithms including asymptotic notation, recursion, divide-and-conquer approaches, graph algorithms, dynamic programming, and greedy algorithms. These fundamental concepts from computer science will be taught within the context of motivating problems drawn from contemporary biology. Example biological topics include sequence alignment, motif finding, gene rearrangement, DNA sequencing, protein peptide sequencing, phylogeny, and gene expression analysis.
This course is suitable for both computer science and biology students at both undergraduate and graduate levels, and thus is co-listed as both COMP590-90 and COMP790-90. Students who wish to take this course should have some programming experience in a modern language. Knowledge of data structures, algorithm design, and biology is helpful but not required. There will be homework, a midterm, and a final exam.
| Instructor: Wei Wang Office: SN 329 Email: weiwang@cs.unc.edu Voice: 1 (919) 962-1744 Office Hour: Tue 3:15-5PM |
| TA: Chen-Rui Chou Office: SN 307 Email: cchou@cs.unc.edu Voice: Office Hour: Tue 10AM-12noon |
Textbook: An Introduction to Bioinformatics Algorithms, by Neil C. Jones and Pavel A. Pevzner, MIT Press (C) 2004, ISBN: 0262101068.
| DATE | LECTURE NOTES | READING | HOMEWORK |
| Aug. 19 | Introduction [PDF][PPT] | Chapters 1, 3.1-3.7 | |
| Aug. 21 | High-Throughput Biology [PDF][PPT] | Chapter 3.8-3.11 | |
| Aug. 26 | Algorithms and Complexity [PDF][PPT] | Chapter 2.1-2.8 | Problem Set #1 [PDF] |
| Aug. 28 | DNA Restriction Mapping [PDF][PPT] | Chapter 4.1-4.3 | |
| Sep. 2 | Finding Regulatory Motifs Within DNA Sequences [PDF][PPT] | Chapter 4.4-4.9 | |
| Sep. 4 | Greedy Algorithms [PDF][PPT] | Chapter 5.1-5.2 | |
| Sep. 9 | Genome Rearrangements [PDF][PPT] | Chapter 5.3-5.5 | Problem Set #1 due 2PM Problem Set #2 [PDF] |
| Sep. 11 | Dynamic Programming Preliminaries [PDF][PPT] | Chapter 6.1-6.3 | |
| Sep. 16 | Sequence Alignments [PDF][PPT] | Chapter 6.4-6.8 | |
| Sep. 18 | Local Alignments [PDF][PPT] | Chapter 6.8-6.10 | |
| Sep. 23 | no class | ||
| Sep. 25 | Gene Prediction [PDF][PPT] | Chapter 6.11-6.14 | Problem Set #2 due 2PM |
| Sep. 30 | Midterm #1 | Chapters 1-6 | |
| Oct. 2 | Divide and Conquer Algorithms [PDF][PPT] | Chapter 7.1-7.4 | Problem Set #3 [PDF] |
| Oct. 7 | Graph Algorithms [PDF][PPT] | Chapter 8.1-8.8 | |
| Oct. 9 | DNA Sequencing [PDF][PPT] | ||
| Oct. 14 | Protein Sequencing [PDF][PPT] | Chapter 8.10-8.15 | |
| Oct. 16 | Fall Break | ||
| Oct. 21 | Combinatorial Pattern Matching [PDF][PPT] | Chapter 9.1-9.5 | Problem Set #3 due 2PM |
| Oct. 23 | Combinatorial Pattern Matching | Problem Set #4 [PDF] | |
| Oct. 28 | Approximate Pattern Matching [PDF][PPT] | Chapter 9.6-9.8 | |
| Oct. 30 | Graph Representations [PDF][PPT] Clustering [PDF][PPT] |
Chapter 10.1-10.3 | |
| Nov. 4 | Clustering and Evolution [PDF][PPT] | Chapter 10.4-10.8 | Problem Set #4 due 2PM |
| Nov. 6 | Tree Reconstruction [PDF][PPT] | Chapter 10.9-10.11 | |
| Nov. 11 | Midterm #2 | Chapters 7-9 | |
| Nov. 13 | Perfect Phylogeny [PDF][PPT] | not in textbook | Problem Set #5 [PDF] |
| Nov. 18 | Hidden Markov Models [PDF][PPT] | Chapter 11 | |
| Nov. 20 | Randomized Algorithms [PDF][PPT] | Chapter 12 | |
| Nov. 25 | Review | Problem Set #5 due 2PM | |
| Nov. 27 | Happy Thanksgiving! | ||
| Dec. 2 | no class (please see Chen-Rui to pick up your homework) | ||
| Dec. 5 (12noon - 3PM) | FINAL EXAM |