This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Prerequisite : Programming knowledge, Discrete Mathematics, Data structures. Sample Topics: Motif finding (functional components of protein) Approximate Sequence Alignment (gene finding on DNA) Shortest superstring finding (DNA sequencing) Protein structure comparison (what may a newly found gene do) Protein-ligand binding (useful for drug discovery) Text : An Introduction to Bioinformatics Algorithms , by Neil Jones and Pavel Pevezner, The MIT Press, 2004, 0-262-10106-8. Evaluation : Class participation, Programming assignments, Presentations, Project Other Important Information on the Class Web Page: http://www.cs.fit.edu/~dmitra/Compbio/...
View Full Document
- Fall '11