A separation method for DNA computing based on concentration control

New Generation Computing

Volumn 20, Issue 3, 2002, Pages 251-261

  Yamamoto, Masahito ^a   Kameda, Atsushi ^a   Matsuura, Nobuo ^b   Shiba, Toshikazu ^b   Kawazoe, Yumi ^b   Ohuchi, Azuma ^b  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

CDGE; Concentration control; DGGE; DNA computing; Shortest path problem

Indexed keywords

ALGORITHMS; BIOCHEMISTRY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONCENTRATION (PROCESS); DIFFERENTIAL EQUATIONS; DNA SEQUENCES; ELECTROPHORESIS; GRAPH THEORY; IMAGE ANALYSIS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; CONCENTRATION CONTROL; CONSTANT DENATURANT G EL ELECTROPHORESIS; DENATURING GRADIENT GEL ELECTROPHORESIS; DNA COMPUTING; SHORTEST PATH PROBLEM;

GENETIC ENGINEERING;

EID: 0036068731     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037359     Document Type: Article

References (7)

1. Molecular computation of solutions to combinatorial problems
2. DNA solution of hard computational problems
3. DNA solution of the maximal clique problem
4. Molecular computation by DNA hairpin formation
5. Solutions of shortest path problems by concentration control
6. In vitro selection for a OneMax DNA evolutionary computation
7. A study on the hybridization process in DNA computing