Studying the Cycle Complexity of DNA Synthesis

Amit Zrihan, Eitan Yaakobi, Zohar Yakhini

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2024 IEEE Information Theory Workshop, ITW 2024
Pages633-638
Number of pages6
ISBN (Electronic)9798350348934
DOIs
StatePublished - 2024
Event2024 IEEE Information Theory Workshop, ITW 2024 - Shenzhen, China
Duration: 24 Nov 202428 Nov 2024

Publication series

Name2024 IEEE Information Theory Workshop, ITW 2024

Conference

Conference2024 IEEE Information Theory Workshop, ITW 2024
Country/TerritoryChina
CityShenzhen
Period24/11/2428/11/24

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Signal Processing
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Studying the Cycle Complexity of DNA Synthesis'. Together they form a unique fingerprint.

Cite this