String Processing and Pattern Matching Algorithms
Intermediate
Online
4 Weeks
Free Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Courses and Certificate Fees
| Fees Informations | Certificate Availability | Certificate Providing Authority |
|---|---|---|
| INR 12594 | yes | UC San Diego |
The Syllabus
- From Genome Sequencing to Pattern Matching
- Programming Assignments
- Programming Assignment 1-1: Construct a Trie from a Collection of Patterns
- Programming Assignment 1-2: Implement TrieMatching
- Programming Assignment 1-3: Extend TrieMatching
- Programming Assignment 1-4: Suffix Tree
- Programming Assignment 1-5: Shortest Non-Shared Substring
- Burrows-Wheeler Transform
- Suffix Arrays
- Approximate Pattern Matching and Mutations of the Genome
- Slides and External References
- Programming Assignment 2-1: Burrows-Wheeler Transform
- Programming Assignment 2-2: Reconstruct String from Burrows-Wheeler Transform
- Programming Assignment 2-3: Implement BetterBWMatching
- Programming Assignment 2-4: Construct Suffix Array of a String
- Knuth-Morris-Pratt Algorithm
- Suffix Array Construction
- From Suffix Array to Suffix Tree
- Programming Assignment 3-1: Find all Occurrences of a Pattern in a String
- Programming Assignment 3-2: Construct Suffix Array of a Long String
- Programming Assignment 3-3: Pattern Matching with the Suffix Array
- Programming Assignment 3-4: Construct a Suffix Tree from a Suffix Array
- Preparing for Final Exam
- Practice Exam
- Final Exam
Instructors
Articles
22 Apr'25, 06:42 AM
7 Nov'24, 08:52 AM
12 Apr'24, 10:26 AM
20 Feb'24, 08:36 AM
22 Apr'25, 06:42 AM
7 Nov'24, 08:52 AM
12 Apr'24, 10:26 AM
20 Feb'24, 08:36 AM