DNA-Based Storage: Models and Fundamental Limits

DNA-Based Storage: Models and Fundamental Limits
复制标题

基于 DNA 的存储:模型和基本限制

DOI:
10.1109/tit.2021.3058966
复制
发表时间:
2021
影响因子:
2.5
通讯作者:
Heckel, Reinhard
Heckel, Reinhard
中科院分区:
计算机科学2区
文献类型:
--
作者:
Shomorony, Ilan;Heckel, Reinhard

文献摘要

参考文献

被引文献

相似文献

由于它的寿命和巨大的信息密度,DNA是一种有吸引力的档案存储介质。在这项工作中,我们研究了基于DNA的存储系统的基本限制和权衡,通过引入一个新的通道模型,我们称之为嘈杂的洗牌采样通道。受当前DNA合成和测序的技术限制的启发,该模型捕获了DNA存储系统的三个关键的独特方面:(1)数据被写入许多短DNA分子;(2)分子在合成和测序期间被噪声破坏;(3)通过从DNA池中随机采样读取数据。我们提供的容量结果,在特定的噪声和采样假设下,该信道,并表明,在许多情况下,一个简单的基于索引的编码方案是最佳的。
Due to its longevity and enormous information density, DNA is an attractive medium for archival storage. In this work, we study the fundamental limits and trade-offs of DNA-based storage systems by introducing a new channel model, which we call the noisy shuffling-sampling channel. Motivated by current technological constraints on DNA synthesis and sequencing, this model captures three key distinctive aspects of DNA storage systems: (1) the data is written onto many short DNA molecules; (2) the molecules are corrupted by noise during synthesis and sequencing and (3) the data is read by randomly sampling from the DNA pool. We provide capacity results for this channel under specific noise and sampling assumptions and show that, in many scenarios, a simple index-based coding scheme is optimal.
DOI: 10.1038/s41467-020-19148-3
发表时间: 2020-10-22
影响因子: 16.6
作者:
Antkowiak PL;Lietard J;Darestani MZ;Somoza MM;Stark WJ;Heckel R;Grass RN
通讯作者: Grass RN
DOI: 10.1038/s41598-019-45832-6
发表时间: 2019-07-04
期刊: SCIENTIFIC REPORTS
影响因子: 4.6
作者:
Heckel, Reinhard;Mikutis, Gediminas;Grass, Robert N.
通讯作者: Grass, Robert N.
DOI: 10.1109/isit.2006.261874
发表时间: 2006
期刊: 2006 IEEE International Symposium on Information Theory
影响因子: --
作者:
M. Mitzenmacher
通讯作者: M. Mitzenmacher
通过插入同步代码进行精确重建
DOI: --
发表时间: 2016
影响因子: 2.5
作者:
Frederic Sala;Ryan Gabrys;Clayton Schoeny;L. Dolecek
通讯作者: L. Dolecek
非对称李距离代码:新的界限和结构
DOI: --
发表时间: 2015
期刊: Information Theory Workshop
影响因子: --
作者:
Ryan Gabrys;Han Mao Kiah;O. Milenkovic
通讯作者: O. Milenkovic