The full text of this article:

A Lossless Compression Algorithm for DNA sequences
by Taysir H.A. Soliman, Tarek F. Gharib, Alshaimaa Abo-Alian, M.A. El Sharkawy
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 5, No. 6, 2009
Abstract: 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.

is only available to individual subscribers or to users at subscribing institutions.

Pay per view: If you are not a Subscriber and you just want to read the full contents of this article, please click here to purchase online access to the full-text of this article. Please allow 3 days + mailing time. Current price for article is Thirty Euros (€30)

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA) journal, that have been redirected here, please check if you have a registered username/password subscription with Inderscience. If that is the case, please Login:

If you are not yet a Subscriber to International Journal of Bioinformatics Research and Applications (IJBRA) journal, you can subscribe by following a few simple and quick steps. A subscription will give you complete access to all articles in the current issue, as well as to all articles in the previous three years, where applicable. Click here to subscribe.

Should you experience further difficulties or have any enquiries, please email subs@inderscience.com