What will you learn in Algorithms on Strings Course
Understand fundamental string algorithms including tries, suffix trees, suffix arrays, and the Burrows-Wheeler Transform (BWT).
Apply pattern matching techniques for exact and approximate search in text and genomic sequences.
Implement the Knuth-Morris-Pratt (KMP) algorithm for efficient pattern matching.
Explore applications of string algorithms in bioinformatics, text compression, and search engines.
Gain hands-on experience with programming assignments to reinforce algorithmic concepts.
Program Overview
Module 1: Suffix Trees
⏳ 4 hours
Learn to search for longest repeats in strings using suffix trees.
Study pattern matching algorithms and their practical applications.
Includes 6 videos, 5 readings, 1 assignment, 1 programming assignment.
Module 2: Burrows-Wheeler Transform and Suffix Arrays
⏳ 4 hours
Learn text compression with BWT and its application to pattern matching.
Explore suffix arrays for exact and approximate string matching.
Includes 5 videos, 4 readings, 1 assignment, 1 programming assignment.
Module 3: Knuth-Morris-Pratt Algorithm
⏳ 3 hours
Implement KMP algorithm for linear-time exact pattern matching.
Learn efficient construction of prefix functions for string search.
Includes 8 videos, 2 readings, 1 assignment.
Module 4: Advanced Pattern Matching and Applications
⏳ 3 hours
Apply learned algorithms to real-world data such as genomic sequences.
Explore advanced topics in string processing and algorithm optimization.
Get certificate
Job Outlook
Prepares learners for roles in bioinformatics, software engineering, and text/data analysis.
Knowledge applicable in search engines, computational biology, genomics, and NLP applications.
Enhances programming and algorithmic problem-solving skills.
Builds foundational skills for further study in algorithms, data structures, and computational genomics.
Specification: Algorithms on Strings
|
