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 , … , S d {\displaystyle D=S_{1},S_{2},\dots ,S_{d}} of total length n {\displaystyle n} , it is a Patricia tree containing all n {\displaystyle n} suffixes of the strings. It is mostly used in bioinformatics.