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

<table>Comparison of space requirements for the three structures (standard suffix tree, enhanced suffix array, and Sadakane compressed suffix tree methods 1 and 2). In addition, the space consumed by the overlap stage in SGA is also shown. The used minimal length is 15.</table>

BioMed Research International

fig5

Figure 5

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