Modifications of the Burrows and Wheeler data compression algorithm

被引：24

作者：

Balkenhol, B ^{[1
]}

Kurtz, S ^{[1
]}

Shtarkov, YM ^{[1
]}

机构：

[1] Univ Bielefeld, Fak Math, D-33501 Bielefeld, Germany

来源：

DCC '99 - DATA COMPRESSION CONFERENCE, PROCEEDINGS | 1999年

关键词：

D O I：

10.1109/DCC.1999.755668

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：188 / 197

页数：2

共 15 条

[1]

BALKENHOL B, 1998, 98069 U BIEL DISKR S

[2]

Bentley JL, 1997, PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P360

[3]

Burrows M, 1994, 124 DIG SYST RES CTR

[4]

Cleary J. G., 1995, Proceedings. DCC '95 Data Compression Conference (Cat. No.95TH8037), P52, DOI 10.1109/DCC.1995.515495

[5]

FENWICK P, 1996, P 19 AUSTR COMP SCI

[6]

FRANCESCHI O, 1988, PICT COD S PCS 88 TO

[7]

Kurtz S., 1998, 9803 U BIEL TECHN FA

[8] The context trees of block sorting compression [J].

Larsson, NJ .

DCC '98 - DATA COMPRESSION CONFERENCE, 1998, :189-198

[9] SUFFIX ARRAYS - A NEW METHOD FOR ONLINE STRING SEARCHES [J].

MANBER, U ;

MYERS, G .

[10] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J].

MCCREIGHT, EM .