On the Sorting-Complexity of Suffix Tree Construction - Rutgers CS

Download PDF
7 downloads 4133 Views 321KB Size Report
Comment
positions. We call this tree To, the odd tree. ... Finally, we will show how to merge To and Te into the whole suffix tree Ts. ... We call any trie so sorted a sorted trie.
            !"#$#% &'()*+, -./0*+,/(1

=> ? ?@A B CDED FG 7 ..H. I 7J ,

2#$# 345 -./0*+,/(67 8 / 9/, 7: ;( 7