Week 9: String Algorithms, Approximation
Week 9
The Tao of Programming
Strings
Strings
Pattern Matching
Pattern Matching
Analysis of Naive Pattern Matching
Boyer-Moore Algorithm
Knuth-Morris-Pratt Algorithm
Boyer-Moore vs KMP
Word Matching With Tries
Preprocessing Strings
Tries
Trie Operations
Word Matching With Tries
Word Matching with Tries
Compressed Tries
Pattern Matching With Suffix Tries
Text Compression
Text Compression
Huffman Code
Approximation
Approximation for Numerical Problems
Approximation for NP-hard Problems
Vertex Cover
Summary
Produced: 24 Jul 2020
![[index]](icon/up.gif){kind=icon}