2018/12/14 by Kees A. Schouhamer Immink, Immink, Kees A. Schouhamer, Kui Cai +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced biosensing and bioanalysis techniques #Algorithms and Data Compression #DNA and Biological Computing #FOS: Computer and information sciences #FOS: Electrical engineering #Information Theory (cs.IT) #Signal Processing (eess.SP) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1812.06798
openalex publication_date 2018/12/14 · openalex created_date 2018/12/22 · openalex updated_date 2026/07/28
We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. We present algorithms for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. We show that the implementation of AT/GC-balanced codes is straightforward accomplished with binary balanced codes. We present codes that account for both the maximum repetition length and AT/GC balance. We compute the redundancy difference between the binary and a fully fledged quaternary approach.