TY - GEN
T1 - Optimizing the Decoding Probability and Coverage Ratio of Composite DNA
AU - Cohen, Tomer
AU - Yaakobi, Eitan
N1 - Publisher Copyright: © 2024 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85197068546&partnerID=8YFLogxK
U2 - 10.1109/ISIT57864.2024.10619348
DO - 10.1109/ISIT57864.2024.10619348
M3 - Conference contribution
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1949
EP - 1954
BT - 2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
T2 - 2024 IEEE International Symposium on Information Theory, ISIT 2024
Y2 - 7 July 2024 through 12 July 2024
ER -