dorsal/arxiv
View SchemaEfficient Synthesis for Two-Dimensional Strand Arrays with Row Constraints
| Authors | Boaz Moav, Ryan Gabrys, Eitan Yaakobi |
|---|---|
| Categories | |
| ArXiv ID | 2601.07968vv1 |
| URL | https://arxiv.org/abs/2601.07968 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
We study the theoretical problem of synthesizing multiple DNA strands under spatial constraints, motivated by large-scale DNA synthesis technologies. In this setting, strands are arranged in an array and synthesized according to a fixed global synthesis sequence, with the restriction that at most one strand per row may be synthesized in any synthesis cycle. We focus on the basic case of two strands in a single row and analyze the expected completion time under this row-constrained model. By decomposing the process into a Markov chain, we derive analytical upper and lower bounds on the expected synthesis time. We show that a simple laggard-first policy achieves an asymptotic expected completion time of (q+3)L/2 for any alphabet of size q, and that no online policy without look-ahead can asymptotically outperform this bound. For the binary case, we show that allowing a single-symbol look-ahead strictly improves performance, yielding an asymptotic expected completion time of 7L/3. Finally, we present a dynamic programming algorithm that computes the optimal offline schedule for any fixed pair of sequences. Together, these results provide the first analytical bounds for synthesis under spatial constraints and lay the groundwork for future studies of optimal synthesis policies in such settings.
{
"annotation_id": "fc766d79-fb39-44d9-a85c-aaa35b8e5210",
"date_created": "2026-02-17T05:53:15.906000Z",
"date_modified": "2026-02-17T05:53:15.906000Z",
"file_hash": "33d69bbbfddfe4d346ec3529429581659e240bb9353b8d73f12ab0839d12dc8d",
"private": false,
"record": {
"abstract": "We study the theoretical problem of synthesizing multiple DNA strands under spatial constraints, motivated by large-scale DNA synthesis technologies. In this setting, strands are arranged in an array and synthesized according to a fixed global synthesis sequence, with the restriction that at most one strand per row may be synthesized in any synthesis cycle. We focus on the basic case of two strands in a single row and analyze the expected completion time under this row-constrained model. By decomposing the process into a Markov chain, we derive analytical upper and lower bounds on the expected synthesis time. We show that a simple laggard-first policy achieves an asymptotic expected completion time of (q+3)L/2 for any alphabet of size q, and that no online policy without look-ahead can asymptotically outperform this bound. For the binary case, we show that allowing a single-symbol look-ahead strictly improves performance, yielding an asymptotic expected completion time of 7L/3. Finally, we present a dynamic programming algorithm that computes the optimal offline schedule for any fixed pair of sequences. Together, these results provide the first analytical bounds for synthesis under spatial constraints and lay the groundwork for future studies of optimal synthesis policies in such settings.",
"arxiv_id": "2601.07968",
"authors": [
"Boaz Moav",
"Ryan Gabrys",
"Eitan Yaakobi"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Efficient Synthesis for Two-Dimensional Strand Arrays with Row Constraints",
"url": "https://arxiv.org/abs/2601.07968",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "07d796ca-565b-44c7-92c6-bfdda593f6d5",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}