Lexical permutation sorting algorithm

被引：15

作者：

Arnavut, Z ^{[1
]}

Magliveras, AS

机构：

[1] SUNY Coll Fredonia, Dept Math & Comp Sci, Fredonia, NY 14063 USA

[2] Univ Nebraska, Dept Comp Sci & Comp Engn, Lincoln, NE 68588 USA

来源：

COMPUTER JOURNAL | 1997年 / 40卷 / 05期

关键词：

D O I：

10.1093/comjnl/40.5.292

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Block Sorting Lossless Data Compression Algorithm (BWT) described by Burrows and Wheeler has received considerable attention, Its compression rates are simliar to context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques. This paper describes the Lexical Permutation Sorting Algorithm (LPSA), its theoretical basis and delineates its relationship to BWT. In particular we describe how BWT can be reduced to LPSA and show how LPSA could give better results than BWT when transmitting permutations.

引用

页码：292 / 295

页数：4