论文信息 - A note on the Burrows-Wheeler transformation - 字舞流文

A note on the Burrows-Wheeler transformation

We relate the Burrows-Wheeler transformation with a result in combinatorics on words known as the Gessel-Reutenauer transformation.

Maxime Crochemore | Dominique Perrin | Jacques Désarménien | D. Perrin | M. Crochemore | J. Désarménien

[1] Giovanni Manzini,et al. An analysis of the Burrows-Wheeler transform , 2001, SODA '99.

[2] Ira M. Gessel,et al. Counting Permutations with Given Cycle Structure and Descent Set , 1993, J. Comb. Theory A.

[3] Peter Sanders,et al. Simple Linear Work SuÆx Array Constru tion ? , 2007 .

[4] Dong Kyue Kim,et al. Linear-Time Construction of Suffix Arrays , 2003, CPM.

[5] Pang Ko,et al. Linear Time Construction of Suffix Arrays , 2002 .

[6] Srinivas Aluru,et al. Space efficient linear time construction of suffix arrays , 2005, J. Discrete Algorithms.

[7] Peter Sanders,et al. Simple Linear Work Suffix Array Construction , 2003, ICALP.

[8] Antonio Restivo,et al. Burrows-Wheeler transform and Sturmian words , 2003, Inf. Process. Lett..

[9] Arnaud Lefebvre,et al. Words over an ordered alphabet and suffix permutations , 2002, RAIRO Theor. Informatics Appl..

[10] Ayumi Shinohara,et al. Inferring Strings from Graphs and Arrays , 2003, MFCS.

[11] J. Allouche. Algebraic Combinatorics on Words , 2005 .