Optimizing the Decoding Probability and Coverage Ratio of Composite DNA

Tomer Cohen, Eitan Yaakobi

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

Abstract

This paper studies two problems that are motivated by the novel recent approach of composite DNA that takes advantage of the DNA synthesis property which generates a huge number of copies for every synthesized strand. Under this paradigm, every composite symbols does not store a single nucleotide but a mixture of the four DNA nucleotides. In the first problem, our goal is study how to carefully choose a fixed number of mixtures of the DNA nucleotides such that the decoding probability by the maximum likelihood decoder is maximized. The second problem studies the expected number of strand reads in order to decode a composite strand or a group of composite strands.

Original languageAmerican English
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
Pages1949-1954
Number of pages6
ISBN (Electronic)9798350382846
DOIs
StatePublished - 1 Jan 2024
Event2024 IEEE International Symposium on Information Theory, ISIT 2024 - Athens, Greece
Duration: 7 Jul 202412 Jul 2024

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2024 IEEE International Symposium on Information Theory, ISIT 2024
Country/TerritoryGreece
CityAthens
Period7/07/2412/07/24

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Optimizing the Decoding Probability and Coverage Ratio of Composite DNA'. Together they form a unique fingerprint.

Cite this