CS5263_4233 Bioinformatics
CS5263_4233 Bioinformatics
8/21: Welcome to CS4233 & CS5263 (Bioinformatics)! Please take some time to complete a background survey.
Overview | Prerequisite | Time and Location | Instructor | Textbooks and Resources | Policies | Lecture
Schedule and Slides | Assignments
Overview
This course is a survey of algorithms and methods in bioinformatics and computational biology, approached from a
(more or less) computational viewpoint. Topics covered include: fundamental biology, sequence comparison
(dynamic programming), motif finding (combinatorial algorithms, stochastic heuristic search algorithms, suffix
trees), next-generation sequencing (suffix array, Burrows Wheeler transform), gene expression data analysis
(statics, data mining), and gene network/pathway analysis (graph algorithms).
Prerequisite
This course is primarily designed for graduate students and advanced undergraduate students in the Computer
Science department. Fundamental understanding of data structure, algorithms, excellent programming experience
in at least one programming language, as well as some knowledge of probability and statistics are expected. Some
prior exposure to molecular biology is preferred, but not required, as we will introduce basic biological concepts
and terms along the way. Students without background in Algorithms or Statistics should consult the
instructor prior to taking the course.
We meet in room AET 0.214. Lecturers are Tuesday and Thursday, 2:30-3:45 PM.
Instructor and TA
Required:
Optional:
Basics of Bioinformatics - Lecture Notes of the Graduate Summer School on Bioinformatics of China, edited
by Jiang, Zhang and Zhang (JZZ)
Grading Policy
Collaboration Policy
Assignments
Slides
Reading:
o Statistics and Probability Primer for Computational Biologist
What are DNA motifs?
How to find motifs?
Additional reading:
Gibbs Sampling
MultiProfiler algorithm
Practical strategies
Slides set 1
Slides set 2
Additional reading:
Exact string matching
Weeder algorithm
Next-generation DNA sequencing, Shendure and Ji, Nat Biotechnol. 2008.
Sense from sequence reads: methods for alignment and assembly, Flicek & Birney, Nature Methods,
2009
Ultrafast and memory-efficient alignment of short DNA sequences to the human genome, Langmead
et al, Genome Biology 2009, 10:R25
Slides
Reading:
ChIP seq
Genome Databases
slides
Additional reading material:
1. Review on microarray data normalization 1 , 2
2. Review on microarray data analysis 1 , 2
3. Computation for ChIP-seq and RNA-seq studies download
file:///C:/Users/Huang%20Yongjie/Desktop/~jruan/teaching/cs5263f18/index.html 3/3