Faster Suffix Tree Construction with Missing Suffix Links

  • C SIAMJ.
  • Published 2000


We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays. These trees also have the property that the node degrees may be large. We add a new backpropagation component to McCreight’s algorithm and also give a high… (More)

2 Figures and Tables


  • Presentations referencing similar topics