| | |
Summary: CSCE 590: Bioinformatics Algorithms
Catalog Course Description
CSCE 590: Bioinformatics Algorithms. (3) (Prereq. CSCE145; CSCE350) The course will
cover the algorithmic foundations of bioinformatics, ranging from generic algorithmic techniques
to specific algorithms used in various areas of bioinformatics. In particular, we will learn string
algorithms used in analysis of biologic sequences; combinatorial algorithms for gene finding and
motif discovery; graph algorithms used in genome assembly and comparative genomics; clustering
algorithms for gene expression analysis and reconstruction of evolutionary trees.
Prerequisite
CSCE145; CSCE350
Textbook(s)
Required textbook:
· N.C. Jones and P.A. Pevzner. Introduction to Bioinformatics Algorithms. The MIT Press,
2004.
Recommended for reading:
· D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computa-
tional Biology. Cambridge University Press. 1997
· P.A. Pevzner Computational Molecular Biology: An Algorithmic Approach. The MIT Press,
2000
Course Objectives
|
