Reverse engineering of compact suffix trees and links

CazauxBastien, RivalsEric · Journal of Discrete Algorithms · 2014

Invented in the 1970s, the Suffix Tree (ST) is a data structure that indexes all substrings of a text in linear space. Although more space demanding than other indexes, the ST remains likely an ins...

Read the paper · More papers on PaperTik