A lossless compression algorithm for DNA sequences

The increase of the amount of DNA sequences requires efficient computational algorithms for performing sequence comparison and analysis. Standard compression algorithms are not able to compress DNA sequences because they do not consider special characteristics of DNA sequences (i.e., DNA sequences c...

Full description

Saved in:
Bibliographic Details
Published in:International journal of bioinformatics research and applications Vol. 5; no. 6; p. 593
Main Authors: Soliman, Taysir H A, Gharib, Tarek F, Abo-Alian, Alshaimaa, El Sharkawy, M A
Format: Journal Article
Language:English
Published: Switzerland 2009
Subjects:
Algorithms
Databases, Genetic
DNA - genetics
ISSN:1744-5485
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The increase of the amount of DNA sequences requires efficient computational algorithms for performing sequence comparison and analysis. Standard compression algorithms are not able to compress DNA sequences because they do not consider special characteristics of DNA sequences (i.e., DNA sequences contain several approximate repeats and complimentary palindromes). Recently, new algorithms have been proposed to compress DNA sequences, often using detection of long approximate repeats. The current work proposes a Lossless Compression Algorithm (LCA), providing a new encoding method. LCA achieves a better compression ratio than that of existing DNA-oriented compression algorithms, when compared to GenCompress, DNACompress, and DNAPack.
ISSN:1744-5485
DOI:10.1504/IJBRA.2009.029040