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