pith. machine review for the scientific record. sign in

arxiv: 1204.1912 · v1 · submitted 2012-04-09 · 💻 cs.IT · math.IT

Recognition: unknown

Reference Based Genome Compression

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords genomereferencealgorithmcompressescompressiondatamappingtarget
0
0 comments X
read the original abstract

DNA sequencing technology has advanced to a point where storage is becoming the central bottleneck in the acquisition and mining of more data. Large amounts of data are vital for genomics research, and generic compression tools, while viable, cannot offer the same savings as approaches tuned to inherent biological properties. We propose an algorithm to compress a target genome given a known reference genome. The proposed algorithm first generates a mapping from the reference to the target genome, and then compresses this mapping with an entropy coder. As an illustration of the performance: applying our algorithm to James Watson's genome with hg18 as a reference, we are able to reduce the 2991 megabyte (MB) genome down to 6.99 MB, while Gzip compresses it to 834.8 MB.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.