Robust transmission of unbounded strings using Fibonacci representations
IEEE Transactions on Information Theory
A new challenge for compression algorithms: genetic sequences
Information Processing and Management: an International Journal - Special issue: data compression
A Guaranteed Compression Scheme for Repetitive DNA Sequences
DCC '96 Proceedings of the Conference on Data Compression
Compression of Biological Sequences by Greedy Off-Line Textual Substitution
DCC '00 Proceedings of the Conference on Data Compression
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
MicroRNA target detection and analysis for genes related to breast cancer using MDLcompress
EURASIP Journal on Bioinformatics and Systems Biology
A Lossless Compression Algorithm for DNA sequences
International Journal of Bioinformatics Research and Applications
Searching a pattern in compressed DNA sequences
International Journal of Bioinformatics Research and Applications
Iterative Dictionary Construction for Compression of Large DNA Data Sets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Non-repetitive DNA sequence compression using memoization
ISBMDA'06 Proceedings of the 7th international conference on Biological and Medical Data Analysis
Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Complexity profiles of DNA sequences using finite-context models
USAB'11 Proceedings of the 7th conference on Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society: information Quality in e-Health
On enumerating the DNA sequences
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Optimized relative Lempel-Ziv compression of genomes
ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113
| Hi-index | 0.00 |
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.