02-414/614 String Algorithms
02-414/614 COURSE PROFILE
|Special Permission Required? (If yes, see “Notes:)||No|
|Course Relevance (who should take this course?)||Undergraduate and graduate students who have interest in algorithm techniques for large-scale and sequence processing. Graduate and undergraduate students in computational biology.|
|Most Recent Syllabus||http://www.cs.cmu.edu/~ckingsf/class/02-714/Syl-StringAlgs.pdf|
|Course Goals/Objectives||• Learn various algorithmic techniques and data structures for efficient processing of string data, including suffix trees,
suffix arrays, Borrows-Wheeler transforms.• Understand the why these algorithms and data structures work.
• Learn to apply and extend these algorithms and data
• Learn about the practical application of these techniques,
• At the end of this class, you should be familiar with much of the state-of-the-art in algorithms for strings, have familiarity with their use in practice, and have experience applying them to new problems.
|Learning Resources||Autolab, Piazza, Gradescope|
|Pre-reqs, Cross List, Related|| • Equivalent of 15-210 (“Parallel & Sequential Data Structures and Algorithms”) or 15-351/15-650/02-613 (“Algorithms & Advanced Data Structures”).
• Equivalent of 15-151 or 21-127.
|Notes||No knowledge of biology assumed|
|Updated October 2019|