files includes

survcompr.ps.gz : Compressed Full Text Indexes, by V. Makinen and G. Navarro. Technical Report TR/DCC-2005-7, Dept. of Computer Science, University of Chile, June 2005. A comprehensive survey on compressed full-text indexes.

acmcs06.ps.gz   : Compressed Full Text Indexes, by V. Makinen and G. Navarro. ACM Computing Surveys 39(1), article 2, 2007. For personal use only, download from Compressed Full Text Indexes. A comprehensive survey on compressed full-text indexes.

sources.gz      : This file is formed by C/Java source code obtained by concatenating all the .c, .h, .C and .java files of the linux-2.6.11.6 and gcc-4.0.0 distributions. Downloaded on June 9, 2005.

by folder
Suffix Array:
    SAu.tgz     : implements a suffix array, using 32 bits for each entry.

    SAc.tgz     : implements a suffix array, using ceil(lg(n)) bits for each entry. Where n is the length of the text and lg is logarithm in base 2.

SuccinctSuffixArray:
    This folder incluses differt versions of The Succinct Suffix Array. SSA is a wavelet tree FM-index that gives to the wavelet tree the shape of the Huffman tree of the text.

Alphabet-Friendly_FM-Index:
    An Alphabet-Friendly FM-index combines an existing compression boosting technique with the wavelet tree data structure.

Compressed_Compact_Suffix_Array:
    The Compressed Compact Suffix Array (CCSA) is a simple self-index using essentially the structures of the Compact Suffix Array (CSA). The CSA was aimed at explicitly exploiting the self-repetitions of the suffix array $ A$  in order to store it in a more compact form.

Run_Length_FM_index:
    The Run-Length FM-Index (RLFM) is an improvement over the Wavelet Tree FM-index, which exploits the equal-letter runs of the BWT to achieve $ O(nH_k \log \sigma)$  bits of space, where $ H_k(T)$  is the $ k$ -th order empirical

FM-indexV2:
    two versions of the FM-index data structure. (note that the library for the FM-index V1 does not comply to the Pizza&Chili API)

LZ-index:
    The LZ-index is a compressed index based on LZ78 compression. 
    LZ-Index: The original LZ-index data structure.

    LZ-index-1: Reduced version of LZ-index, requiring 3 n H_k(T) + o(n log s) bits of storage. [Last Update: May 29, 2007].

    LZ-index-7: Another reduced version of LZ-index, also requiring 3 n H_k(T) + o(n log s) bits of storage. [Last Update: May 29, 2007].

    LZ-index-4: Reduced version of LZ-index, requiring (2+e) n H_k(T) + o(n log s). [Last Update: May 29, 2007].

Compressed_Suffix_Array:
    The compressed suffix array was originally a data structure achieving $ O(n\log\sigma)$  bits of space [1,2] and no self-indexing.

Repair_Suffix_Array:
    The RePair Suffix Array is a compression representation of the suffix array.