1. Describe an algorithm for constructing the compact representation of a suffix trie, given its noncompact representation, and analyze its running time. 2. Use the LCS algorithm to compute the best...

1. Describe an algorithm for constructing the compact representation of a suffix trie, given its noncompact representation, and analyze its running time.

2. Use the LCS algorithm to compute the best sequence alignment between some DNA strings, which you can get online from GenBank.

May 26, 2022