Batch Optimization for DNA Synthesis

by   Konstantin Makarychev, et al.

Large pools of synthetic DNA molecules have been recently used to reliably store significant volumes of digital data. While DNA as a storage medium has enormous potential because of its high storage density, its practical use is currently severely limited because of the high cost and low throughput of available DNA synthesis technologies. We study the role of batch optimization in reducing the cost of large scale DNA synthesis, which translates to the following algorithmic task. Given a large pool 𝒮 of random quaternary strings of fixed length, partition 𝒮 into batches in a way that minimizes the sum of the lengths of the shortest common supersequences across batches. We introduce two ideas for batch optimization that both improve (in different ways) upon a naive baseline: (1) using both (ACGT)^* and its reverse (TGCA)^* as reference strands, and batching appropriately, and (2) batching via the quantiles of an appropriate ordering of the strands. We also prove asymptotically matching lower bounds on the cost of DNA synthesis, showing that one cannot improve upon these two ideas. Our results uncover a surprising separation between two cases that naturally arise in the context of DNA data storage: the asymptotic cost savings of batch optimization are significantly greater in the case where strings in 𝒮 do not contain repeats of the same character (homopolymers), as compared to the case where strings in 𝒮 are unconstrained.


page 1

page 2

page 3

page 4


Optimal Reference for DNA Synthesis

In the recent years, DNA has emerged as a potentially viable storage tec...

Deletion Correcting Codes for Efficient DNA Synthesis

The synthesis of DNA strands remains the most costly part of the DNA sto...

Can large language models democratize access to dual-use biotechnology?

Large language models (LLMs) such as those embedded in 'chatbots' are ac...

On Conflict Free DNA Codes

DNA storage has emerged as an important area of research. The reliabilit...

Efficiently Supporting Hierarchy and Data Updates in DNA Storage

We propose a novel and flexible DNA-storage architecture that provides t...

Managing Reliability Skew in DNA Storage

DNA is emerging as an increasingly attractive medium for data storage du...

Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise

A growing number of works have, in recent years, been concerned with in-...

Please sign up or login with your details

Forgot password? Click here to reset