Credit units: 3
Offered: Either Term 1 or Term 2
Weekly hours: 3 Lecture hours
College: Graduate and Postdoc Studies
Department: Computer Science
This course focusses on mathematical and computational modelling of various real-world processes, with the main focus on biological systems. Using discrete models, algorithmic strategies will be explored including exact algorithms, approximation algorithms, heuristic algorithms, and randomized algorithms. The algorithms and models used will involve sets, graphs, strings, trees, and machines. For each algorithmic technique, we will study applications from biological systems and bioinformatics, including biomolecule string matching, sequence alignment, sequence assembly, compression, read mapping, stochastic modelling, and genome rearrangement. A class project will test the implementation or study of a model/algorithm.
Prerequisite(s): An undergraduate course in algorithms (such as CMPT 360) is recommended.
Note(s): This course is a hybrid course with CMPT 451, and cannot be taken for credit after previously taking CMPT 451.
Upcoming class offerings
The syllabus is a public document that provides detail about a class, such as the schedule of activities, learning outcomes, and weighting of assignments and examinations.
Once an instructor has made their syllabus publicly available on USask’s Learning Management System, it will appear below. Please note that the examples provided below do not represent a complete set of current or previous syllabus material. Rather, they are presented solely for the purpose of indicating what may be required for a given class. Unless otherwise specifically stated on the content, the copyright for all materials in each course belongs to the instructor whose name is associated with that course. The syllabus is the intellectual property of instructors or the university.