Complexity of Graph Self-Assembly in Accretive Systems and Self-Destructible Systems Peng Yin Joint with John H. Reif and Sudheer Sahu 1 Department of.

Slides:

Advertisements

Similar presentations

COMPLEXITY THEORY CSci 5403 LECTURE XVI: COUNTING PROBLEMS AND RANDOMIZED REDUCTIONS.

Advertisements

1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY

The Theory of NP-Completeness

1 NP-Complete Problems. 2 We discuss some hard problems:  how hard? (computational complexity)  what makes them hard?  any solutions? Definitions 

Complexity 25-1 Complexity Andrei Bulatov #P-Completeness.

CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb Jerry Le

Complexity 11-1 Complexity Andrei Bulatov NP-Completeness.

Phase Transitions of PP-Complete Satisfiability Problems D. Bailey, V. Dalmau, Ph.G. Kolaitis Computer Science Department UC Santa Cruz.

February 23, 2015CS21 Lecture 201 CS21 Decidability and Tractability Lecture 20 February 23, 2015.

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

Topics in Biological Physics Design and self-assembly of two-dimensional DNA crystals Benny Gil 16/12/08 Fig3.a.

NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.

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

1 Polynomial Time Reductions Polynomial Computable function : For any computes in polynomial time.

NP-Complete Problems Problems in Computer Science are classified into

Computing the Banzhaf Power Index in Network Flow Games

1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 23 Instructor: Paul Beame.

Time Complexity.

1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 24 Instructor: Paul Beame.

Black-box (oracle) Feed me a weighted graph G and I will tell you the weight of the max-weight matching of G.

Ashish Goel Stanford University Joint work with Len Adleman, Holin Chen, Qi Cheng, Ming-Deh Huang, Pablo Moisset, Paul.

Theory of Computing Lecture 19 MAS 714 Hartmut Klauck.

Complexity Classes Kang Yu 1. NP NP : nondeterministic polynomial time NP-complete : 1.In NP (can be verified in polynomial time) 2.Every problem in NP.

The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.

The Theory of NP-Completeness 1. What is NP-completeness? Consider the circuit satisfiability problem Difficult to answer the decision problem in polynomial.

Machines with Memory Chapter 3 (Part B). Turing Machines  Introduced by Alan Turing in 1936 in his famous paper “On Computable Numbers with an Application.

Applications of types of SATs Arash Ahadi What is SAT?

1 The Theory of NP-Completeness 2012/11/6 P: the class of problems which can be solved by a deterministic polynomial algorithm. NP : the class of decision.

Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.

DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.

The minimum reload s-t path/trail/walk problems Current Trends in Theory and Practice of Comp. Science, SOFSEM09 L. Gourvès, A. Lyra, C. Martinhon, J.

The minimum reload s-t path/trail/walk problems Current Trends in Theory and Practice of Comp. Science, SOFSEM09 L. Gourvès, A. Lyra, C. Martinhon, J.

INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.

Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.

Complexity 25-1 Complexity Andrei Bulatov Counting Problems.

May 9, New Topic The complexity of counting.

Techniques for Proving NP-Completeness Show that a special case of the problem you are interested in is NP- complete. For example: The problem of finding.

CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.

1 The Theory of NP-Completeness 2 Cook ’ s Theorem (1971) Prof. Cook Toronto U. Receiving Turing Award (1982) Discussing difficult problems: worst case.

