CAP5510: Introduction of Bioinformatics
Fall Semester 2007,
Tuesday and Thursday 6:00- 7:15pm
HEC 0117
Instructor: Shaojie Zhang
Office Hour: T/Th 11:00 am -12:00 pm and Th 5:00 pm - 6:00 pm
Description: This course will summarize algorithms
in bioinformatics.
1) Molecular and genome biology
for computer scientist. 2) Comparing biological
sequences – Sequence alignment, Pair-wire and multiple alignment, global and
local alignments, whole genome alignments. 3) Finding genes from
genomes – Gene prediction. 4) Finding regulatory
motifs – Finding signals in the genomes. 5) Analysis genetic mobile
elements and repetitive DNAs in the genomes – repeat analysis 6)
Non-coding
RNA in the genome – RNA folding and find new ncRNAs. 7)
Genome
rearrangements and genome evolution - How genomes are evolved? Why can genome
rearrangements cause cancer? Whole genome duplication theory. 8)
Molecular
evolution. 9)
Sequencing
DNA - whole genome assembly and shotgun sequencing. 10)
Identify
proteins - computational proteomics. This course
is designed for the advanced level bioinformatics or EECS graduate students.
Graduate students with entry level background in bioinformatics research are
welcome to take this course. Biological background students who are interested
in comparative genomics are also welcome. Textbook
(I will distribute
complementary lecture notes and papers along the course for these topics): 1)
N. Jones and P. Pevzner, “An
introduction to bioinformatics algorithms”. (Major text book.) Most of
the lecture notes (slids) are from the companion website for this book: Link.
2)
P. Pevzner, “Computational
Molecular Biology: An Algorithmic Approach”. Some of the topics are from this
book. 3)
R. Durbin, S.
Eddy, A. Krogh, and G. Mitchison, “Biological sequence analysis –
Probabilistic models of proteins and nucleic acids” Assignments:
In addition to TWO take-home assignments and
ONE class research project. Grading:
Assignments (30%), Mid-term (15%), Final (15%), Final project (40%)