— String Algorithms & Applications in Computational Biology

Prerequisites & course information

Course Description: Algorithms that operate on strings. Pattern matching, sets of patterns, regular expression pattern matching, suffix trees and applications, inexact similarity, parametric sequence alignment, applications to DNA sequencing and protein database searching. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter.