Suffix trie for a text of size n …

• can be constructed in O(n) time    (most efficient implementation)
• uses O(n) space
• supports pattern matching queries in O(m) time
  • m … length of the pattern