Compression of structured high-throughput sequencing data
Fabien Campagne, Kevin C. Dorff, Nyasha Chambwe, James T. Robinson,, Jill P. Mesirov, Thomas D. Wu

TL;DR
This paper introduces new data storage and compression methods for high-throughput sequencing data that support schema evolution and significantly reduce storage requirements, enabling more efficient data management.
Contribution
The authors developed novel approaches for storing HTS data that support schema evolution and achieve superior compression compared to existing methods.
Findings
Spliced RNA-Seq alignments stored in less than 4% of BAM size.
Over 20% reduction in dataset size for gene expression and epigenetic data.
Software suite supporting common HTS analyses with improved storage efficiency.
Abstract
Large biological datasets are being produced at a rapid pace and create substantial storage challenges, particularly in the domain of high-throughput sequencing (HTS). Most approaches currently used to store HTS data are either unable to quickly adapt to the requirements of new sequencing or analysis methods (because they do not support schema evolution), or fail to provide state of the art compression of the datasets. We have devised new approaches to store HTS data that support seamless data schema evolution and compress datasets substantially better than existing approaches. Building on these new approaches, we discuss and demonstrate how a multi-tier data organization can dramatically reduce the storage, computational and network burden of collecting, analyzing, and archiving large sequencing datasets. For instance, we show that spliced RNA-Seq alignments can be stored in less than…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
