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

Figure 9

Time requirements for solving APSP for real data (167,369,577 bytes), for both methods using top-down and bottom-up techniques.