Constructions and Properties of Efficient DNA Synthesis Codes

Journal article (2024)

Authors

Kees A. Schouhamer Immink Turing Machines Inc.

Kui Cai Singapore University of Technology and Design

Tuan Thanh Nguyen Singapore University of Technology and Design

J.H. Weber Discrete Mathematics and Optimization -

Research Group

Discrete Mathematics and Optimization () (TU Delft)

Redundancy DNA Codes Encoding Symbols Biological information theory Information rates Code design DNA synthesis Guided scrambling Multiple strands Nibble replacement algorithm

To reference this document use:

http://resolver.tudelft.nl/uuid:c5f59275-de35-408e-9ee9-0b26f82fac7a

More Info

expand_more

Published Date

2024

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

Abstract

We report on coding methods for efficiently synthesizing deoxyribonucleic acid (DNA) for massive data storage, where a plurality of DNA strands are synthesized in parallel. We examine the trade-offs between the information contents, redundancy, and the average or maximum number of cycles required for synthesizing a plurality of parallel DNA strands. We analyze coding methods such as guided scrambling and constrained codes for minimizing the cycle count.

Files

Constructions_and_Properties_o... (pdf)

(pdf | 1.19 Mb)

File under embargo until 25-11-2024