In computer science, a generalized suffix tree is a suffix tree for a set of strings. Given the set of strings \(D=S_{1},S_{2},\dots ,S_{d}\) of total length \(n\), it is a Patricia tree all \(n\) suffixes of the strings.
Bibliography
“Generalized Suffix Tree.” 2022. Wikipedia, March. https://en.wikipedia.org/w/index.php?title=Generalized_suffix_tree&oldid=1076478279.