.png){kind=icon}
返回
K-Means Multi-Verse Optimizer (KMVO) Algorithm to Construct DNA Storage Codes
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2970838.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In an era of information explosion, dealing with massive data has become a problem. Since DeoxyriboNucleic Acid (DNA) is a high-density storage medium with long storage endurance, a DNA based storage system is a viable solution. The first consideration of a DNA storage system is the DNA codes, which can avoid non-specific hybridization of DNA strands in the hybridization reaction process by using related constraints, such as Hamming distance constraints, GC-content constraints, and no-runlength constraints. A K-means Multi-Verse Optimizer (KMVO) algorithm is proposed to construct a better code boundary than the previous Multi-Verse Optimizer (MVO) algorithm that satisfies the above constraints. Our results can store information more efficiently over a given length, increasing storage utilization.
Keyword:
DNA code design
DNA storage
k-means
MVO algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Studies on GTO-based arbitrary waveform generator-the principle and its applicationGTO基任意波形发生器的研究——原理及其应用
PREAI
分享收藏分享收藏Design of Capacity-Approaching Constrained Codes for DNA-Based Storage Systems基于DNA的存储系统的容量接近约束代码的设计
PREAI
分享收藏Combining Data Longevity with High Storage Capacity-Layer-by-Layer DNA Encapsulated in Magnetic Nanoparticles将数据寿命与高存储容量相结合-封装在磁性纳米颗粒中的逐层DNA
PREAI
分享收藏
查看更多内容