TY - GEN
T1 - Studying the Cycle Complexity of DNA Synthesis
AU - Zrihan, Amit
AU - Yaakobi, Eitan
AU - Yakhini, Zohar
N1 - Publisher Copyright: © 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Storing data in DNA is being explored as an efficient solution for archiving and in-object storage. Synthesis time and cost remain challenging, significantly limiting some applications at this stage. In this paper we investigate efficient synthesis, as it relates to cyclic synchronized synthesis technologies, such as photolithography. We define performance metrics related to the number of cycles needed for the synthesis of any fixed number of bits. We first expand on some results from the literature related to the channel capacity, addressing densities beyond those covered by prior work. This leads us to develop effective encoding achieving rate and capacity that are higher than previously reported. Finally, we analyze cost based on a parametric definition and determine some bounds and asymptotics. We investigate alphabet sizes that can be larger than 4, both for theoretical completeness and since practical approaches to such schemes were recently suggested and tested in the literature.
AB - Storing data in DNA is being explored as an efficient solution for archiving and in-object storage. Synthesis time and cost remain challenging, significantly limiting some applications at this stage. In this paper we investigate efficient synthesis, as it relates to cyclic synchronized synthesis technologies, such as photolithography. We define performance metrics related to the number of cycles needed for the synthesis of any fixed number of bits. We first expand on some results from the literature related to the channel capacity, addressing densities beyond those covered by prior work. This leads us to develop effective encoding achieving rate and capacity that are higher than previously reported. Finally, we analyze cost based on a parametric definition and determine some bounds and asymptotics. We investigate alphabet sizes that can be larger than 4, both for theoretical completeness and since practical approaches to such schemes were recently suggested and tested in the literature.
UR - http://www.scopus.com/inward/record.url?scp=85216576060&partnerID=8YFLogxK
U2 - 10.1109/ITW61385.2024.10807020
DO - 10.1109/ITW61385.2024.10807020
M3 - منشور من مؤتمر
T3 - 2024 IEEE Information Theory Workshop, ITW 2024
SP - 633
EP - 638
BT - 2024 IEEE Information Theory Workshop, ITW 2024
T2 - 2024 IEEE Information Theory Workshop, ITW 2024
Y2 - 24 November 2024 through 28 November 2024
ER -