Engineering bacteria to solve the Burnt Pancake Problem

نویسندگان

  • Karmella A Haynes
  • Marian L Broderick
  • Adam D Brown
  • Trevor L Butner
  • James O Dickson
  • W Lance Harden
  • Lane H Heard
  • Eric L Jessen
  • Kelly J Malloy
  • Brad J Ogden
  • Sabriya Rosemond
  • Samantha Simpson
  • Erin Zwack
  • A Malcolm Campbell
  • Todd T Eckdahl
  • Laurie J Heyer
  • Jeffrey L Poet
چکیده

BACKGROUND We investigated the possibility of executing DNA-based computation in living cells by engineering Escherichia coli to address a classic mathematical puzzle called the Burnt Pancake Problem (BPP). The BPP is solved by sorting a stack of distinct objects (pancakes) into proper order and orientation using the minimum number of manipulations. Each manipulation reverses the order and orientation of one or more adjacent objects in the stack. We have designed a system that uses site-specific DNA recombination to mediate inversions of genetic elements that represent pancakes within plasmid DNA. RESULTS Inversions (or "flips") of the DNA fragment pancakes are driven by the Salmonella typhimurium Hin/hix DNA recombinase system that we reconstituted as a collection of modular genetic elements for use in E. coli. Our system sorts DNA segments by inversions to produce different permutations of a promoter and a tetracycline resistance coding region; E. coli cells become antibiotic resistant when the segments are properly sorted. Hin recombinase can mediate all possible inversion operations on adjacent flippable DNA fragments. Mathematical modeling predicts that the system reaches equilibrium after very few flips, where equal numbers of permutations are randomly sorted and unsorted. Semiquantitative PCR analysis of in vivo flipping suggests that inversion products accumulate on a time scale of hours or days rather than minutes. CONCLUSION The Hin/hix system is a proof-of-concept demonstration of in vivo computation with the potential to be scaled up to accommodate larger and more challenging problems. Hin/hix may provide a flexible new tool for manipulating transgenic DNA in vivo.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing with living hardware

Our multi-institutional team of eleven undergraduates, one high school student, one postdoctoral fellow, and four faculty members explored the emerging field of synthetic biology and presented our results at the 2006 international Genetically Engineered Machine (iGEM) competition. Having had little or no previous research experience, biology, chemistry and mathematics students from four differe...

متن کامل

Burnt Pancake Problem: New Lower Bounds on the Diameter and New Experimental Optimality Ratios

For the burnt pancake problem, we provide new values of g(−IN ), new hard positions and new experimental optimality ratios.

متن کامل

Strong matching preclusion of burnt pancake graphs

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this talk, we examine the properties ...

متن کامل

Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs

A burnt pancake graph is a variant of Cayley graphs and its topology is suitable for massively parallel systems. However, for a burnt pancake graph, there is much room for further research. Hence, in this study, we focus on n-burnt pancake graphs and propose an algorithm to obtain n disjoint paths from a source node to n destination nodes in polynomial order time of n, n being the degree of the...

متن کامل

on the Problem of Sorting Burnt Pancakes

The “pancake problem” is a well-known open combinatorial problem that recently has been shown to have applications to parallel processing. Given a stack of n pancakes in arbitrary order, all of different sizes, the goal is to sort them into the size-ordered configuration having the largest pancake on the bottom and the smallest on top. The allowed sorting operation is a “spatula flip”, in which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Biological Engineering

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2008