A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space
[chapter]

2005
*
Lecture Notes in Computer Science
*

The compressed suffix array and the compressed suffix tree for a given string S are full-text index data structures occupying O(n log |Σ|) bits where n is the length of S and Σ is the alphabet from which symbols of S are drawn. When they were first introduced, they were constructed from suffix arrays and suffix trees, which implies they were not constructed in optimal O(n log |Σ|)-bit working space. Recently, several methods were developed for constructing compressed suffix arrays and

doi:10.1007/11496656_4
fatcat:zdtzslecdvftfndeezfy3osefa