Bioinformatics Algorithms - 11541 - CS 57900 - LE1 |
||||
---|---|---|---|---|
Associated Term: Fall 2019
Levels: Undergraduate, Graduate, Professional West Lafayette Campus Lecture Schedule Type Learning Outcomes: The course will provide an introduction to the basic techniques and algorithms in bioinformatics. The topics discussed will include some of the following: Biological Sequences: pairwise global alignments of genes and proteins; pairwise local alignment of genes and proteins; scoring matrices; multiple alignment of proteins Database search for sequences BLAST and variants Whole Genome Alignment: suffix trees and algorithms Genome Assembly Phylogenetic Trees and networks: distance based, parsimony, and maximum likelihood methods. Algorithms for analyzing RNA-Seq data Overview of Systems Biology and Biological Networks Clustering and module discovery in biological networks. Network alignment Required Materials: Wing-Kin Sung, Algorithms in Bioinformatics: A Practical Introduction, Chapman and Hall/CRC Press, 2009. (ISBN 978-1-420070330) Required for students with an algorithmic background. Caroline St. Clair and Jonathan E. Visick, Exploring Bioinformatics: A project-based approach, Second edition, Jones and Bartlett Learning, 2015. (ISBN 978-1-284-02344-2) Recommended for students who do not have an algorithmic background. Technical Requirements: Students should be comfortable in programming, either using Python or a high level programming environment such as Matlab. View Catalog Entry
|