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

Table 1

Comparison between the two methods in term of time and space complexity. Time and space used for output are ignored.

Algorithm	Used data structures	Time complexity	Space complexity
First method	BP and CSA	𝑂(𝑛log𝑛)	𝑂(𝑛log𝑛)
Second method	BP, LCP and CSA	𝑂(𝑛log𝑛)	𝑂(𝑛log𝑘)