Optimization of Highly Robust DNA Storage Schemes Based on Specific Base Sequences

DNA, a new type of storage medium, has the advantages of high storage density, long-term stability, and low energy consumption. However, traditional storage schemes usually focus on high-density storage, neglecting local stability and decoding robustness. In this paper, we propose a coding scheme based on specific base sequences, which first constructs 48 "0-1" mapping rules and specific base sequences, encodes the data into base sequences with specific patterns, aims to improve the error correction and error detection ability of the data, and combines it with multivariate Huffman rotational coding to encode rule-indexed sequences. For errors during synthesis and sequencing, a method of comparison with specific base sequences is used to detect the location of the error and to recover the data in combination with multiple sequencing. The simulation results show that the local GC content of the encoded DNA sequences is between 45% and 55%, avoiding the generation of long homopolymers. With an error rate of 20%, the data can be recovered nearly completely with only 5 sequencing passes, and more errors can be tolerated by increasing the length of specific base sequences and the number of sequencing passes. This scheme improves the robustness of storage at an average storage density of 1.33 bit/nt and provides a new approach for the reliable storage of large-scale DNA data.