Optimizing DNA sequences using Tetra-nucleotide RankList

摘要

Recent advancement in the field of life science has caused the generation of massive amount of genomic data. Storing such huge amount of data require a lot of memory. However, by using efficient algorithm we can optimize the size of the dataset and save memory storage. In this paper we have proposed an algorithm which uses Tetra-nucleotide RankList for optimizing the storage requirement for storing DNA sequences in database which can be easily retrieved in a time efficient manner. Tetra-nucleotide RankList has been generated by testing several DNA sequences to confirm the uniformity of the RankList over all DNA sequences. The algorithm has been applied on the genome sequences of different bacteria and viruses and the space for storing those DNA sequences has been reduced up to 30%.