1. T. Bell, M. Powell, A. Mukherjee, D. Adjeroh, Searching BWT compressed text with the Boyer–Moore algorithm and binary search, in: Proc. Data Compression Conf., DCC–02, Snowbird, UT, 2002, pp. 112–121
2. A fast string searching algorithm;Boyer;Commun. ACM,1977
3. (S, C)-dense coding: An optimized compression code for natural language text databases;Brisaboa,2003
4. Y. Choueka, S.T. Klein, Y. Perl, Efficient variants of Huffman codes in high level languages, in: Proc. 8-th ACM-SIGIR Conf., Montreal, 1985, pp. 122–130
5. Speeding up two string-matching algorithms;Crochemore;Algorithmica,1994