Design of geometric molecular bonds, à la Reed-Solomon

Slides:



Advertisements
Similar presentations
Lesson 2.6 Pre-Calc Part 2 When trying to ‘factor’ a quadratic into two binomials, we only ever concern ourselves with the factors of the ‘a’ --- leading.
Advertisements

The factor theorem The Factor Theorem states that if f(a) = 0 for a polynomial then (x- a) is a factor of the polynomial f(x). Example f(x) = x 2 + x -
Jong-Sun Yi 1. Molecular self-assembly Many top down processes create patterns serially and require extreme conditions. (vacuum, temperature, etc.) Bottom-up,
Sunmin Ahn Journal Club Presentation October 23, 2006
Using Our Tools to Find the Zeros of Polynomials
Chapter 4 – Polynomials and Rational Functions
May 29, 2008 GNFS polynomials Peter L. Montgomery Microsoft Research, USA 1 Abstract The Number Field Sieve is asymptotically the fastest known algorithm.
Fig. 3. AFM images of (A) 1D cross origami produced using the traditional 18- hour anneal, (B) 2D cross origami produced using the traditional 18-hour.
Introduction and Overview DNA origami is a self-assembling system, an ideal anchor for nano- electronic devices. The scaffold of the DNA is a single strand.
October,2006 Higher- Degree Polynomials Peter L. Montgomery Microsoft Research and CWI 1 Abstract The Number Field Sieve is asymptotically the fastest.
CHAPTER 8 Polynomial and Rational Functions. Ch 8 Polynomial Functions Linear functions f(x) = ax + b Quadratic functions f(x) = ax 2 + bx+ c Polynomial.
7.5.1 Zeros of Polynomial Functions
Lesson 2-6 Solving Polynomial Equations by Factoring – Part 2.
Section 4.3 Zeros of Polynomials. Approximate the Zeros.
Intermediate Algebra Clark/Anfinson. CHAPTER THREE Powers/polynomials.
Great Theoretical Ideas in Computer Science.
Section 4.4 Theorems about Zeros of Polynomial Functions Copyright ©2013, 2009, 2006, 2001 Pearson Education, Inc.
Section 4-3 The Remainder and Factor Theorems. Remainder Theorem Remainder Theorem – If a polynomial P(x) is divided by x-r, the remainder is a constant,
DNA nanotechnology: Geometric sorting boards
Fundamental Concepts of Algebra
Term 2 Week 7 Warm Ups. Warm Up 12/1/14 1.Identify all the real roots of the equation: 3x x 2 – 9x Identify whether the degree is odd or.
PreCalculus Section 2.6 Solve polynomial equations by factoring and the Rational Roots Theorem. Solve by factoring: x 3 + 5x 2 – 4x – 20 = 0 x 6 – x 3.
Real Zeros of Polynomial Functions
Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar Dr Nazir A. Zafar Advanced Algorithms Analysis and Design.
Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-5 Mathematical Background:
Chapter 11 Polynomial Functions
3.3 Dividing Polynomials.
Lecture 4 The Euclidean Algorithm
5 Solving Polynomial Equations.
Mathematical Background: Extension Fields
Relations, Functions, and Matrices
Splash Screen.
Polynomials & Factoring
College Algebra Chapter 3 Polynomial and Rational Functions
Great Theoretical Ideas in Computer Science
Polynomials and Polynomial Functions
Copyright © Cengage Learning. All rights reserved.
3.4 Zeros of Polynomial Functions
Polynomial + Fast Fourier Transform
Lesson 7.2: Finding Complex Solutions of Polynomial Equations
7.5 Zeros of Polynomial Functions
Dividing Polynomials Warm Up Lesson Presentation Lesson Quiz
Power and Polynomial Functions
Finding Zeros of Polynomials
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Splash Screen.
Dividing Polynomials 6-3 Warm Up Lesson Presentation Lesson Quiz
Paul Rothemund’s Scaffolded DNA Origami Method
Polynomials and the FFT(UNIT-3)
Splash Screen.
Great Theoretical Ideas in Computer Science
Fundamental Theorem of Algebra
Strict Self-Assembly of Discrete Sierpinski Triangles
The Square Root Property and Completing the Square
Splash Screen.
Self-Assembly of Any Shape with
Complexities for the Design of Self-Assembly Systems
AS-Level Maths: Core 2 for Edexcel
Cryptology Design Fundamentals
Figure 5 Forms of information for programming self-assembly
4.3 – The Remainder and Factor Theorems
Find (x3 + 2x2 – 5x – 6) ÷ (x – 2) using synthetic division.
Algorithms for Robust Self-Assembly
There is a pattern for factoring trinomials of this form, when c
Matho083 Bianco Warm Up Multiply: 1) (x2) (x3) 2) (3x2) (4x3)
Autonomously designed free-form 2D DNA origami
Mathematical Background: Extension Finite Fields
Presentation transcript:

Design of geometric molecular bonds, à la Reed-Solomon Workshop on coding techniques for synthetic biology University of Illinois, Urbana-Champaign David Doty Department of Computer Science University of California, Davis

