# Assignment 1 Question 1 This question is on the linear algorithm for building suffix tree (lecture 2). Give an example for a string...

Assignment 1
Question 1
This question is on the linear algorithm for building suffix tree (lecture 2).
Give an example for a string S length n over final language, so that the last phase of the algorithm (expanding T n-1 to Tn) takes asymptotically as much time as possible.
Question 2
Describe efficient algorithm for the following problem
Input: a string S with length n over Σ = {1, 2, … , n}
Output: the shortest prefix T of S , so S is a prefix of T^n (concatenate T n times)
Example: for S = 12121 the output is T = 12
Question 3
Describe algorithm for the following problem with running time of O(|P| |T|):
Input: Strings P, T and a scoring function δ.
Output: a substring T' of T so score(P, T') is maximal, where as score(A, B) defined to be the alignment between A and B with maximum score according to the δ scoring function. (δ is a general scoring function)

**Other questions 10**

- Basically I need to write a parody of Hamlet's "to be or not to be" soliloquy
- Find the area of an equilateral triangle (regular 3-gon) with the given measurement. 6-inch apothem A = sq. in.
- what factors will determine the best number of firms to sell the secret to
- Using TABS, discuss strategies for managing some of your stressors, both internal and external.
- The slope of a line is 5. The run is 6. What is the rise?
- Rewrite sin^2(4x) as a function of cot(4x)
- According to the Keynesian view, an unanticipated reduction in spending will:
- Book Esperanza Rising Chapter 6 questions What is ironic about Miguel's statement. To Esperanza: "Someday, you might make a very good servant."
- i got a question for flames of the tiger, i need to know about the monomyth in it and i...
- sin2x-sinx=0