John Hopkins University - Algorithms on Strings
- Offered byCoursera
Algorithms on Strings at Coursera Overview
Duration | 17 hours |
Start from | Start Now |
Total fee | Free |
Mode of learning | Online |
Difficulty level | Intermediate |
Official Website | Explore Free Course |
Credential | Certificate |
Algorithms on Strings at Coursera Highlights
- 36% started a new career after completing these courses.
- Earn a shareable certificate upon completion.
- Flexible deadlines according to your schedule.
Algorithms on Strings at Coursera Course details
- 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.
Algorithms on Strings at Coursera Curriculum
Suffix Trees
From Genome Sequencing to Pattern Matching
Brute Force Approach to Pattern Matching
Herding Patterns into Trie
Herding Text into Suffix Trie
Suffix Trees
Trie Construction - Pseudocode
FAQ
Slides and External References
Available Programming Languages
FAQ on Programming Assignments
Rules on the academic integrity in the course
Burrows-Wheeler Transform and Suffix Arrays
Burrows-Wheeler Transform
Inverting Burrows-Wheeler Transform
Using BWT for Pattern Matching
Suffix Arrays
Approximate Pattern Matching
Using BWT for Pattern Matching
Pattern Matching with Suffix Array
FAQ
Slides and External References
Knuth?Morris?Pratt Algorithm
Exact Pattern Matching
Safe Shift
Prefix Function
Computing Prefix Function
Knuth-Morris-Pratt Algorithm
Programming Assignment 3 lasts for two weeks
Slides and External References
Exact Pattern Matching
Constructing Suffix Arrays and Suffix Trees
Suffix Array
General Strategy
Initialization
Sort Doubled Cyclic Shifts
SortDouble Implementation
Updating Classes
Full Algorithm
Suffix Array and Suffix Tree
LCP Array
Computing the LCP Array
Construct Suffix Tree from Suffix Array and LCP Array
Counting Sort
Slides and External References
Computing the LCP Array - Additional Slides
Suffix Tree Construction - Pseudocode
Slides and External References
Suffix Array Construction