该gsuffix库实现枚举的字符串搜索使用 serveral的算法。它采用了后缀树和后缀数组的数据结构，以及一些其他方法。-The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

This code shows you how to create a suffix array and how to use RMQ algorithm to get two suffix s longest common prefix.

Implementation of Suffix Array and Vertex Cover algorithms

Compression using Burrows Wheeler Transform. Includes n*log(n) comparison tri-partite suffix array block sorting, Move-to-Front coding, dynamic canonical Huffman coding of Wheeler s run-length-coding.