원문정보
초록
영어
DNA sequences comprise of sequentially linked nucleotides, A, C, G and T. As a result of the genome projects, a significant amount of DNA sequences of various species are deposited in various databases. Human DNA contains about 3 billion base pairs. The number of genes within the DNA is 20,000 to 25,000. For storing DNA data of a single person, we require approximately 10 CD – ROMs. This amounts to huge data storage costs, subsequently making the use of these data such as analysis and retrieval quite challenging. DNA sequence analysis is useful in diverse areas such as forensics, medical research, pharmacy, agriculture etc. It is very necessary to address the storage issue of these exponentially growing data. In this paper we have implemented 4 different algorithms for DNA data compression: LZW (Lampel-ziv-Welch) algorithm, run length encoding algorithm, Arithmetic coding and Substitution method. The compression results on these algorithms are presented and compared on DNA sequence data of 10 different species.
목차
1. Introduction
2. Method
3. Results
4. Conclusion
5. Future Work
References