Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-45711-9_23 | Formal and natural computing |
Keywords | Field | DocType |
self-assembly computation,pot computing,simpler molecular implementation technique,nondeterministic finite automaton pot,magic pot,self-assembly computation revisited,new molecular implementation method,experimental workmarks,hamiltonian path problem pot,experimental work,molecular computing,novel computing paradigm,molecular implementation method,molecular computing paradigm,nondeterministic finite automaton,hamiltonian path problem,self assembly | Graph,Nondeterministic finite automaton,Computer science,Theoretical computer science,Finite-state machine,Hamiltonian path problem,Distributed computing,Computation,Encoding (memory) | Conference |
ISBN | Citations | PageRank |
3-540-43190-X | 8 | 1.40 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Yokomori | 1 | 777 | 93.85 |
| Yasubumi Sakakibara | 2 | 769 | 62.91 |
| Satoshi Kobayashi | 3 | 137 | 15.51 |