Compressed Suffix Trees with Full Functionality

@article{Sadakane2006CompressedST,
  title={Compressed Suffix Trees with Full Functionality},
  author={Kunihiko Sadakane},
  journal={Theory of Computing Systems},
  year={2006},
  volume={41},
  pages={589-607}
}
We introduce new data structures for compressed suffix trees whose size are linear in the text size. The size is measured in bits; thus they occupy only O(n log|A|) bits for a text of length n on an alphabet A. This is a remarkable improvement on current suffix trees which require O(n log n) bits. Though some components of suffix trees have been compressed, there is no linear-size data structure for suffix trees with full functionality such as computing suffix links, string-depths and lowest… CONTINUE READING
Highly Influential
This paper has highly influenced 48 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

On Compressing and Indexing Data

  • P. Ferragina, G. Manzini
  • Technical Report TR-02-01, Dipartimento di…
  • 2002
Highly Influential
4 Excerpts

Higher Order Entropy Analysis of Compressed Suffix Arrays

  • R. Grossi, A. Gupta, J. S. Vitter
  • In DIMACS Workshop on Data Compression in…
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…