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

Describe an algorithm for constructing the compact representation of a

suffix trie, given its noncompact representation, and analyze its running

time.

Use the LCS algorithm to compute the best sequence alignment between

some DNA strings, which you can get online from GenBank.

Write a program that takes two character strings (which could be, for example,

representations of DNA strands) and computes their edit distance,

showing the corresponding pieces. (See Exercise C-13.37.)