51. Exploring Lossy Compression of Gene Expression Matrices
- Author
-
Alexandra Poulos, M. Reed Bender, Coleman B. McKnight, F. Alex Feltus, and Jon Calhoun
- Subjects
Lossless compression ,Physics::Instrumentation and Detectors ,Computer science ,Data_CODINGANDINFORMATIONTHEORY ,Lossy compression ,computer.software_genre ,Data type ,Domain (software engineering) ,Reduction (complexity) ,Workflow ,Compression (functional analysis) ,Compression ratio ,Data mining ,computer - Abstract
Gene Expression Matrices (GEMs) are a fundamental data type in the genomics domain. As the size and scope of genomics experiments increase, researchers are struggling to process large GEMs through downstream workflows with currently accepted practices. In this paper, we propose a methodology to reduce the size of GEMs using multiple approaches. Our method partitions data into discrete fields based on data type and employs state-of-the-art lossless and lossy compression algorithms to reduce the input data size. This work explores a variety of lossless and lossy compression methods to determine which methods work the best for each component of a GEM. We evaluate the accuracy of the compressed GEMs by running them through the Knowledge Independent Network Construction (KINC) workflow and comparing the quality of the resulting gene co-expression network with a lossless control to verify result fidelity. Results show that utilizing a combination of lossy and lossless compression results in compression ratios up to 9.77× on a Yeast GEM, while still preserving the biological integrity of the data. Usage of the compression methodology on the Cancer Cell Line Encyclopedia(CCLE) GEM resulted in compression ratios up to 9.26×. By using this methodology, researchers in the Genomics domain may be able to process previously inaccessible GEMs while realizing significant reduction in computational costs.
- Published
- 2019
- Full Text
- View/download PDF