The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
DNA models and algorithms for NP-complete problems
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
DNA'04 Proceedings of the 10th international conference on DNA computing
An autonomous DNA model for finite state automata
International Journal of Bioinformatics Research and Applications
Parallel bioinspired algorithms for NP complete graph problems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
The Hamiltonian path problem is one of the famous hard combinatorial problems. We provide the first molecular-scale autonomous solution of the decision Hamiltonian path problem. It is based on the formation of secondary structures of DNA molecules.