首页> 外文期刊>IEEE Transactions on Information Theory >Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
【24h】

Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms

机译:在生物体DNA中存储数据的纠错码

获取原文
获取原文并翻译 | 示例
           

摘要

The ability to store data in the DNA of a living organism has applications in a variety of areas including synthetic biology and watermarking of patented genetically modified organisms. Data stored in this medium are subject to errors arising from various mutations, such as point mutations, indels, and tandem duplication, which need to be corrected to maintain data integrity. In this paper, we provide error-correcting codes for errors caused by tandem duplications, which create a copy of a block of the sequence and insert it in a tandem manner, i.e., next to the original. In particular, we present two families of codes for correcting errors due to tandem duplications of a fixed length: the first family can correct any number of errors, while the second corrects a bounded number of errors. We also study codes for correcting tandem duplications of length up to a given constant k , where we are primarily focused on the cases of k=2,3 . Finally, we provide a full classification of the sets of lengths allowed in tandem duplication that result in a unique root for all sequences.
机译:将数据存储在活生物体的DNA中的能力已在多个领域中应用,包括合成生物学和获得专利的转基因生物的水印技术。存储在此介质中的数据会受到各种突变(例如点突变,插入/缺失和串联重复)引起的错误的影响,需要对其进行纠正以保持数据完整性。在本文中,我们提供了由串联重复操作引起的错误的纠错码,可创建该序列块的副本并以串联方式插入,即紧接原始序列。特别是,我们提供了两个用于纠正由于固定长度的串联重复复制引起的错误的代码家族:第一个家族可以纠正任何数量的错误,而第二个家族可以纠正有限数量的错误。我们还研究了在给定常数k之前校正长度的串联重复的代码,我们主要关注k = 2,3的情况。最后,我们提供了串联重复中允许的长度集的完整分类,从而为所有序列提供了唯一的根。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号