doi abstract bibtex

Great advances in biotechnology have allowed the construction of a computer from DNA. One of the proposed solutions is a biomolecular finite automaton, a simple two-state DNA computer without memory, which was presented by Ehud Shapiro's group at the Weizmann Institute of Science. The main problem with this computer, in which biomolecules carry out logical operations, is its complexity - increasing the number of states of biomolecular automata. In this study, we constructed (in laboratory conditions) a six-state DNA computer that uses two endonucleases (e.g. AcuI and BbvI) and a ligase. We have presented a detailed experimental verification of its feasibility. We described the effect of the number of states, the length of input data, and the nondeterminism on the computing process. We also tested different automata (with three, four, and six states) running on various accepted input words of different lengths such as ab, aab, aaab, ababa, and of an unaccepted word ba. Moreover, this article presents the reaction optimization and the methods of eliminating certain biochemical problems occurring in the implementation of a biomolecular DNA automaton based on two endonucleases.

@article{sakowski_detailed_2017, title = {A detailed experimental study of a {DNA} computer with two endonucleases}, volume = {72}, issn = {0939-5075}, doi = {10.1515/znc-2016-0137}, abstract = {Great advances in biotechnology have allowed the construction of a computer from DNA. One of the proposed solutions is a biomolecular finite automaton, a simple two-state DNA computer without memory, which was presented by Ehud Shapiro's group at the Weizmann Institute of Science. The main problem with this computer, in which biomolecules carry out logical operations, is its complexity - increasing the number of states of biomolecular automata. In this study, we constructed (in laboratory conditions) a six-state DNA computer that uses two endonucleases (e.g. AcuI and BbvI) and a ligase. We have presented a detailed experimental verification of its feasibility. We described the effect of the number of states, the length of input data, and the nondeterminism on the computing process. We also tested different automata (with three, four, and six states) running on various accepted input words of different lengths such as ab, aab, aaab, ababa, and of an unaccepted word ba. Moreover, this article presents the reaction optimization and the methods of eliminating certain biochemical problems occurring in the implementation of a biomolecular DNA automaton based on two endonucleases.}, language = {eng}, number = {7-8}, journal = {Zeitschrift Fur Naturforschung. C, Journal of Biosciences}, author = {Sakowski, Sebastian and Krasiński, Tadeusz and Sarnik, Joanna and Blasiak, Janusz and Waldmajer, Jacek and Poplawski, Tomasz}, month = jul, year = {2017}, pmid = {28432850}, keywords = {Automation, Base Sequence, Computers, Molecular, DNA, DNA Ligases, DNA computing, Deoxyribonucleases, Type II Site-Specific, Endonucleases, Models, Theoretical, Oligonucleotides, biomolecular computers, finite automata}, pages = {303--313}, }

Downloads: 0