1. Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, California (1994)
2. Clark, D.R., Munro, J.I.: Efficient Suffix Trees on Secondary Storage. In: Proc. ACM-SIAM SODA, pp. 383–391 (1996)
3. Farach, M.: Optimal Suffix Tree Construction with Large Alphabets. In: Proc. IEEE FOCS, pp. 137–143 (1997)
4. Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: Proc. ACM-SIAM SODA, pp. 269–278 (2001)
5. Ferragine, P., Manzini, G.: Opportunistic Data Structures with Applications. In: Proc. IEEE FOCS, pp. 390–398 (2000)