Suffix Trees on Words

@article{Andersson1996SuffixTO,
  title={Suffix Trees on Words},
  author={Arne Andersson and N. Jesper Larsson and Kurt Swanson},
  journal={Algorithmica},
  year={1996},
  volume={23},
  pages={246-260}
}
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words . This word suffix tree represents only the m suffixes that start at word boundaries. These boundaries are determined by delimiters , whose definition depends on the application. Since traditional suffix tree construction algorithms rely heavily on the fact that all suffixes are inserted, construction of a word suffix tree… CONTINUE READING