Modified HuffBit Compress Algorithm - An Application of R.

ABSTRACT: The databases of genomic sequences are growing at an explicative rate because of the increasing growth of living organisms. Compressing deoxyribonucleic acid (DNA) sequences is a momentous task as the databases are getting closest to its threshold. Various compression algorithms are developed for DNA sequence compression. An efficient DNA compression algorithm that works on both repetitive and non-repetitive sequences known as "HuffBit Compress" is based on the concept of Extended Binary Tree. In this paper, here is proposed and developed a modified version of "HuffBit Compress" algorithm to compress and decompress DNA sequences using the R language which will always give the Best Case of the compression ratio but it uses extra 6 bits to compress than best case of "HuffBit Compress" algori

SUBMITTER: Habib N 

PROVIDER: S-EPMC6340127 | biostudies-literature | 2018 Feb

REPOSITORIES: biostudies-literature