Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem

Figure 4

Each processor is working on its share of BP or the leaves. The stacks should be filled first for each processor before continuing with the algorithm.