A DNA Algorithm for 3-SAT(11, 20)*

Slides:

Advertisements

Similar presentations

Artificial Intelligence Chapter 13 The Propositional Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.

Advertisements

“Using Weighted MAX-SAT Engines to Solve MPE” -- by James D. Park Shuo (Olivia) Yang.

Theory of Computing Lecture 18 MAS 714 Hartmut Klauck.

Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus.

Complexity 11-1 Complexity Andrei Bulatov NP-Completeness.

Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.

1 Boolean Satisfiability in Electronic Design Automation (EDA ) By Kunal P. Ganeshpure.

1 Polynomial Church-Turing thesis A decision problem can be solved in polynomial time in a reasonable sequential model of computation if and only if it.

Computability and Complexity 16-1 Computability and Complexity Andrei Bulatov NP-Completeness.

Computability and Complexity 24-1 Computability and Complexity Andrei Bulatov Approximation.

Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.

Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus.

GRASP: A Search Algorithm for Propositional Satisfiability EE878C Homework #2 2002/11/1 KAIST, EECS ICS Lab Lee, Dongsoo.

1 Joint work with Shmuel Safra. 2 Motivation 3 Motivation.

Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.3 Systems of Linear Equations In Two Variables.

Genomic walking (1) To start, you need: -the DNA sequence of a small region of the chromosome -An adaptor: a small piece of DNA, nucleotides long.

DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.

The Complexity of Optimization Problems. Summary -Complexity of algorithms and problems -Complexity classes: P and NP -Reducibility -Karp reducibility.

Section 4-1: Introduction to Linear Systems. To understand and solve linear systems.

INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.

Final Exam Review Final exam will have the similar format and requirements as Mid-term exam: Closed book, no computer, no smartphone Calculator is Ok Final.

Is DNA Computing Viable for 3-SAT Problems? Dafa Li Theoretical Computer Science, vol. 290, no. 3, pp , January Cho, Dong-Yeon.

EMIS 8373: Integer Programming NP-Complete Problems updated 21 April 2009.

What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.

1 How to prove that a problem is NPC. 2 Cook Cook showed the first NPC problem: SAT Cook received Turing Award in 1982.

NP-Complete Problems. Running Time v.s. Input Size Concern with problems whose complexity may be described by exponential functions. Tractable problems.

A Chinese Postman Problem Based on DNA Computing Z. Yin, F. Zhang, and J. Xu* J. Chem. Inf. Comput. Sci. 2002, 42, Summarized by Shin, Soo-Yong.

The Inference via DNA Computing Piort Wasiewicz et al. Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp Cho, Dong-Yeon.

Presented by Dajiang Zhu 11/1/2011.  Introduction of Markov chains Definition One example  Two problems as examples 2-SAT Algorithm (simply introduce.

6.4 Random Fields on Graphs 6.5 Random Fields Models In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok.

(C) 2004, SNU Biointelligence Lab, DNA Extraction by Cross Pairing PCR Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo.

Template preparation EE Slawson Tempel, © WUSTL. Template preparation EE Slawson Tempel, © WUSTL.

Computation by Self-assembly of DNA Graphs N. Jonoska, P. Sa-Ardyen, and N. Seeman Genetic Programming and Evolvable Machines, v.4, pp , 2003 Summarized.

Artificial Intelligence Chapter 11 Alternative Search Formulations and Applications.

Chapter 9. The PlayMate System （ 2/2 ） in Cognitive Systems Monographs. Rüdiger Dillmann et al. Course: Robots Learning from Humans Summarized by Nan Changjun.

Automatic Test Generation

Richard Anderson Lecture 26 NP-Completeness

NP-Completeness (2) NP-Completeness Graphs 7/23/ :02 PM x x x x

NP-Completeness Proofs

Richard Anderson Lecture 26 NP-Completeness

(xy)(yz)(xz)(zy)

A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants Z. Frank Qiu and Mi Lu Third Workshop on Bio-Inspired Solutions to Parallel Processing.

On Template Method for DNA Sequence Design

Chapter 9 Integer Programming

Horn Clause Computation with DNA Molecules

Biointelligence Lab School of Computer Sci. & Eng.

Fuzzy logic with biomolecules

Summarized by In-Hee Lee

Gene expression profiling diagnosis through DNA molecular computation

Biointelligence Lab School of Computer Sci. & Eng.

Subhayu Basu et al. , DNA8, (2002) MEC Seminar Su Dong Kim

Horn Clause Computation by Self-Assembly of DNA Molecules

Some Thoughts on Theorem Proving

NP-Complete Problems.

DNA-based Parallel Computation of Simple Arithmetic

Operation of a Purified DNA nanoactuator

Maximal Clique Problem with Experiment

Biointelligence Lab School of Computer Sci. & Eng.

PROPOSITIONAL LOGIC - SYNTAX-

Biointelligence Lab School of Computer Sci. & Eng.

CSE 6408 Advanced Algorithms.

Molecular Computation by DNA Hairpin Formation

Molecular Genetic Programming

Chap 7: Penalty functions (1/2)

Trevor Brown DC 2338, Office hour M3-4pm

Designs for Autonomous Unidirectional Walking DNA Devices

Universal Biochip Readout of Directed Hamiltonian Path Problems

Three Dimensional DNA Structures in Computing

Hamiltonian Circuit (HC) problem

Presentation transcript:

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

© 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, http://bi.snu.ac.kr/

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, http://bi.snu.ac.kr/

2. A Different Formulation of the Instance The BCP Instance © 2001, SNU BioIntelligence Lab, http://bi.snu.ac.kr/

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

© 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, http://bi.snu.ac.kr/