Publication Type : Journal Article
Publisher : IEEE Communications Letters
Source : IEEE Communications Letters [Q 2], Impact Factor: 3.436 (IEEE ), vol. 24(8), pp. 1602-1606, 2020, [SCIE].
Url : https://ieeexplore.ieee.org/document/9082611
Campus : Coimbatore
School : School of Engineering
Department : Computer Science and Engineering
Verified : No
Year : 2020
Abstract : DNA data storage is a highly emerging technology of storing large amount of data in a small volume for a long period of time. However, synthesis of DNA sequences come with a cost that depends on the number of nucleotides present in it. An efficient algorithm to store large amount of data in small number of nucleotides has been proposed which uses minimum-variance Huffman coding. The DNA sequences generated follow GC-constraint and run-length constraint of at most 1. Texts have been stored in lossless manner. Images have been stored in both lossless and lossy manner. In either of the cases, a high code-rate has been attained, thus implying good compression and reduction in cost of synthesis.
Cite this Research Publication : Pooja Mishra, Chiranjeev Bhaya, Arup Kumar Pal and Abhay Kumar Singh, “Compressed DNA coding using Minimum Variance Huffman Tree”, IEEE Communications Letters [Q 2], Impact Factor: 3.436 (IEEE ), vol. 24(8), pp. 1602-1606, 2020, [SCIE].