Optimizing fountain codes for DNA data storage

被引:0
|
作者
Schwarz, Peter Michael [1 ]
Freisleben, Bernd [1 ]
机构
[1] Univ Marburg, Dept Math & Comp Sci, Hans Meerwein Str 6, D-35043 Marburg, Germany
关键词
DNA; DNA storage; Optimization; Fountain codes; SYNTHESIS TECHNOLOGIES; DIGITAL INFORMATION; CAPACITY; ROBUST;
D O I
10.1016/j.csbj.2024.10.038
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Fountain codes, originally developed for reliable multicasting in communication networks, are effectively applied in various data transmission and storage systems. Their recent use in DNA data storage systems has unique challenges, since the DNA storage channel deviates from the traditional Gaussian white noise erasure model considered in communication networks and has several restrictions as well as special properties. Thus, optimizing fountain codes to address these challenges promises to improve their overall usability in DNA data storage systems. In this article, we present several methods for optimizing fountain codes for DNA data storage. Apart from generally applicable optimizations for fountain codes, we propose optimization algorithms to create tailored distribution functions of fountain codes, which is novel in the context of DNA data storage. We evaluate the proposed methods in terms of various metrics related to the DNA storage channel. Our evaluation shows that optimizing fountain codes for DNA data storage can significantly enhance the reliability and capacity of DNA data storage systems. The developed methods represent a step forward in harnessing the full potential of fountain codes for DNA-based data storage applications. The new coding schemes and all developed methods are available under a free and open-source software license.
引用
收藏
页码:3878 / 3896
页数:19
相关论文
共 50 条
  • [1] Data recovery methods for DNA storage based on fountain codes
    Schwarz, Peter Michael
    Freisleben, Bernd
    COMPUTATIONAL AND STRUCTURAL BIOTECHNOLOGY JOURNAL, 2024, 23 : 1808 - 1823
  • [2] A Scheme of Data Storage Based on Fountain Codes
    Chen Haiyan
    ICCSE 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION, 2008, : 1128 - 1130
  • [3] Basis-Finding Algorithm for Decoding Fountain Codes for DNA-Based Data Storage
    He, Xuan
    Cai, Kui
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (06) : 3691 - 3707
  • [4] Cooperative sequence clustering and decoding for DNA storage system with fountain codes
    Jeong, Jaeho
    Park, Seong-Joon
    Kim, Jae-Won
    No, Jong-Seon
    Jeon, Ha Hyeon
    Lee, Jeong Wook
    No, Albert
    Kim, Sunghwan
    Park, Hosung
    BIOINFORMATICS, 2021, 37 (19) : 3136 - 3143
  • [5] Distributed fountain codes for networked storage
    Dimakis, Alexandros G.
    Prabhakaran, Vinod
    Ramchandran, Kannan
    2006 IEEE International Conference on Acoustics, Speech and Signal Processing, Vols 1-13, 2006, : 6007 - 6010
  • [6] Fountain codes for lossless data compression
    Caire, G
    Shamai, S
    Shokrollahi, A
    Verdú, S
    ALGEBRAIC CODING THEORY AND INFORMATION THEORY, 2005, 68 : 1 - 20
  • [7] Family of Constrained Codes for Archival DNA Data Storage
    Limbachiya, Dixita
    Gupta, Manish K.
    Aggarwal, Vancet
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (10) : 1972 - 1975
  • [8] Fountain codes
    MacKay, DJC
    IEE PROCEEDINGS-COMMUNICATIONS, 2005, 152 (06): : 1062 - 1068
  • [9] Repairable Fountain Codes with Unequal Locality for Heterogeneous D2D Data Storage Networks
    Li, Yue
    Gu, Shushi
    Wang, Ye
    Xiang, Wei
    Zhang, Qinyu
    WIRELESS AND SATELLITE SYSTEMS, PT I, 2019, 280 : 514 - 528
  • [10] Storing images and point clouds on DNA support with fountain codes
    Lazzarotto, Davi
    Ramos, Jorge Encinas
    Testolina, Michela
    Ebrahimi, Touradj
    APPLICATIONS OF DIGITAL IMAGE PROCESSING XLVII, 2024, 13137