Reconstruction of Sequences Distorted by Two Insertions

2023/02/20 by Zuo Ye, Xin Liu, Ye, Zuo +5 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Advanced biosensing and bioanalysis techniques #Advanced Data Storage Technologies

paper · pdf · doi:10.48550/arxiv.2302.09798

Abstract

Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in 2001 and developed recently due to applications in modern storage devices such as racetrack memories and DNA storage. The central problem on this topic is to design codes with redundancy as small as possible for a given number N of noisy reads. In this paper, the minimum redundancy of such codes for binary channels with exactly two insertions is determined asymptotically for all values of N≥ 5. Previously, such codes were studied only for channels with single edit errors or two-deletion errors.

Cited by

• Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction

Related

• Coding for Sequence Reconstruction for Single Edits
• Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions
• Balanced reconstruction codes for single edits
• Optimal Reconstruction Codes for Deletion Channels
• Exact Reconstruction from Insertions in Synchronization Codes