- Full text PDF available (10)
- This year (1)
- Last 5 years (10)
- Last 10 years (22)
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.
BACKGROUND A finite state machine manipulating information-carrying DNA strands can be used to perform autonomous molecular-scale computations at the cellular level. RESULTS We propose a new finite state machine able to detect and correct aberrant molecular phenotype given by mutated genetic transcripts. The aberrant mutations trigger a cascade reaction:… (More)
Recently, synchronization was proved for permutation parity machines, multilayer feed-forward neural networks proposed as a binary variant of the tree parity machines. This ability was already used in the case of tree parity machines to introduce a key-exchange protocol. In this paper, a protocol based on permutation parity machines is proposed and its… (More)