عنوان البحث | ملخص البحث | Research Abstract |
Finite state machines implementation using DNA Techniques | | A finite-state machine (FSM) is an abstract mathematical model of computation used to design both computer programs and sequential logic circuits |
Renewable DNA seesaw logic circuits enabled by photoregulation of toehold-mediated strand displacement | | An important achievement in the field of DNA-based computation has been the development of experimental protocols for evaluation of Boolean logic circuits |
An odd parity checker prototype using DNAzyme finite state machine | | A finite-state machine (FSM) is an abstract mathematical model of computation used to design both computer programs and sequential logic circuits |
Renewable DNA Hairpin-Based Logic Circuits | | Developing intelligent molecular systems for the desired functions is a significant current research topic in the field of nanoscience |
Improving the performance of DNA strand displacement circuits by shadow cancellation | | DNA strand displacement circuits are powerful tools that can be rationally engineered to implement molecular computing tasks because they are programmable |
Fast and compact DNA logic circuits based on single-stranded gates using strand-displacing polymerase | | DNA is a reliable biomolecule with which to build molecular computation systems. In particular, DNA logic circuits (diffusion-based) have shown good performance regarding scalability and correctness of computation |
A Reversible DNA Seesaw Motif with Hairpins | | |
Nucleic Acid Hairpins: A Robust and Powerful Motif for Molecular Devices | | |
Towards Reversible Localized DNA Hybridization Chain Reactions | | |