A note on the Burrows-Wheeler transformation

被引：35

作者：

Crochemore, M ^{[1
]}

Désarménien, J ^{[1
]}

Perrin, D ^{[1
]}

机构：

[1] Univ Marne la Vallee, F-77454 Marne La Vallee, France

来源：

THEORETICAL COMPUTER SCIENCE | 2005年 / 332卷 / 1-3期

关键词：

text compression; combinatorics on words;

D O I：

10.1016/j.tcs.2004.11.014

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：567 / 572

页数：6

共 11 条

[1]

BANNAI H, 2003, LECT NOTES COMPUTER, V2747

[2]

Burrows M, 1994, BLOCK SORTING DATA C

[3]

CROCHEMORE M, 2002, JEWELS STRIGOLOGY

[4] Words over an ordered alphabet and suffix permutations [J].

Duval, JP ;

Lefebvre, A .

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2002, 36 (03) :249-259

[5] COUNTING PERMUTATIONS WITH GIVEN CYCLE STRUCTURE AND DESCENT SET [J].

GESSEL, IM ;

REUTENAUER, C .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1993, 64 (02) :189-215

[6]

Kärkkäinen J, 2003, LECT NOTES COMPUT SC, V2719, P943

[7]

Kim DK, 2003, LECT NOTES COMPUT SC, V2676, P186

[8]

Ko P, 2003, LECT NOTES COMPUT SC, V2676, P200

[9]

Lothaire M, 2002, Encyclopedia Math. Appl.

[10] Burrows-Wheeler transform and Sturmian words [J].

Mantaci, S ;

Restivo, A ;

Sciortino, M .

INFORMATION PROCESSING LETTERS, 2003, 86 (05) :241-246

← 1 2 →