1. Draw the compact representation of the suffix trie for the string: "minimize minime". 2. Describe an example of a text T of length n and a pattern P of length m such that force the brute-force...

1. Draw the compact representation of the suffix trie for the string: "minimize minime".

2. Describe an example of a text T of length n and a pattern P of length m such that force the brute-force pattern-matching algorithm achieves a running time that is Ω(nm).

May 26, 2022