Loading [a11y]/accessibility-menu.js
Compressed DNA Coding Using Minimum Variance Huffman Tree | IEEE Journals & Magazine | IEEE Xplore
Scheduled Maintenance: On Tuesday, 25 February, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC). During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Compressed DNA Coding Using Minimum Variance Huffman Tree


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 wit...Show More

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.
Published in: IEEE Communications Letters ( Volume: 24, Issue: 8, August 2020)
Page(s): 1602 - 1606
Date of Publication: 30 April 2020

ISSN Information:


References

References is not available for this document.