Fig. 2

Representation of the suffix tree of \(T\#Q\), with \(T = \texttt{AGAAAG}\) and \(Q = \texttt{GAAT}\), where leaves corresponding to suffixes starting inside T and Q are marked in blue and orange, respectively. The colored arrows follow the traversal simulated by Algorithm 1: the recursion stops when the considered substring of Q does not occur in T (line 5), as is the case for \(Q[4] = \texttt{T}\), or when the same character follows all of its occurrences in both Q and T (line 13), as is the case for \(Q[1..2] = T[2..3] = \texttt{GA}\)