4.7 Article

Design of Constraint Coding Sets for Archive DNA Storage

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TCBB.2021.3127271

关键词

DNA; Encoding; Codes; Sequential analysis; Error analysis; Memory; Libraries; Lower bound; coding set; QRSS-MPA; secondary structure; DNA storage

资金

  1. National Key Technology R&D Program of China [2018YFC0910500]
  2. National Natural Science Foundation of China [61425002, 61751203, 61772100, 61972266, 61802040]
  3. Innovation and Entrepreneurship Team of Dalian University [XQN202008]
  4. Natural Science Foundation of Liaoning Province [2021-MS-344]
  5. Liaoning BaiQianWan Talents Program
  6. General Project of the Education Department of Liaoning Province [LJKZ1186]
  7. LiaoNing Revitalization Talents Programunder Grant [XLYC2008017]

向作者/读者索取更多资源

This article introduces a reliable solution for big data storage using DNA molecules, and proposes a new algorithm to increase the lower bound of the coding set and satisfy specific constraints. Through testing and comparison, significant improvements in storage are achieved.
With the advent of the era of massive data, the increase of storage demand has far exceeded current storage capacity. DNA molecules provide a reliable solution for big data storage by virtue of their large capacity, high density, and long-term stability. To reduce errors in storing procedures, constructing a sufficient set of constraint encoding is critical for achieving DNA storage. A new version of the Marine Predator algorithm (called QRSS-MPA) is proposed in this paper to increase the lower bound of the coding set while satisfying the specific combination of constraints. In order to demonstrate the effectiveness of the improvement, the classical CEC-05 test function is used to test and compare the mean, variance, scalability, and significance. In terms of storage, the lower bound of construction is compared with previous works, and the result is found to be significantly improved. In order to prevent the emergence of a secondary structure that leads to sequencing failure, we give a more stringent lower bound for the constraint coding set, which is of great significance for reducing the error rate of DNA storage amidst its rapid development.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据