期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：10
出版社：S.S. Mishra
摘要：Mo dern biological science produces vast amounts of genomic progression data. This is igniting the need for competent algorithms for sequence compression and investigation. Data solidity and the related techniques coming from information theory are often perceived as being of great interest for information communication and storage. In recent years, a substantial effort has been made for the application of textual data compression techniques to various computational biology tasks, ranging from storage and indexing of large datasets to comparison of genomic databases. In this paper we review the ways in which ideas and approaches fundamental to the theory and practice of data compression have been used in the area of bioinformatics. We look at how basic theoretical ideas from data compression, such as Need of compression, lossy vs lossless compression, how to measure compression ratio, how do can we compress a biological sequence and why other universal text compression algorithms are not suitable for biological sequence.This article introduces several algorithms which are used in past twenty year for DNA sequence compression. These algorithms used enhance technique related to previous one with improved result. This paper introduced idea of popular DNA sequence co mpression algorithm such as Biocompress, Cfact Rival, Gen Compress, CTW-LZ, Genome Compress, DNACompress, Huff bit Compress, Hash based, look Up Table, Differential Direct Coding and LSDB method.
关键词：DN A compression; Genome compression; compression; biocompression
