Course: Algorithms for Biological Sequence Analysis
Fall semester, 2007
Tuesday 9
3 credits
Web site: http://www.csie.ntu.edu.tw/~kmchao/seq07fall
Instructor: Kun-Mao Chao (趙坤茂)
Teaching assistant: Yi-Ching Chen (陳怡靜) email: d94010@csie...
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.
Coursework:
Homework assignments and Class participation (15%)
Two midterm exams (60%; 30% each):
1. November 6, 2007 Problems
2. December 18, 2007 Problems
Oral presentation of selected papers (25%)
Our classmates: I II III IV V VI VII VIII IX
Class PowerPoint slides:
Introduction (Oct. 2, 2007)
Interesting Sequences (Oct. 2, 2007)
Algorithmic Strategies (Oct. 9, 2007)
Sequence Alignment (Oct. 16, 2007)
Space-Saving Strategies (Oct. 23, 2007)
Suboptimal Alignment (Oct. 30, 2007)
K Best Local Alignments (Nov. 13, 2007)
RMSQ (Nov. 27, 2007)
Heaviest Segments (Dec. 4, 2007)
SNP (Dec. 11, 2007)
Supporting materials:
Basic Concepts of DNA, Proteins, Genes and Genomes (Oct. 30, 2007) -- Kun-Mao Chao
Basic Algorithmic Strategies (Oct. 30, 2007) -- Kun-Mao Chao
Sequence Alignment (Oct. 30, 2007) -- Kun-Mao Chao
A Note on the Scoring Schemes (Oct. 30, 2007) -- Kun-Mao Chao
Chao, K. -M., Pearson, W. R. and Miller, W., 1992, Aligning Two Sequences within a Specified Diagonal Band, Computer Applications in the Biosciences (CABIOS, now Bioinformatics), 8: 481-487
Chao, K. -M., 1994, Computing All Suboptimal Alignments in Linear Space, Combinatorial Pattern Matching '94, Lecture Notes in Computer Science 807, 31-42, California, USA.
Chao, K. -M., Hardison R. C. and Miller, W., 1994, Recent Developments in Linear-Space Alignment Methods: a Survey, Journal of Computational Biology, 1: 271-291.
Chen, K.-Y. and Chao, K.-M., 2007, “On the Range Maximum-Sum Segment Query Problem,” Discrete Applied Mathematics, 155: 2043-2052.
A Note on Computing Heaviest Segments (Nov. 27, 2007) -- Kun-Mao Chao
Huang, Y.-T., Zhang, K., Chen, T. and Chao, K.-M., 2005, “Selecting Additional Tag SNPs for Tolerating Missing Data in Genotyping,” BMC Bioinformatics, 6: 263.
Huang, Y.-T., Chao, K.-M., and Chen, T., 2005, “An Approximation Algorithm for Haplotype Inference by Maximum Parsimony,” Journal of Computational Biology, 12: 1261-1274.
Chang, C.-J., Huang, Y.-T., and Chao, K.-M., 2006, “A Greedier Approach for Finding Tag SNPs,” Bioinformatics, 22: 685-691.
Homework assignments:
#1: Handout: Oct. 2, 2007; Due: Oct. 12, 2007
Send TA a PowerPoint page including:
Your Name
A sequence which, in your opinion, is sort of interesting or inspiring, noting if it’s your own creation or collection.
A short reason explaining why it’s interesting or inspiring.
A SAMPLE SOLUTION (Oct. 2, 2007)
YOUR SOLUTIONS (Oct. 16, 2007)
Class presentations:
1. Maximum number of team members: 6
2. Each member is required to present in turn;
3. Revised slides should be sent to me one week after the presentation; (Please compress your figures.)
4. Questions in class are always welcome;
Selected papers for presentation:
1. November 13, 2007 (高孟駿、蕭安辰、廖凱傑、王鴻愷)
S.F. Altschul, T. L. Madden, A.A. Sch{\"{a}}ffer, J. Zhang, Z. Zhang, W. Miller and D. Lipman, Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research 25 (1997), 3389--3402.
W. James Kent
BLAT-The BLAST-Like Alignment Tool
Genome Res. 2002 12: 656-664. Published in Advance March 20,
2002, 10.1101/gr.229202. Article published online before March 2002
Webb Miller et al., 28-way vertebrate alignment and conservation track in the UCSC Genome Browser: publication, supplement, sample source code (Genome Research, published online on Nov 5, 2007.)