Fast parallel molecular algorithms for DNA-based computation: factoring integers
The RSA public-key cryptosystem is an algorithm that converts input data to an
unrecognizable encryption and converts the unrecognizable data back into its original …
unrecognizable encryption and converts the unrecognizable data back into its original …
Research challenges and future work directions in DNA computing
S Minocha, S Namasudra - Advances in Computers, 2023 - Elsevier
Deoxyribonucleic Acid (DNA) computing is an emerging field that can be responsible for the
expansion of other promising technologies. The vital role of DNA computing is due to its high …
expansion of other promising technologies. The vital role of DNA computing is due to its high …
Parallel DNA arithmetic operation based on n-moduli set
X Zheng, J Xu, W Li - Applied Mathematics and Computation, 2009 - Elsevier
In most arithmetic systems the speed is limited by the nature of the building block which
makes logic decisions and by the extent to which decisions of low order numeric …
makes logic decisions and by the extent to which decisions of low order numeric …
[HTML][HTML] Security analysis of an audio data encryption scheme based on key chaining and DNA encoding
I El Hanouti, H El Fadili - Multimedia Tools and Applications, 2021 - Springer
Fairly recently, a new audio encryption scheme has been proposed. The cryptosystem is
based on a substitution-permutation algorithm using DNA encoding. The key-generation of …
based on a substitution-permutation algorithm using DNA encoding. The key-generation of …
[HTML][HTML] The principle of recursive genome function
AJ Pellionisz - The Cerebellum, 2008 - Springer
Responding to an open request, the principle of recursive genome function (PRGF) is put
forward, effectively reversing two axioms of genomics as we used to know it, prior to the …
forward, effectively reversing two axioms of genomics as we used to know it, prior to the …
An odd parity checker prototype using DNAzyme finite state machine
A Eshra, A El-Sayed - IEEE/ACM Transactions on …, 2013 - ieeexplore.ieee.org
A finite-state machine (FSM) is an abstract mathematical model of computation used to
design both computer programs and sequential logic circuits. Considered as an abstract …
design both computer programs and sequential logic circuits. Considered as an abstract …
Finite field arithmetic using self-assembly of dna tilings
Recently, it has been shown that the simple binary arithmetic and logical operations can be
computed by the process of self assembly of DNA tiles, where artificially constructed 2D …
computed by the process of self assembly of DNA tiles, where artificially constructed 2D …
Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem
M Ho - BioSystems, 2005 - Elsevier
In this paper our main purpose is to give molecular solutions for the subset-product problem.
In order to achieve this, we propose three DNA-based algorithms–parallel adder, parallel …
In order to achieve this, we propose three DNA-based algorithms–parallel adder, parallel …
[PDF][PDF] A DNA Sticker Algorithm for Solving N-Queen Problem.
H Ahrabian, A Mirzaei, A Nowzari-Dalini - Int. J. Comput. Sci. Appl., 2008 - academia.edu
Over the past few decades numerous attempts have been made to solve combinatorial
optimization problems that are NP-complete or NP-hard. It has been evidenced that DNA …
optimization problems that are NP-complete or NP-hard. It has been evidenced that DNA …
Exploring the feasibility of a DNA computer: Design of an ALU using sticker-based DNA model
Since its inception, DNA computing has advanced to offer an extremely powerful, energy-
efficient emerging technology for solving hard computational problems with its inherent …
efficient emerging technology for solving hard computational problems with its inherent …