About this Course

42,238 recent views

Learner Career Outcomes

36%

started a new career after completing these courses

29%

got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 17 hours to complete
English

Skills you will gain

Suffix TreeSuffix ArrayKnuth–Morris–Pratt (KMP) AlgorithmAlgorithms On Strings

Learner Career Outcomes

36%

started a new career after completing these courses

29%

got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 17 hours to complete
English

Offered by

Placeholder

University of California San Diego

Placeholder

National Research University Higher School of Economics

Syllabus - What you will learn from this course

Content RatingThumbs Up88%(3,946 ratings)Info
Week
1

Week 1

4 hours to complete

Suffix Trees

4 hours to complete
5 videos (Total 27 min), 6 readings, 1 quiz
5 videos
Brute Force Approach to Pattern Matching2m
Herding Patterns into Trie5m
Herding Text into Suffix Trie6m
Suffix Trees4m
6 readings
Trie Construction - Pseudocode10m
FAQ10m
Slides and External References10m
Available Programming Languages10m
FAQ on Programming Assignments10m
Rules on the academic integrity in the course10m
Week
2

Week 2

4 hours to complete

Burrows-Wheeler Transform and Suffix Arrays

4 hours to complete
5 videos (Total 30 min), 4 readings, 1 quiz
5 videos
Inverting Burrows-Wheeler Transform7m
Using BWT for Pattern Matching6m
Suffix Arrays5m
Approximate Pattern Matching6m
4 readings
Using BWT for Pattern Matching10m
Pattern Matching with Suffix Array10m
FAQ10m
Slides and External References10m
Week
3

Week 3

3 hours to complete

Knuth–Morris–Pratt Algorithm

3 hours to complete
5 videos (Total 35 min), 2 readings, 1 quiz
5 videos
Safe Shift3m
Prefix Function7m
Computing Prefix Function9m
Knuth-Morris-Pratt Algorithm5m
2 readings
Programming Assignment 3 lasts for two weeks2h
Slides and External References10m
1 practice exercise
Exact Pattern Matching30m
Week
4

Week 4

5 hours to complete

Constructing Suffix Arrays and Suffix Trees

5 hours to complete
11 videos (Total 76 min), 5 readings, 2 quizzes
11 videos
General Strategy6m
Initialization9m
Sort Doubled Cyclic Shifts8m
SortDouble Implementation6m
Updating Classes8m
Full Algorithm3m
Suffix Array and Suffix Tree8m
LCP Array5m
Computing the LCP Array6m
Construct Suffix Tree from Suffix Array and LCP Array6m
5 readings
Counting Sort10m
Slides and External References2m
Computing the LCP Array - Additional Slides10m
Suffix Tree Construction - Pseudocode10m
Slides and External References2m
1 practice exercise
Suffix Array Construction30m

Reviews

TOP REVIEWS FROM ALGORITHMS ON STRINGS

View all reviews

About the Data Structures and Algorithms Specialization

Data Structures and Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.