Review on DNA Strand Algebra and its Application

TL;DR

This paper reviews DNA strand algebra and related formalisms, highlighting their role in modeling concurrent DNA processes and applications in reasoning, cryptography, and future research directions.

Contribution

It provides an overview of algebraic formalisms for DNA computing and demonstrates their application in reasoning, theorem proving, and cryptography.

Findings

DNA strand algebra models concurrent DNA processes.

Application of formal methods in DNA cryptography.

Potential for future research in DNA-based security protocols.

Abstract

Several technological limitations of traditional silicon based computing are leading towards the paradigm shift, from silicon to carbon, in computational world. Among the unconventional modes of computing evolved in past several decades, DNA computing has been considered to be quite promising in solving computational and reasoning problems by using DNA strands. Along with the sequential operations, the huge parallelism of DNA computing methodologies engaging numerous numbers of DNA strands induce the consideration of concurrent high-level formalisms. In this paper we have reviewed the algebraic explanation of concurrent DNA processes using DNA strand algebra, process calculus and DNA strand graph. We have demonstrated the application of syntax and semantics of the illustrated methodologies in the domains of reasoning and theorem proving with resolution refutation. Finally, we have presented DNA cryptography as one of the prominent areas for the future scope of research work where DNA strand algebra can be used as formal modelling tool to authenticate the security, logic and reasoning of the existing protocols.