World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome. In this online course you will learn key pattern matching concepts: tries, suffix trees, suffix arrays and even the Burrows-Wheeler transform.
This course is part of the Data Structures and Algorithms Specialization
Offered By
About this Course
Could your company benefit from training employees on in-demand skills?
Try Coursera for BusinessSkills you will gain
- Suffix Tree
- Suffix Array
- Knuth–Morris–Pratt (KMP) Algorithm
- Algorithms On Strings
Could your company benefit from training employees on in-demand skills?
Try Coursera for BusinessOffered by
Syllabus - What you will learn from this course
Suffix Trees
Burrows-Wheeler Transform and Suffix Arrays
Knuth–Morris–Pratt Algorithm
Constructing Suffix Arrays and Suffix Trees
Reviews
- 5 stars66.56%
- 4 stars21.66%
- 3 stars7.84%
- 2 stars2.35%
- 1 star1.56%
TOP REVIEWS FROM ALGORITHMS ON STRINGS
Wow, this course is challenging, however, it's especially well explained by Michael Levin. Suffix Array, tricky part!
Suffix Array and Suffix Tree was the hardest part so far from all the previous courses in this specialization
Initially the accent was a little bit hard to understand, but after few minutes everything become crystal clear. Extremely useful course content.
The professor explained clearly as usual. The first 3 weeks is not too hard but final week took me really long time to understand.
About the Data Structures and Algorithms Specialization

Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.