Review on DNA Strand Algebra and its Application
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Automated Theorem ProvingSimilar Papers 제목 키워드 기반
StrandDesigner: Towards Practical Strand Generation with Sketch Guidance
Realistic hair strand generation is crucial for applications like computer graphics and virtual reality. While diffusion models can generate hairstyles from text or images, these inputs lack precision and user-friendline…
StrandHead: Text to Strand-Disentangled 3D Head Avatars Using Hair Geometric Priors
While haircut indicates distinct personality, existing avatar generation methods fail to model practical hair due to the general or entangled representation. We propose StrandHead, a novel text to 3D head avatar generati…
DiversityText to 3DMachine Learning Algebraic Geometry for Physics
We review some recent applications of machine learning to algebraic geometry and physics. Since problems in algebraic geometry can typically be reformulated as mappings between tensors, this makes them particularly amena…
BIG-bench Machine LearningGeomHair: Reconstruction of Hair Strands from Colorless 3D Scans
We propose a novel method that reconstructs hair strands directly from colorless 3D scans by leveraging multi-modal hair orientation extraction. Hair strand reconstruction is a fundamental problem in computer vision and …
Logical N-AND Gate on a Molecular Turing Machine
In Boolean algebra, it is known that the logical function that corresponds to the negation of the conjunction --NAND-- is universal in the sense that any other logical function can be built based on it. This property mak…
Negation