| Paper ID | D4-S7-T2.3 |
| Paper Title |
Batch Optimization for DNA Synthesis |
| Authors |
Konstantin Makarychev, Northwestern University, United States; Miklos Z. Racz, Princeton University, United States; Cyrus Rashtchian, University of California, San Diego, United States; Sergey Yekhanin, Microsoft Research, United States |
| Session |
D4-S7-T2: Information Theory for Biology |
| Chaired Session: |
Friday, 16 July, 00:00 - 00:20 |
| Engagement Session: |
Friday, 16 July, 00:20 - 00:40 |
| Abstract |
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 $\mathcal S$ of random quaternary strings of fixed length, partition $\mathcal S$ 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 $\mathcal S$ do not contain repeats of the same character (homopolymers), as compared to the case where strings in $\mathcal S$ are unconstrained.
|
