CS 5984 Fall 2000 Homework Assignment 5
50 Points
Due: 10/2/00 at 5:00PM
The point value of each problem is shown in square brackets [ ].
Your solutions must be prepared with LaTeX
or other word processing system
and submitted as a stapled printout to a box outside the instructor's office
(McBryde 638).
This homework is due at 5:00PM on October 2, 2000.
No late homework will be accepted.
Be certain to write your solutions in COMPLETE SENTENCES.
-
[25]
Let S=cgcttacgct.
For i between 1 and 10,
compute each implicit suffix tree Ii,
as is done by Ukkonen's algorithm.
Also give each suffix link in the trees where it appears.
Now compute the suffix tree for the string S$ from I10
as is done by Ukkonen's algorithm.
-
[25]
Gusfield, Section 6.6, Exercise 1.
Please report any problems found in these pages to:
CS5984 Class Account (algnbio@courses.cs.vt.edu)