A New Challenge for Compression Algorithms: Genetic Sequences (1994)
| Venue: | Information Processing & Management |
| Citations: | 55 - 0 self |
BibTeX
@INPROCEEDINGS{Grumbach94anew,
author = {Stephane Grumbach and Fariza Tahi},
title = {A New Challenge for Compression Algorithms: Genetic Sequences},
booktitle = {Information Processing & Management},
year = {1994},
pages = {875--886}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Universal data compression algorithms fail to compress genetic sequences. It is due to the specificity of this particular kind of "text". We analyze in some details the properties of the sequences, which cause the failure of classical algorithms. We then present a lossless algorithm, biocompress-2, to compress the information contained in DNA and RNA sequences, based on the detection of regularities, such as the presence of palindromes. The algorithm combines substitutional and statistical methods, and to the best of our knowledge, lead to the highest compression of DNA. The results, although not satisfactory, gives insight to the necessary correlation between compression and comprehension of genetic sequences. 1 Introduction There are plenty of specific types of data which need to be compressed, for ease of storage and communication. Among them are texts (such as natural language and programs), images, sounds, etc. In this paper, we focus on the compression of a specific kin...
