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

Figure 7

Time requirements for solving APSP for random data with four different text lengths (10 MB, 50 MB, 100 MB and 300 MB), using top-down technique with 1, 4, and 16 cores.