0.1. SUFFIX TREES
1
CS 224 Fall 2011, Final Exam. It may be long. Do the best you can.
0.1
Sux Trees
1. Let T be a sux tree for string S over a nite alphabet. Each node v in T is
labeled with the string w, where the walk from the root to v spells out a st

CS 224 HW 4 Due Nov. 29 (This gives you a lot of time but dont wait
to start it. Some of the problems are easy and some are not.)
1. Suppose that binary matrix M is represented by a sparse-matrix data
structure: for each taxon p, the characters that p pos

CS 224 HW 3 - take two weeks. Some of the problems are somewhat
vague and open ended. Do what you can.
1. In class we saw that BWT[i] = T[SA[i] - 1], where T is the input string,
BWT[i] is the character at position i in the BWT string for T, and SA[i] is

CS 224 Fall 2011 HW 2, Due Thursday Oct. 13, 2011
The Unique Decipherability Problem
Basic Denitions: A code C is just a nite set of nite length strings,
called codewords. For example, C = cfw_aba, a, abb, ab, ba is a code, and aba is
one of the codewords

CS224 Fall 2011, HW1 Due Thursday Sept. 29 (please put your answers in
the homework box for the class in room 2131 Kemper hall).
Also, please type your answers. Latex is best, but if you need to, you can
type the text and write mathematics by hand. Hard t