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, DNA Pack, based on dynamic programming. In comparison with former existing programs, it compresses DNA slightly better, while the cost of dynamic programming is almost negligible. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Behzadi, B., & Le Fessant, F. (2005). DNA compression challenge revisited: A dynamic programming approach. In Lecture Notes in Computer Science (Vol. 3537, pp. 190–200). Springer Verlag. https://doi.org/10.1007/11496656_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
