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 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.
Soliman
Taysir H A
TH
Faculty of Computer and Information, Assiut University, Egypt. taysir_soliman@hotmail.com
Gharib
Tarek F
TF
Abo-Alian
Alshaimaa
A
El Sharkawy
M A
MA
D000465:Algorithms; D004247:DNA / Q000235:genetics*; D030541:Databases, Genetic
D004247:DNA