.png){kind=icon}
Return
Compressed DNA Coding Using Minimum Variance Huffman Tree
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.2991461.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Compression
data storage
DNA
Huffman coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSaveEfficient Balanced and Maximum Homopolymer-Run Restricted Block Codes for DNA-Based Data Storage
PREAI
ShareSaveShareSaveShareSave
View more