[CLRS, 3. udgave] Exercises 26.3-1, 26.3-3, 32.1-2, 32.1-4, 32.2-1, 32.2-3, 32.4-5, Problem 26-1
[CLRS, 2. udgave] Exercises 26.3-1, 26.3-3, 32.1-2, 32.1-4, 32.2-1, 32.2-3, 32.4-7, Problem 26-1
Draw the compact representation of the suffix trie for the string
[GT] C-9.10: Give an efficient algorithm for deleting a string from a compressed trie and analyze its running time.
[GT] C-9.13: Describe an efficient algorithm to find the longest palindrome that is a suffix of a string T of length n. Recall that a palindrome is a string that is equal to its reversal. What is the running time of your method?
[GT] C-9.18: Let A, B, and C be three length-n character strings taken over the same constant sized alphabet. Design and O(n3)-time algorithm for finding a longest substring that is common to all three of A, B, and C.
Ekstra opgaver: Opgave 25, 26 ([GT] Kapitel 7.2.1 = [CLRS] Kapitel 25.2), 27, 28.