CONTRIBUTIONS
We developed a new lossless compression method for WIG data, named smallWig, offering the best known compression rates for RNA-seq data and featuring random access functionalities that enable visualization, summary statistics analysis and fast queries from the compressed files. Our approach results in order of magnitude improvements compared with bigWig and ensures compression rates only a fraction of those produced by cWig. The key features of the smallWig algorithm are statistical data analysis and a combination of source coding methods that ensure high flexibility and make the algorithm suitable for different applications. Furthermore, for general-purpose file compression, the compression rate of smallWig approaches the empirical entropy of the tested WIG data. For compression with random query features, smallWig uses a simple block-based compression scheme that introduces only a minor overhead in the compression rate. For archival or storage space-sensitive applications, the method relies on context mixing techniques that lead to further improvements of the compression rate. Implementations of smallWig can be executed in parallel on different sets of chromosomes using multiple processors, thereby enabling desirable scaling for future transcriptome Big Data platforms.
MOTIVATION
The development of next-generation sequencing technologies has led to a dramatic decrease in the cost of DNA/RNA sequencing and expression profiling. RNA-seq has emerged as an important and inexpensive technology that provides information about whole transcriptomes of various species and organisms, as well as different organs and cellular communities. The vast volume of data generated by RNA-seq experiments has significantly increased data storage costs and communication bandwidth requirements. Current compression tools for RNA-seq data such as bigWig and cWig either use general-purpose compressors (gzip) or suboptimal compression schemes that leave significant room for improvement. To substantiate this claim, we performed a statistical analysis of expression data in different transform domains and developed accompanying entropy coding methods that bridge the gap between theoretical and practical WIG file compression rates.
RESULTS
We tested different variants of the smallWig compression algorithm on a number of integer-and real- (floating point) valued RNA-seq WIG files generated by the ENCODE project. The results reveal that, on average, smallWig offers 18-fold compression rate improvements, up to 2.5-fold compression time improvements, and 1.5-fold decompression time improvements when compared with bigWig. On the tested files, the memory usage of the algorithm never exceeded 90 KB. When more elaborate context mixing compressors were used within smallWig, the obtained compression rates were as much as 23 times better than those of bigWig. For smallWig used in the random query mode, which also supports retrieval of the summary statistics, an overhead in the compression rate of roughly 3-17% was introduced depending on the chosen system parameters. An increase in encoding and decoding time of 30% and 55% represents an additional performance loss caused by enabling random data access. We also implemented smallWig using multi-processor programming. This parallelization feature decreases the encoding delay 2-3.4 times compared with that of a single-processor implementation, with the number of processors used ranging from 2 to 8; in the same parameter regime, the decoding delay decreased 2-5.2 times.
AVAILABILITY AND IMPLEMENTATION
The smallWig software can be downloaded from: http://stanford.edu/~zhiyingw/smallWig/smallwig.html, http://publish.illinois.edu/milenkovic/, http://web.stanford.edu/~tsachy/.
CONTACT
zhiyingw@stanford.edu
SUPPLEMENTARY INFORMATION
Supplementary data are available at Bioinformatics online.
[1]
Robert G. Gallager,et al.
Variations on a theme by Huffman
,
1978,
IEEE Trans. Inf. Theory.
[2]
Justin Zobel,et al.
Optimized Relative Lempel-Ziv Compression of Genomes
,
2011,
ACSC.
[3]
Susana Vinga,et al.
Information theory applications for biological sequence analysis
,
2013,
Briefings Bioinform..
[4]
Congmao Wang,et al.
A novel compression tool for efficient storage of genome resequencing data
,
2011,
Nucleic acids research.
[5]
Glen G. Langdon,et al.
Arithmetic Coding
,
1979
.
[6]
M. Gerstein,et al.
RNA-Seq: a revolutionary tool for transcriptomics
,
2009,
Nature Reviews Genetics.
[7]
Yanjun Han,et al.
Minimax Estimation of Functionals of Discrete Distributions
,
2014,
IEEE Transactions on Information Theory.
[8]
Wing-Kin Sung,et al.
CWig: compressed representation of Wiggle/BedGraph format
,
2014,
Bioinform..
[9]
Paul T. Groth,et al.
The ENCODE (ENCyclopedia Of DNA Elements) Project
,
2004,
Science.
[10]
Ioan Tabus,et al.
Genome compression using normalized maximum likelihood models for constrained Markov sources
,
2008,
2008 IEEE Information Theory Workshop.
[11]
M. Stephens,et al.
RNA-seq: an assessment of technical reproducibility and comparison with gene expression arrays.
,
2008,
Genome research.
[12]
Galt P. Barber,et al.
BigWig and BigBed: enabling browsing of large distributed datasets
,
2010,
Bioinform..
[13]
Inder Jeet Taneja,et al.
Bounds on the redundancy of Huffman codes
,
1986,
IEEE Trans. Inf. Theory.
[14]
Dietrich Manstetten.
Tight bounds on the redundancy of Huffman codes
,
1992,
IEEE Trans. Inf. Theory.
[15]
Raphail E. Krichevsky,et al.
The performance of universal encoding
,
1981,
IEEE Trans. Inf. Theory.
[16]
Abraham Lempel,et al.
A universal algorithm for sequential data compression
,
1977,
IEEE Trans. Inf. Theory.
[17]
Trevor I. Dix,et al.
A Simple Statistical Algorithm for Biological Sequence Compression
,
2007,
2007 Data Compression Conference (DCC'07).
[18]
Armando J. Pinho,et al.
On the Representability of Complete Genomes by Multiple Competing Finite-Context (Markov) Models
,
2011,
PloS one.
[19]
Tsachy Weissman,et al.
The human genome contracts again
,
2013,
Bioinform..
[20]
Sara P. Garcia,et al.
GReEn: a tool for efficient compression of genome resequencing data
,
2011,
Nucleic acids research.
[21]
Jorma Rissanen,et al.
Universal coding, information, prediction, and estimation
,
1984,
IEEE Trans. Inf. Theory.
[22]
Szymon Grabowski,et al.
Genome compression: a novel approach for large collections
,
2013,
Bioinform..
[23]
Frans M. J. Willems,et al.
The context-tree weighting method: basic properties
,
1995,
IEEE Trans. Inf. Theory.