What is the text indexing problem?

For exact pattern matching, what is the time complexity of the best known algorithm?

List 4 properties of an atomic suffix tree

How do you find a pattern in an atomic suffix tree?

How does a compacted suffix tree differ from an atomic suffix tree?

List 6 properties of a compacted suffix tree

How can we construct a compacted suffix tree in O(n^2) time?

What are the time complexities of a Compacted Suffix Tree?

How can we make sure that a compacted suffix tree always exists?

How can we construct a suffix array in O(n) time given a suffix tree?