• Corpus ID: 14425518

DNA Tweezers Based on Semantics of DNA Strand Graph

  title={DNA Tweezers Based on Semantics of DNA Strand Graph},
  author={Mandrita Mondal and Kumar Sankar Ray},
  journal={arXiv: Biomolecules},
Because of the limitations of classical silicon based computational technology, several alternatives to traditional method in form of unconventional computing have been proposed. In this paper we will focus on DNA computing which is showing the possibility of excellence for its massive parallelism, potential for information storage, speed and energy efficiency. In this paper we will describe how syllogistic reasoning by DNA tweezers can be presented by the semantics of process calculus and DNA… 

Figures and Tables from this paper



Theorem Proving Based on Semantics of DNA Strand Graph

This paper has shown how the theorem proving with resolution refutation by DNA computation can be represented by the semantics of process calculus and strand graph.

Logical Inference by DNA Strand Algebra

The present approach to logical inference based on DNA strand algebra is basically an attempt to develop expert system design in the domain of DNA computing.

A strand graph semantics for DNA-based computation

A programming language for composable DNA circuits

A programming language for designing and simulating DNA circuits in which strand displacement is the main computational mechanism and includes basic elements of sequence domains, toeholds and branch migration, and assumes that strands do not possess any secondary structure is presented.

Reasoning with disposition using DNA tweezers

In this paper, we consider dynamic DNA devices called DNA tweezers whose operation is based on the mechanism of DNA strand displacement. We show how the systematic use of this simple but robust

Abstractions for DNA circuit design

A programming language for designing DNA strand displacement devices is presented, which allows device designs to be programmed using a common syntax and then analysed at varying levels of detail, with or without interference, without needing to modify the program.

Similarity-based fuzzy reasoning by DNA computing

A wet lab algorithm is proposed for applicable form of fuzzy reasoning by DNA computing with an aim to add a new dimension to the existing similarity-based fuzzy reasoning method by bringing it down to nanoscale computing.

Programmable and autonomous computing machine made of biomolecules

A programmable finite automaton comprising DNA and DNA-manipulating enzymes that solves computational problems autonomously and has a transition fidelity greater than 99.8%.

Dynamic DNA nanotechnology using strand-displacement reactions.

Here, this work reviews DNA strand-displacement-based devices, and looks at how this relatively simple mechanism can lead to a surprising diversity of dynamic behaviour.