.png){kind=icon}
返回
Compressed DNA Coding Using Minimum Variance Huffman Tree
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.2991461.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Compression
data storage
DNA
Huffman coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
OAAI
.png){kind=icon}
OAAI分享收藏Metabolic cooperation and spatiotemporal niche partitioning in a kefir microbial communitykefir微生物群落中的代谢合作和时空生态位分配
OAAI
OAAI分享收藏Genetic variations of ISL1 associated with human congenital heart disease in Chinese Han people中国汉族人群ISL1基因遗传变异与先天性心脏病的关系OAAI
OAAI分享收藏Efficient Balanced and Maximum Homopolymer-Run Restricted Block Codes for DNA-Based Data Storage
PREAI
分享收藏
查看更多内容