1. Replacing suffix trees with enhanced suffix arrays;Abouelhoda;J. Discrete Algorithms,2004
2. The Burrows Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching;Adjeroh,2008
3. The Design & Analysis of Computer Algorithms;Aho,1974
4. Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, W.F. Smyth, German Tischler, Munina Yusufu, A comparison of index-based Lempel–Ziv LZ77 factorization algorithms, ACM Comput. Surv. (2012) (in press).
5. Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo, Application of suffix trees for the acquisition of common motifs with gaps in a set of strings, in: Proc. First Internat. Conf. on Language & Automata Theory & Applications, 2007, pp. 57–66.