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

<table>The text position for each leaf which has a terminal edge will be added to the <svg height="11.175" id="M136" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 9.8249998 11.175" width="9.8249998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M559 163q-23 -66 -68 -163h-474l6 26q62 4 79.5 19.5t28.5 75.5l78 409q7 35 8.5 49t-8 25t-24 13t-51.5 5l5 28h266l-6 -28q-65 -5 -79.5 -18t-25.5 -74l-76 -406q-10 -57 14 -75q12 -13 96 -13q93 0 126 29q41 40 76 109z" id="x1D43F"></path></g>
</svg> list of the closest ancestor which does not have a terminal edge pointing to it.</table>

BioMed Research International

fig2

Figure 2

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