arrow
返回

Efficient DNA-based data storage using shortmer combinatorial encoding

delete2024-04-02
delete8
delete
OA
AI
I
Inbal Preuss *
M
Michael A. Rosenberg
Z
Zohar Yakhini
L
Leon Anavy
DOI:10.1038/s41598-024-58386-zdelete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Data storage in DNA has recently emerged as a promising archival solution, offering space-efficient and long-lasting digital storage solutions. Recent studies suggest leveraging the inherent redundancy of synthesis and sequencing technologies by using composite DNA alphabets. A major challenge of this approach involves the noisy inference process, obstructing large composite alphabets. This paper introduces a novel approach for DNA-based data storage, offering, in some implementations, a 6.5-fold increase in logical density over standard DNA-based storage systems, with near-zero reconstruction error. Combinatorial DNA encoding uses a set of clearly distinguishable DNA shortmers to construct large combinatorial alphabets, where each letter consists of a subset of shortmers. We formally define various combinatorial encoding schemes and investigate their theoretical properties. These include information density and reconstruction probabilities, as well as required synthesis and sequencing multiplicities. We then propose an end-to-end design for a combinatorial DNA-based data storage system, including encoding schemes, two-dimensional (2D) error correction codes, and reconstruction algorithms, under different error regimes. We performed simulations and show, for example, that the use of 2D Reed-Solomon error correction has significantly improved reconstruction rates. We validated our approach by constructing two combinatorial sequences using Gibson assembly, imitating a 4-cycle combinatorial synthesis process. We confirmed the successful reconstruction, and established the robustness of our approach for different error types. Subsampling experiments supported the important role of sampling rate and its effect on the overall performance. Our work demonstrates the potential of combinatorial shortmer encoding for DNA-based data storage and describes some theoretical research questions and technical challenges. Combining combinatorial principles with error-correcting strategies, and investing in the development of DNA synthesis technologies that efficiently support combinatorial synthesis, can pave the way to efficient, error-resilient DNA-based storage solutions.
Keyword:
INFORMATION-STORAGE
GENERATION
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Scientific Reports 封面图
Scientific Reports
IF:
3.9
论文数:
28.7W
被引数:
108.9W

机构

R
Reichman University
学者数:
38
论文数: 30
被引数: 632
B
bar-ilan-university
学者数:
12
论文数: 7
被引数: 0
引用论文

引用论文

Candida glabrata, Friend and Foe
err2015-09-16
err0
errOAAI
errPhyllix Tam; Kirsten Gee; Miryam Piechocinski; Ian Macreadie
err分享
err收藏
Data storage in DNA with fewer synthesis cycles using composite DNA letters
err2019-09-09
err121
PREAI
errAnavy, Leon; Vaknin, Inbal; Atar, Orna; Amit, Roee; Yakhini, Zohar
err分享
err收藏
Scaling logical density of DNA storage with enzymatically-ligated composite motifs
err2023-09-25
err6
errOAAI
errYan, Yiqing; Pinnamaneni, Nimesh; Chalapati, Sachin; Crosbie, Conor; Appuswamy, Raja
err分享
err收藏
Paraveinal Mesophyll of Soybean Leaves in Relation to Assimilate Transfer and Compartmentation
err1983-06-01
err0
errOAAI
errVincent R. Franceschi; Vernon A. Wittenbach; Robert T. Giaquinta
err分享
err收藏
Synthesis of high-quality libraries of long (150mer) oligonucleotides by a novel depurination controlled process
err2010-03-20
err386
errOAAI
errLeProust, Emily M.; Peck, Bill J.; Spirin, Konstantin; McCuen, Heather Brummel; Moore, Bridget; Namsaraev, Eugeni; Caruthers, Marvin H.
err分享
err收藏
学者 查看更多内容