CS151 Complexity Theory Lecture 12 May 6, QSAT is PSPACE-complete Theorem: QSAT is PSPACE-complete. Proof: 8 x 1 9 x 2 8 x 3 … Qx n φ(x 1, x 2,

The Game of Cubic is NP-complete Erich Friedman Stetson University.

Lecture 6 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.

CPS Computational problems, algorithms, runtime, hardness (a ridiculously brief introduction to theoretical computer science) Vincent Conitzer.

CS 3813: Introduction to Formal Languages and Automata Chapter 14 An Introduction to Computational Complexity These class notes are based on material from.

Lecture 25 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.

1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.

CSC 413/513: Intro to Algorithms

Liaoruo Wang and John E. Hopcroft Dept. of Computer Engineering & Computer Science, Cornell University In Proc. 7th Annual Conference on Theory and Applications.

The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.

Given this 3-SAT problem: (x1 or x2 or x3) AND (¬x1 or ¬x2 or ¬x2) AND (¬x3 or ¬x1 or x2) 1. Draw the graph that you would use if you want to solve this.

Complexity 24-1 Complexity Andrei Bulatov Counting Problems.

34.NP Completeness. Computer Theory Lab. Chapter 34P.2.

 2005 SDU Lecture15 P,NP,NP-complete.  2005 SDU 2 The PATH problem PATH = { | G is a directed graph that has a directed path from s to t} s t

Construction We constructed the following graph: This graph has several nice properties: Diameter Two Graph Pebbling Tim Lewis 1, Dan Simpson 1, Sam Taggart.

ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.

More NP-Complete and NP-hard Problems

More NP-complete Problems

Great Ideas in Computing Complexity Theory

ICS 353: Design and Analysis of Algorithms

More NP-complete Problems

Compact Error Resilient Computational DNA Tiling Assemblies

John H. Reif and Sudheer Sahu

Complexities for the Design of Self-Assembly Systems

CS21 Decidability and Tractability

Sudheer Sahu John H. Reif Duke University

Umans Complexity Theory Lectures

Complexity Theory in Practice

Lecture 24 Classical NP-hard Problems

Presentation transcript:

Complexity of Graph Self-Assembly in Accretive Systems and Self-Destructible Systems Peng Yin Joint with John H. Reif and Sudheer Sahu 1 Department of Computer Science, Duke University DNA11, June 7 th, 2005

Motivation: Self-Assembly 2 Self-Assembly: Small objects autonomously associate into larger complex Scientific importance: Ubiquitous phenomena in nature Crystal saltEukaryotic cell Engineering significance: Powerful nano-scale & meso-scale construction methods Autonomous DNA walker (Yin et al 04) Algorithmic DNA lattice (Rothemund et al 04)

Motivation: Complexity Theoretical Study of Self-Assembly 3 How complex?

Complexity 101 4PSorting NP Hamiltonian Path #P Counting Hamiltonian Path Complexity Hierarchy NP-Complete #P-Complete PSPACE- Complete PSPACEPlayingGO …… 3 < 6 < 10 < 11 < 25 11, 3, 10, 25, 6 Sorting Hamiltonian Path ? How many H Paths? Who wins?

Motivation: Complexity Theoretical Study of Self-Assembly 5 Complexity HierarchyNP P NP-Complete #P PSPACE #P-Complete PSPACE- Complete …………………… ? Self-Assembly Model, Problems Formalize

Roadmap 6 AGAP-PAGAP-#AGAP-DGAPNP P NP-Complete #P PSPACE #P-Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem Self-Destructible Graph Assembly Problem AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete

Roadmap 7 AGAP-PAGAP-#AGAP-DGAPNP P NP-Complete #P PSPACE #P-Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem Self-Destructible Graph Assembly Problem AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete

Accretive Graph Assembly System 8 Graph Weight function Temperature Temperature: τ = 2 Seed vertex Seed vertex Sequentially constructible? AGAP- AGAP-PAGAP-#AGAP-DGAP

Example: An assembly ordering 9 Temperature =2 AGAP- AGAP-PAGAP-#AGAP-DGAP Assembly Ordering Seed vertex

Example 10 Temperature = 2 Stuck! AGAP- AGAP-PAGAP-#AGAP-DGAP

Accretive Graph Assembly Problem 11 Graph Seed vertex Weight function Temperature Temperature: τ = 2 Seed vertex Accretive Graph Assembly Problem: Given an accretive graph assembly system, determine whether there exists an assembly ordering to sequentially assemble the given target graph. AGAP- AGAP-PAGAP-#AGAP-DGAP

Roadmap 12 AGAP-PAGAP-#AGAP-DGAPNP P NP-Complete #P PSPACE #P-Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem Self-Destructible Graph Assembly Problem AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete Hamiltonian Path ?

AGAP is NP-complete 13 AGAP is in NP Literal v. Top v. Bottom v. AGAP is NP-hard, using reduction from 3SAT Restricted 3SAT: each variable appears ≤ 3, literal ≤ 2 AGAP- AGAP-PAGAP-#AGAP-DGAP

AGAP is NP-complete 14 AGAP is in NP AGAP is NP-hard, using reduction from 3SAT Restricted 3SAT: each variable appears < 3, literal < 2 Seed vertex Literal v. Top v. Bottom v. Temperature = 2 AGAP- AGAP-PAGAP-#AGAP-DGAP

AGAP is NP-complete 15 Proposition: φ is satisfiable ⇔ exists an assembly ordering Temperature = 2 AGAP- AGAP-PAGAP-#AGAP-DGAP Seed vertex

AGAP is NP-complete 16 Seed vertex T T T F F T T F T φ is satisfiable ⇒ exists an assembly ordering Stage 1 Stage 2 Stage 3 Stage 4 Temperature = 2 AGAP- AGAP-PAGAP-#AGAP-DGAP

AGAP is NP-complete 17 φ is satisfiable ⇐ exists an assembly ordering Seed vertex F F F 2 Total support ≤-1+2=1< 2 = temperature! Exists at least one TRUE literal in each clause; proof by contradiction Temperature = 2 AGAP- AGAP-PAGAP-#AGAP-DGAP

AGAP is NP-complete 18 Theorem: AGAP is NP-complete Seed vertex Temperature = 2 AGAP- AGAP-PAGAP-#AGAP-DGAP

Roadmap 19 AGAP-PAGAP-#AGAP-DGAPNP P NP-Complete #P PSPACE #P-Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem Self-Destructible Graph Assembly Problem AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete Hamiltonian Path ?

Planar-AGAP 20 Planar AGAP is NP-complete;reduction from Planar-3SAT -PAGAP AGAP-PAGAP-#AGAP-DGAP Seed vertex Planar-3SAT Reduction gadget

Roadmap 21 AGAP-PAGAP-#AGAP-DGAPNP P NP-Complete #P PSPACE #P-Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem Self-Destructible Graph Assembly Problem AGAP is NP-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete How many H Paths?

#AGAP is #P-complete 22 -#AGAP AGAP-PAGAP-#AGAP-DGAP Parsimonious reduction from PERMANENT, i.e., counting number of perfect matchings in a bipartite graph PERMANENT Reduction gadget

Roadmap 23 AGAP-PAGAP-#AGAP-DGAPNP P NP-Complete #P PSPACE #P-Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete Self-Destructible Graph Assembly Problem a b c temperature =

Self-Destructible System 24 Nature: e.g. programmed cell death Programmed cell death (NASA) Scaffold Tower Engineering: e.g. remove scaffolds -DGAP AGAP-PAGAP-#AGAP-DGAP

Self-Destructible Graph Assembly System 25 Temperature Slot Graph Slot Graph Vertex set Vertex set Association rule Association rule: M ⊆ S X V Seed Self-Destructible Graph Assembly Problem: Given a self-destructible graph assembly system, determine whether there exists a sequence of assembly operations to sequentially assemble a target graph. Weight func. Weight func: V(s a ) X V(s b ) → Z, (s a, s b ) ∈ E -DGAP AGAP-PAGAP-#AGAP-DGAP

Roadmap 26 AGAP-PAGAP-#AGAP-DGAPNP P NP-Complete #P PSPACE #P-Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem Self-Destructible Graph Assembly Problem AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete Playing GO

DGAP is PSPACE complete 27 DGAP is PSPACE-complete Reduction from IN-PLACE ACCEPTANCE Proof Scheme -DGAP AGAP-PAGAP-#AGAP-DGAP Classical tiling TM simulation (Rothemund & Winfree 00) Integration Our cyclic gadget

Conclusion 28 AGAP-PAGAP-#AGAP-DGAPNP P NP- Complete #P PSPACE #P- Complete Complexity Hierarchy PSPACE- Complete …………………… Accretive Graph Assembly Problem Self-Destructible Graph Assembly Problem AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPCAE-complete Planar AGAP is NP-complete Related work Self-assembly of DNA graphs (Jonoska et al 99) Future “Towards a mathematical theory of self-assembly” (Adleman99) Summary Genaral graph Genaral graph Repulsion Repulsion Self-destructible Self-destructibleFeatures Self-assembly using graph grammars (Klavins et al 04) Tiling scheme (Wang61, Rothemund & Winfree00)