DNA Compression Challenge Revisited: A Dynamic Programming Approach

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Standard compression algorithms are not able to compress DNA sequences. Recently, new algorithms have been introduced specifically for this purpose, often using detection of long approximate repeats. In this paper, we present another algorithm, DNAPack, based on dynamic programming. In comparison with former existing programs, it compresses DNA slightly better, while the cost of dynamic programming is almost negligible.