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

Figure 8

Time requirements for solving APSP for random data with four different text lengths (10 MB, 50 MB, 100 MB, and 300 MB), using bottom-up technique and various number of cores.