arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.07968cs.ITmath.IT
收藏

二维丝状数组在行约束下的高效合成

Efficient Synthesis for Two-Dimensional Strand Arrays with Row Constraints

Henry and Marilyn Taub Faculty of Computer Science, Technion - Israel Institute of Technology(海法理工学院亨利和玛丽林·陶布计算机学院);CalIT2, University of California, San Diego(加州大学圣地亚哥分校计算信息科学与技术中心)

Boaz Moav, Ryan Gabrys, Eitan Yaakobi

AI总结:

本文研究了在行约束下二维丝状数组的高效合成问题,提出了一种落后优先策略并给出了分析上界,同时展示了前瞻策略在二进制情况下的性能提升。

摘要:

我们研究了在空间约束下合成多个DNA链的理论问题,受大规模DNA合成技术的启发。在这种情况下,链被排列成数组,并根据固定的全局合成序列进行合成,限制为每个合成周期内每行最多只能合成一条链。我们专注于单行中两条链的基本情况,并在此行约束模型下分析预期完成时间。通过将过程分解为马尔可夫链,我们推导出合成时间的分析上界和下界。我们证明了一个简单的落后优先策略可以实现任意字母表大小q的渐近期望完成时间为(q+3)L/2,并且没有在线策略在没有前瞻的情况下无法超越这个界限。在二进制情况下,我们证明允许一个符号的前瞻可以严格提高性能,从而得到渐近期望完成时间为7L/3。最后,我们提出了一种动态规划算法,计算任何固定序列对的最优离线调度。这些结果为在空间约束下合成提供了首个分析界限,并为未来在这样的设置中研究最优合成策略奠定了基础。

英文摘要:

In large-scale array-based DNA synthesis, optical and chemical coupling between nearby sites can limit simultaneous activations. Motivated by this constraint, we study strands synthesized according to a fixed global synthesis sequence, with at most one strand per row advancing in each cycle. We focus on the fundamental case of two strands in a single row and analyze the expected completion time of row-constrained synthesis. We introduce the laggard-first (LF) policy, a simple rule that always advances the strand with fewer synthesized symbols when a conflict arises, and establish that it is asymptotically optimal among online policies without look-ahead. In the binary case, one-symbol look-ahead strictly improves on the no-look-ahead bound. We further show that even complete advance knowledge does not eliminate the scheduling loss, as even a globally optimal schedule incurs an unavoidable expected overhead that grows linearly with the strand length. Finally, we complement these scheduling results with a dynamic programming algorithm for computing an optimal offline synthesis order and a constant-redundancy binary coding scheme that yields a deterministic worst-case synthesis time guarantee.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