1. A DNA Algorithm for 3-SAT(11, 20)*
V. Manca, S. Di Grigorio, D. Lizzari, G. Vallini, C. Zandron
DNAC7
Summarized by In-hee, Lee

2. © 2001, SNU BioIntelligence Lab, http://bi.snu.ac.kr/
1. Introduction 1 2 3 4 6 7 8 9 10 11 13 14 15 16 17 18 19 20 21 22
SAT
Given a propositional formula, find if it can be satisfied for some values of its propositional variables.
3-SAT instance
© 2001, SNU BioIntelligence Lab,

3. 2. A Different Formulation of the Instance
Encode the given instance in terms of the problem of Bipartite Covering Problem (BCP)
BCP
Given a finite set C and n pairs of subsets of C: A1/B1, …, An/Bn such that AiBi =  for i=1, …, n, find n sets Y1, …, Yn such that C=Y1… Yn and either Yi=Ai of Yi=Bi
© 2001, SNU BioIntelligence Lab,

4. 2. A Different Formulation of the Instance
The BCP Instance
© 2001, SNU BioIntelligence Lab,

5. © 2001, SNU BioIntelligence Lab, http://bi.snu.ac.kr/
3. Encoding Clauses
DNA Dominoes
R.E.
© 2001, SNU BioIntelligence Lab,

6. © 2001, SNU BioIntelligence Lab, http://bi.snu.ac.kr/
4. DNA Algorithm
Preparation of dominoes
Ligation reaction
Search for solution
Restriction enzyme
© 2001, SNU BioIntelligence Lab,