Homework 1 for Algorithms in Bioinformatics
- Out: Oct. 17, 2001
- Due: 1 week
- Problem 1
Exercise 1.6.1 of Gusfield, page 11.
- Problem 2
Exercise 1.6.2 of Gusfield, page 11.
- Problem 3
Exercise 1.6.3 of Gusfield, page 12.
- Problem 4
Exercise 1.6.5 of Gusfield, page 13.
- Problem 5
Recall that there are three cases when we grow the (i+1)-st
suffix trie from the i-th suffix trie in the i-th iteration.
- Case 1: extending an old leaf;
- Case 2: growing a new leaf; and
- Case 3: staying in an internal node.
Prove that these three cases never interleave in each iteration.
This set of webpages is maintained by Hsueh-I Lu
Number of accesses since August 11, 2001.
FastCounter by bCentral