H. Bannai, S. Inenaga, A. Shinohara, and M. Takeda, Inferring Strings from Graphs and Arrays, Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.2747, 2003.
DOI : 10.1007/978-3-540-45138-9_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.684

M. Burrows and D. J. Wheeler, A block sorting data compression algorithm, Digital System Research Center, 1994.

J. Duval and A. Lefebvre, Words over an ordered alphabet and suffix permutations, Theoretical Informatics and Applications, pp.249-260, 2002.
DOI : 10.1051/ita:2002012

M. Ira, C. Gessel, and . Reutenauer, Counting permutations with given cycle structure and descent set, J. Combin. Theory Ser. A, vol.64, issue.2, pp.189-215, 1993.

J. Kärkkäinen, P. S. , K. Lenstra, J. Parrow, and G. J. Woeginger, Simple Linear Work Suffix Array Construction, Proc. 30th International Colloquium on Automata , Languages and Programming (ICALP '03), pp.943-955, 2003.
DOI : 10.1007/3-540-45061-0_73

J. Dong-kyue-kim, H. Sim, K. Park, and . Park, Lineartime construction of suffix arrays, Combinatorial Pattern Matching, pp.186-199, 2003.

P. Ko and S. Aluru, Space Efficient Linear Time Construction of Suffix Arrays, Combinatorial Pattern Matching, pp.200-210, 2003.
DOI : 10.1007/3-540-44888-8_15

M. Lothaire, Algebraic Combinatorics on Words, 2002.
DOI : 10.1017/CBO9781107326019
URL : https://hal.archives-ouvertes.fr/hal-00620608

S. Mantaci, A. Restivo, and M. Sciortino, Burrows???Wheeler transform and Sturmian words, Information Processing Letters, vol.86, issue.5, pp.241-246, 2003.
DOI : 10.1016/S0020-0190(02)00512-4

G. Manzini, An analysis of the Burrows---Wheeler transform, Journal of the ACM, vol.48, issue.3, pp.407-430, 2001.
DOI : 10.1145/382780.382782