A Proposal of DNA Computing on Beads with Application to SAT Problems
We propose a strategy using tiny beads for DNA computing. DNA computing is a means of solving intractable computation problems such as NP-complete problems. In our strategy, each bead carries multiple copies of a DNA sequence, and each sequence represents a candidate solution for a given problem. Calculation in our strategy is executed by competitive hybridization of two types of fluorescent sequences on the beads. One type of fluorescent sequences represents a constraint that has not been satisfied, and the other type a constraint that has been satisfied. After competitive hybridization, beads with only the latter type of fluorescent sequences hold “true” solutions. To extract the beads from the test tube, we use fluorescent-activated cell sorter.
We describe the approach to DNA computing on beads through SAT problems. The SAT problem is an NP-complete problem in Boolean logic. Using Megaclone, which allows DNA strands to be attached to beads, we show that DNA computing on beads can solve up to 24 variables.
KeywordsCell Sorter Boolean Logic Candidate Solution Fluorescent Sequence Competitive Hybridization
Unable to display preview. Download preview PDF.
- 3.Garey, R., Johnson, S.: Computers and Intractability, a guide to the theory of NP-completeness. Freeman and Company (1991)Google Scholar
- 12.Paun, G., Rozenberg, G., Salomaa, A.: DNA computing: new computing paradigms. Springer Verlag, (1998)Google Scholar
- 14.Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: combinatorial optimization problems and their approximability propoerties. Springer Verlag, (1999)Google Scholar
- 16.Yoshida, H., Suyama, A.: Solution to 3-SAT by breadth first search. Fifth International Meeting on DNA Based Computers, (1999) 9–20Google Scholar