|
|
|
|||
| Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | | ||||
2002 Smart Mater. Struct. 11 756-760 doi: 10.1088/0964-1726/11/5/320
![]()
|
||||
Abstract. The goal of this research is to improve the modular stability and programmability of DNA-based computers and is a second step towards optical programmable DNA computing. The main focus here is on hydrodynamic stability. Clockable microreactors can be connected in various ways to solve combinatorial optimization problems, such as maximum clique or 3-SAT. This work demonstrates by construction how one microreactor design can be programmed to solve any instance of maximum clique up to its given maximum size (N). It reports on an implementation of the architecture proposed previously (McCaskill J S 2001 Biosystems 59 125–38). This contrasts with conventional DNA computing where the individual sequence of biochemical operations depends on the specific problem. In this pilot study we are tackling a graph for the maximum clique problem with N ≤ 12, with a special emphasis on N = 6. Furthermore, the design of the DNA solution space will be presented, which is symbolized by a set of bit-strings (words).
Print publication: Issue 5 (October 2002)| Post to CiteUlike | | Post to Connotea | | Post to Bibsonomy |
|
Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | Recommend this journal EndNote, ProCite ® and Reference Manager ® are registered trademarks of ISI Researchsoft. Copyright © Institute of Physics and IOP Publishing Limited 2009. Use of this service is subject to compliance with the terms and conditions of use. In particular, reselling and systematic downloading of files is prohibited. Help: Cookies | Data Protection. |