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

<table>A generalized suffix tree for the string AAC#GAG$TTA%. The numbers below the leaves are the text positions for the string paths which are represented by these leaves.</table>

BioMed Research International

fig1

Figure 1

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