topic: suffix trees.

do part (c)

Some definitions:

v.suffix -- true if v represents a suffix

v.suffixIndex -- index of suffix represented if v.suffix is true

1a) Draw the generalized suffix tree for the set of strings S cheer, S2chore, S3 chair, S4-cheese, labeling the edges with strings (as opposed to indices). pt noe label the edges using tuples (i,j, k) which ind cates the substring Silj. ..k]. 1c) Give a linear-time algorithm for the following problem. Given a generalized suffix tree for strings S1, S2,... , Sn and a pattern P, output a list of indices i such that P is a substring of S,. For example, given the strings in la and Phee, the result is 1,4]. (Hint: you will need to access the tuples from part 1b with v.suffixIndices, a generalization of v.suffixIndex). 1a) Draw the generalized suffix tree for the set of strings S cheer, S2chore, S3 chair, S4-cheese, labeling the edges with strings (as opposed to indices). pt noe label the edges using tuples (i,j, k) which ind cates the substring Silj. ..k]. 1c) Give a linear-time algorithm for the following problem. Given a generalized suffix tree for strings S1, S2,... , Sn and a pattern P, output a list of indices i such that P is a substring of S,. For example, given the strings in la and Phee, the result is 1,4]. (Hint: you will need to access the tuples from part 1b with v.suffixIndices, a generalization of v.suffixIndex)