A DNA sequence reconstruction method and system for single insertion and single substitution channels

By calculating the upper bound of the intersection of error balls under a single insertion and single replacement channel, the reconstruction problem of multi-dimensional codes in DNA storage is solved, the information density is improved, and the long-term storage needs of massive data are met.

CN122201447APending Publication Date: 2026-06-12SHANDONG UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
SHANDONG UNIV
Filing Date
2026-03-16
Publication Date
2026-06-12

AI Technical Summary

⚠Technical Problem

Existing DNA storage technologies cannot effectively reconstruct multi-dimensional codes under a single insertion and single replacement channel, resulting in insufficient information density and failing to meet the long-term storage needs of massive amounts of data.

⚗Method used

A DNA sequence reconstruction method for single insertion and single substitution channels is proposed. By calculating the upper bound of the intersection of error balls of any two q-ary n-length sequences with a Hamming distance greater than 2 under the single insertion and single substitution channel, the original sequence can be recovered.

🎯Benefits of technology

The study of single-insertion single-replacement channels was extended to the q-ary case, which improved the information density, provided a theoretical reference for subsequent reconstruction algorithms, and reduced storage and transmission overhead.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122201447A_ABST
    Figure CN122201447A_ABST
Patent Text Reader

Abstract

This disclosure provides a method and system for DNA sequence reconstruction under a single insertion and single substitution channel, relating to the field of DNA storage and sequence reconstruction technology, including: acquiring DNA sequences under a single insertion and single substitution channel. q Metasequence; computation q The reconstruction threshold under a single insertion and single replacement channel for the original sequence; based on the reconstruction threshold, the minimum number of noisy sequences required is determined, and the original sequence is reconstructed; wherein, the calculation... q The reconstruction threshold under a single insertion and single replacement channel for a meta-sequence includes: for any two Hamming distances greater than 2. q Yuan n For long sequences, errors occurring in a single insertion and single substitution channel are considered as two separate stages: an exact insertion error followed by at most one substitution error. The algorithm first considers inserting one bit into each of these sequences to obtain sequence pairs, and then calculates the upper bound of the intersection of the error balls of the two sequences under the single insertion and single substitution channel. This disclosure improves the efficiency of recovering the original sequence.
Need to check novelty before this filing date? Find Prior Art