On design principles for a molecular computer
Communications of the ACM
Parallel molecular computation
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
String Tile Models for DNA Computing by Self-Assembly
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Stepwise Generation of Hamiltonian Path with Molecules
Biocomputing and emergent computation: Proceedings of BCEC97
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
| Hi-index | 0.00 |
Molecular computing is a novel computing paradigm recently emerged from groundbreaking wet lab experiments by Adleman in 1994. His experimental workmarks a potential capability and feasibility of "one pot" computing with molecules for solving hard problems of practical size.This paper concerns a molecular computing paradigm based on "self-assembly" and "screening mechanism". After a brief getting back to and reviewing Adleman's original work, we propose a new molecular implementation method based on length-only encoding, which leads us to much simpler molecular implementation techniques to solve graph problems.With two examples, we demonstrate the effectiveness of the molecular implementation method for one pot computing based on self-assembly: one is Nondeterministic Finite Automaton Pot and the other Hamiltonian Path Problem Pot.