Binary codes for locally homogeneous sequences☆
References (11)
A compression method for clustered bit-vectors
Information Processing Letters
(1978)- et al.
Inverted index compression using word-aligned binary codes
Information Retrieval
(2005) - et al.
Modern Information Retrieval
(1999) Universal codeword sets and representations of the integers
IEEE Transactions on Information Theory
(1975)The Burrows–Wheeler transform for block sorting text compression: Principles and improvements
The Computer Journal
(1996)
There are more references available in the full text version of this article.
Cited by (8)
Lossless chain code compression with an improved Binary Adaptive Sequential Coding of zero-runs
2021, Journal of Visual Communication and Image RepresentationTechniques for Inverted Index Compression
2021, ACM Computing SurveysTechniques for Inverted Index Compression
2019, arXivData structures and compression algorithms for high-throughput sequencing technologies
2010, BMC BioinformaticsHandbook of data compression
2010, Handbook of Data CompressionData structures and compression algorithms for genomic sequence data
2009, Bioinformatics
- ☆
The approach described in Section 2 was presented in preliminary form at the 2005 IEEE Data Compression Conference, March 29–31, 2005, Snowbird, Utah.
- 1
This author was supported by the Australian Research Council, the ARC Special Research Center for Perceptive and Intelligent Machines in Complex Environments, and the NICTA Victoria Laboratory.
- 2
This author was supported by the ARC Special Research Center for Perceptive and Intelligent Machines in Complex Environments.
Copyright © 2006 Elsevier B.V. All rights reserved.