Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithm
- 26 September 2006
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 37 (3), 247-265
- https://doi.org/10.1002/spe.763
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Less redundant codes for variable size dictionariesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Simple Linear Work Suffix Array ConstructionLecture Notes in Computer Science, 2003
- Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression AlgorithmsLecture Notes in Computer Science, 2003
- Block sorting and compressionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the performance of BWT sorting algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Burrows–Wheeler compression with variable length integer codesSoftware: Practice and Experience, 2002
- Second step algorithms in the Burrows–Wheeler compression algorithmSoftware: Practice and Experience, 2001
- Improvements to Burrows-Wheeler compression algorithmSoftware: Practice and Experience, 2000
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975