TY - JOUR
T1 - Simulating the Monty Hall problem in a DNA sequencing machine
AU - Mamet, Noam
AU - Harari, Gil
AU - Zamir, Adva
AU - Bachelet, Ido
N1 - Publisher Copyright:
© 2019 Elsevier Ltd
PY - 2019/12
Y1 - 2019/12
N2 - The Monty Hall problem is a decision problem with an answer that is surprisingly counter-intuitive yet provably correct. Here we simulate and prove this decision in a high-throughput DNA sequencing machine, using a simple encoding. All possible scenarios are represented by DNA oligonucleotides, and gameplay decisions are implemented by sequencing these oligonucleotides from specific positions, with a single run simulating more than 12,000,000 independent games. This work highlights high-throughput DNA sequencing as a new tool that could extend existing capabilities and enable new encoding schemes for problems in DNA computing.
AB - The Monty Hall problem is a decision problem with an answer that is surprisingly counter-intuitive yet provably correct. Here we simulate and prove this decision in a high-throughput DNA sequencing machine, using a simple encoding. All possible scenarios are represented by DNA oligonucleotides, and gameplay decisions are implemented by sequencing these oligonucleotides from specific positions, with a single run simulating more than 12,000,000 independent games. This work highlights high-throughput DNA sequencing as a new tool that could extend existing capabilities and enable new encoding schemes for problems in DNA computing.
KW - DNA computing
KW - Monty Hall Problem
KW - Next generation sequencing
UR - http://www.scopus.com/inward/record.url?scp=85072621166&partnerID=8YFLogxK
U2 - 10.1016/j.compbiolchem.2019.107122
DO - 10.1016/j.compbiolchem.2019.107122
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
C2 - 31563020
AN - SCOPUS:85072621166
SN - 1476-9271
VL - 83
JO - Computational Biology and Chemistry
JF - Computational Biology and Chemistry
M1 - 107122
ER -