CSCI 381 - Algorithms on Strings, Trees, and Sequences

FC NSMA

4 credits
This course presents deterministic algorithms that operate on strings, trees, and sequences. The knowledge of string algorithms is important for information retrieval, text-editing, and computational linguistics, but in this course we discuss the algorithms in context of their application to biological sequence analysis. We start by learning classical design techniques for exact and approximate string matching. Next, we learn how we can preprocess large strings into an indexing structure in such a way that it exposes string patterns and makes operations on strings efficient. Finally, we touch upon probabilistic sequence modeling–a powerful modern technique for pattern search.

Prerequisites: CSCI 280.