Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
Figure 3
Each processor is working on one branch of the generalized suffix tree for the string AAC#GAG$TTA%. The numbers below the leaves are the text positions for the string paths which are represented by these leaves.