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
Really good quality information and examples (includes reasoning). It includes some of the latest developments in this area.
Its a very good course overall. Just felt that towards the end the material got too much to digest, might be a good idea to split the contents of weeks 3 and 4 into 3 or 4 weeks.
Suffix Array and Suffix Tree was the hardest part so far from all the previous courses in this specialization
It would be nice if you could deliver the problem's solutions after the course ended. I ran out of ideas for the BetterBWMatching problem and i couldn't overcome the time issues.
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.