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
About this Course
Skills you will gain
- Suffix Tree
- Suffix Array
- Knuth–Morris–Pratt (KMP) Algorithm
- Algorithms On Strings
Syllabus - What you will learn from this course
Burrows-Wheeler Transform and Suffix Arrays
Constructing Suffix Arrays and Suffix Trees
- 5 stars66.56%
- 4 stars21.66%
- 3 stars7.84%
- 2 stars2.35%
- 1 star1.56%
TOP REVIEWS FROM ALGORITHMS ON STRINGS
Very well put together course. Challenging but understandable. I highly recommend you stick out. If you get stuck check the forums there's lots of helpful things there. Time well spent!
Learned a lot in the class. It was really excellent. But many a times we need to hear twice to understand some of the concepts clearly.
Wow, this course is challenging, however, it's especially well explained by Michael Levin. Suffix Array, tricky part!
Initially the accent was a little bit hard to understand, but after few minutes everything become crystal clear. Extremely useful course content.
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.