Notes on Suffix Sorting

@inproceedings{Larsson1998NotesOS,
  title={Notes on Suffix Sorting},
  author={N. Jesper Larsson and Jesper Larsson},
  year={1998}
}
We study the problem of lexicographically sorting the suffixes of a string of symbols. In particular, we analyze the time complexity of Sadakane’s suffix sorting algorithm [8], showing that this is O(n log n) in the worst case. We also give a small improvement in the space requirements of this algorithm. We conclude that Sadakane’s algorithm, which has previously been shown to outperform the closely related algorithm of Manber and Myers [6] in practice, also endures a theoretical 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Optimal suffix tree construction with large alphabets

  • Martin Farach
  • Proceedings of the 38th Annual ieee Symposium on…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…