By Topic

DNA computing by competitive hybridization for maximum satisfiability problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Y. Takenaka ; Dept. of Informatics & Math. Sci., Osaka Univ., Japan ; A. Hashimoto

We propose a strategy using competitive hybridization for DNA computing. DNA computing is a means of solving intractable computation problems such as NP-complete problems. In our strategy, each spot on a DNA microarray represents the candidate solution. The calculation is executed by competitive hybridization of two groups of fluorescent DNA strands. One group represents a situation in which constraints of the problem are satisfied, and another group represents a situation in which constraints of the problems are not satisfied. After competitive hybridization of two groups, the spot with only the former type of fluorescent DNA strands hold "true" solution. We describe the approach to DNA computing by competitive hybridization through SAT problem. The SAT problem is an NP-complete problem in Boolean logic. We also show that our DNA computing can solve optimization problem through MAX-SAT problem. MAX-SAT problem is one of the derivative problems of SAT and it belongs to MAX-SNP-complete and APX-complete

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:1 )

Date of Conference:

12-17 May 2002