Simulating the Monty Hall problem in a DNA sequencing machine |
| |
| Institution: | 1. Clinic of Surgical Oncology, Oncology Institute of Vojvodina, Sremska Kamenica, Serbia;2. University of Novi Sad - Faculty of Medicine, Novi Sad, Serbia;3. Uniformed Services University of the Health Sciences, Bethesda, MD;4. Sheba General Hospital, The Chaim Sheba Medical Center, Tel-Hashomer, Israel;5. University of California, Los Angeles, Los Angeles, CA;6. Madigan Army Medical Center, Tacoma, WA;7. University Hospitals, Case Western Reserve University, Cleveland, OH;8. John Wayne Cancer Institute at Providence Saint John''s Health Center, Santa Monica, CA;9. California Oncology Research Institute, Santa Monica, CA;1. Bioinformatics Group, National Institute of Virology, Pune, Maharashtra, India;2. WHO Accredited National Measles Reference Laboratory, National Institute of Virology, Pune, India |
| |
| Abstract: | 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. |
| |
| Keywords: | DNA computing Next generation sequencing Monty Hall Problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
