Year: 2015
Type: article
Abstract: MOTIVATION: Storing, transmitting and archiving data produced by next-generation sequencing is a significant computational burden. New compression techniques tailored to short-read sequence data are needed. RESULTS: We present here an approach to compression that reduces the difficulty of managing large-scale sequencing data. Our novel approach sits between pure reference-based compression and reference-free compression and combines much of the benefit of reference-based approaches with the flexibility of de novo encoding. Our method, called path encoding, draws a connection between storing paths in de Bruijn graphs and context-dependent arithmetic coding. Supporting this method is a system to compactly store sets of kmers that is of independent interest. We are able to encode RNA-seq reads using 3-11% of the space of the sequence in raw FASTA files, which is on average more than 34% smaller than competing approaches. We also show that even if the reference is very poorly matched to the reads that are being encoded, good compression can still be achieved. AVAILABILITY AND IMPLEMENTATION: Source code and binaries freely available for download at http://www.cs.cmu.edu/∼ckingsf/software/pathenc/, implemented in Go and supported on Linux and Mac OS X.
Source: Bioinformatics
Authors: Carl Kingsford, Rob Patro
Institutions: Stony Brook University, Carnegie Mellon University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,989
Awards: Fast k-mer Counting to Quantify Gene Expression and Improve Genome Assembly, AF: Small: Multiscale Spectral Signatures for Local and Multi-objective Biological Network Alignment, Carl Kingsford Investigator Award, CAREER: Model-based Reconstruction of Ancient Biological Networks, Algorithms for Managing Uncertainty in Chromosome Conformation Capture Data, CAREER: Model-based Reconstruction of Ancient Biological Networks
OpenAlex ID: W2101247207
