DNA Compression Challenge Revisited: A Dynamic Programming Approach

  • Behshad Behzadi
  • Fabrice Le Fessant
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3537)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Behshad Behzadi
    • 1
  • Fabrice Le Fessant
    • 1
  1. 1.LIXEcole PolytechniquePalaiseau cedexFrance

Personalised recommendations