Constructions and Properties of Efficient DNA Synthesis Codes
Kees A. Immink (Turing Machines Inc.)
Kui Cai (Singapore University of Technology and Design)
Tuan Thanh Nguyen (Singapore University of Technology and Design)
J.H. Weber (TU Delft - Discrete Mathematics and Optimization)
More Info
expand_more
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.
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.