I. Teaching Plan:
1. Indexing for Set Data
2. Range Minimum Query
3. Constant-Time Rank and Select
4. Perfect Hashing
5. KMP Algorithm
6. Suffix Tree and Suffix Array
7. BWT and Its Variants
---------------------------------------
II. Teaching Materials and References
1. Introduction to Algorithms, MIT Press
2. Research Papers
3. Web Resources: OCW, Wikipedia
---------------------------------------
III. Evaluation Method:
-- 4 to 6 Homeworks (100% in total)
---------------------------------------