hw3 - BCB 567/CprE 548 Fall 2007 Homework 3 Due Thursday...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: BCB 567/CprE 548 Fall 2007 Homework 3 Due Thursday, October 18 1. (5 points) Draw the suffix tree for the string xyxyyyxx . Include suffix links. Use full substring labels for edges (as opposed to a pair of integers). 2. (5 points) Consider the set of all distinct substrings of a string S . This set contains all substrings of S , but each repeat is only represented once. For example, for the string S = xxyxyy , this set is { x,y,xx,xy,yx,yy,xxy,xyx,yxy,xyy,xxyx,xyxy,yxyy, xxyxy,xyxyy,xxyxyy } . The size of this set is O ( n 2 ) and the total length in characters is O ( n 3 ). Therefore if we wished to enumerate the elements of this set we would expect to take O ( n 3 ) time. Assume that you are given a suffix tree of S . Describe an algorithm that counts the number of distinct substrings of S and runs in O ( n ) time. 3. (5 points) For the following questions, you are not to consider | Σ | to be a constant....
View Full Document

This note was uploaded on 10/01/2009 for the course CS BCB/Co taught by Professor Olivereulenstein during the Fall '06 term at Iowa State.

Page1 / 2

hw3 - BCB 567/CprE 548 Fall 2007 Homework 3 Due Thursday...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online