Improvements to Burrows-Wheeler compression algorithm
- 10 November 2000
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 30 (13) , 1465-1483
- https://doi.org/10.1002/1097-024x(20001110)30:13<1465::aid-spe345>3.0.co;2-d
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Reducing the space requirement of suffix treesSoftware: Practice and Experience, 1999
- Average Case Analyses of List Update Algorithms, with Applications to Data CompressionAlgorithmica, 1998
- Arithmetic coding revisitedACM Transactions on Information Systems, 1998
- Semantically Motivated Improvements for PPM VariantsThe Computer Journal, 1997
- The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and ImprovementsThe Computer Journal, 1996
- On-line construction of suffix treesAlgorithmica, 1995
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- The performance of universal encodingIEEE Transactions on Information Theory, 1981
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976