Let $T = t_1 t_2 \cdots t_n, be a string over an alphabet$\Sigma$. Each string$x$such that$T = uxv$for some (possibly empty) strings$u$and$v$is a substring of$T$, and each string$T_i = t_i \cdots t_n$, where$1 \leq i \leq n + 1$is a suffix of$T$; in particular,$T_{n+1} = \epsilon$is the empty suffix. The set of all suffixes of$T$is denoted$\sigma(T)$. The suffix trie$STrie(T)$of$T$is a trie representing$\sigma(T)$. Suffix tree $STree(T)$ of $T$ is a data structure that represents $STrie(T)$ in space linear in the length $|T|$ of $T$. This is achieved by representing only a subset $Q' \cup \{ \perp \}$ of the states of $STrie(T)$.