LINK [1] H. Yokoo,“Context tables: a tool for describing text compression algorithms,”In Proc. of IEEE Data Compression Conference, pp.299-308,1998.

LINK [2] H. Yokoo,“A Dynamic data structure for reverse lexicographically sortedprefixes,”In M. Crochemore and M. Paterson, editors, Proc. of the10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), LNCS1645, pp.150-162, 1999.

LINK [3] J. Ziv and A. Lempel,“A Universal algorithm for sequential data compression,”IEEE Trans. Inform. Theory, vol.IT-23, no.3, pp.337-343, 1977.

LINK [4] A. D. Wyner and J. Ziv,“Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression,”IEEE Trans. Inform. Theory, vol.IT-35, no.6, pp.1250-1258, 1989.

LINK [5] U. Manber and G. Myers,“Suffix arrays: A new method for on-line string searches,”SIAM Journal on Computing, vol.22, no.5, pp.935-948, 1993.

LINK [6] G. Nong, S. Zhang, and W. H. Chan,“Linear suffix array construction by almost pure induced-sorting,”In DCC, pp.193-202, 2009.

LINK [7] S. Gog and E. Ohlebusch,“Fast and lightweight lcp-array construction algorithms,”In Proc. ALENEX, pp.25-34, 2011.