Experimental background: Structural DNA nanotechnology a.k.a. DNA carpentry

DNA origami staple DNA strands folded DNA origami scaffold DNA strand Paul Rothemund Folding DNA to create nanoscale shapes and patterns Nature 2006 staple DNA strands folded DNA origami heat to 90C, cool to 20C over an hour scaffold DNA strand (M13mp18 bacteriophage virus) © http://openwetware.org/wiki/Biomod/2014/Design © Shawn Douglas

DNA origami 100 nm Paul Rothemund Folding DNA to create nanoscale shapes and patterns Nature 2006 Atomic force microscope images 100 nm

DNA stacking interactions between blunt ends nonspecific attractive interactions © http://openwetware.org/wiki/Biomod/2014/Kansai/Experiment

Stacking at edges of DNA origami … blunt ends scale bars: 100nm Sungwook Woo, Paul Rothemund Programmable molecular recognition based on the geometry of DNA nanostructures Nature Chemistry 2011

Programming specific macrobonds through geometric arrangement of nonspecific bonds (“patches”) staple left out to “deactivate” patch unintended translations can result in overlap between large subset of patches Sungwook Woo, Paul Rothemund Programmable molecular recognition based on the geometry of DNA nanostructures Nature Chemistry 2011

Extending from 1D to 2D bonds 3D DNA origamis stacking interactions 20nm negative stain TEM images Thomas Gerling, Klaus F. Wagenbauer, Andrea M. Neuner, Hendrik Dietz Dynamic DNA devices and assemblies formed by shape-complementary, non–base pairing 3D components Science 2015

Design of geometric molecular bonds, à la Reed-Solomon How to engineer large sets of specific molecular bonds that do not bind (strongly) in unintended ways

Mathematical model macrobond: subset of n x n square “patches” 1 2 3 4 1 2 3 4 5 6 7 8 9 10 “patches”

Desired outcomes any nonzero translation of macrobond has “small” overlap with untranslated original any translation of macrobond has “small” overlap with other macrobonds lots of macrobonds! macrobond 1 macrobond 2

Orthogonal macrobond design problem 1 2 3 4 5 6 7 8 9 10 n = 11 k = 8 d = 2 n = width of square k = # of patches in macrobond d = maximum overlap between macrobonds find macrobonds S1,…,Sm ⊆ n x n square such that: for all i: |Si| = k for all i and all translations v ≠ 0: |Si ∩ (Si+v)| ≤ d for all i ≠ j and all translations v: |Si ∩ (Sj+v)| ≤ d m is “large”

… à la Reed-Solomon d = 4 Fundamental theorem of algebra: any degree d polynomial p(x) = cdxd + cd-1xd-1 + … + c1x + c0 over field 𝔽 has at most d roots (values x where p(x) = 0) unless all ci = 0 Consequence: since the difference p(x)-q(x) of two different degree d polynomials is a degree d polynomial, p(x) = q(x) on at most d values of x If n is prime, addition and multiplication of integers modulo n defines a field 𝔽

Algorithm for generating macrobonds n = k = 11 d = 3 Works for k = n Let p(x) = cdxd + cd-1xd-1 + … + c1x + c0, each ci ∈ {0,1,…,n-1} cd ≠ 0 cd-1 = c0 = 0 Macrobond has patches at points (x,p(x)) for x ∈ {0,1,…,n-1} One macrobond for each possible choice of coefficients cd,…,c0: m = total number of macrobonds = (n-1)nd-2 ≈ nd-1 example macrobond: 1 2 3 4 5 6 7 8 9 10 x3 + 5x + 8 (mod 11) x

Why is overlap at most d? ≠ 0 = 0 ≠ 0 = 0 p(x) = adxd + ad-1xd-1 + … + a1x + a0 q(x) = bdxd + bd-1xd-1 + … + b1x + b0 Translate macrobond derived from p by vector v=(-δx,δy) (both < n): gives polynomial p’(x) = p(x + δx) + δy. If p’ ≠ q, then p’(x) = q(x) on at most d values of x, and we are done. Otherwise coefficients of p’ and q are the same: p’(x) = [ad(x + δx)d + ad-1(x + δx)d-1 + … a1(x + δx) + a0] + δy binomial theorem says xd-1 coefficient (i.e., bd-1) is ad-1 + dδxad But d,ad ≢ 0 mod n, so (dδxad ≡ 0 mod n) ⇒ (δx = 0) Also, binomial theorem says constant coefficient (i.e., b0) is adδxd + ad-1δxd-1 + … + a1δx1 + a0 + δy ≡ b0 mod n So δy ≡ 0 mod n, i.e., δy = 0 So p = q, i.e., if p ≠ q, then their translations are unequal also ≡ bd-1 mod n = 0 … = 0 = 0

Possible next steps Extend to macrobonds in n x n square (or n x n’ rectangle) that aren’t functions (i.e., exactly one y value per x value) Rotations may be moot with particular DNA origami examples Allow smooth transition from initial misaligned binding to intended alignment Lower bounds

Acknowledgements Andrew Winslow 2015 Arkansas self-assembly workshop