Engineering bacteria to solve the Burnt Pancake Problem

被引:26
|
作者
Haynes K.A. [1 ]
Broderick M.L. [4 ]
Brown A.D. [3 ]
Butner T.L. [3 ]
Dickson J.O. [2 ]
Harden W.L. [2 ]
Heard L.H. [3 ,6 ]
Jessen E.L. [3 ]
Malloy K.J. [3 ]
Ogden B.J. [2 ]
Rosemond S. [1 ,5 ]
Simpson S. [1 ]
Zwack E. [1 ]
Campbell A.M. [1 ]
Eckdahl T.T. [3 ]
Heyer L.J. [2 ]
Poet J.L. [4 ]
机构
[1] Davidson College, Department of Biology, Davidson
[2] Davidson College, Department of Mathematics, Davidson
[3] Missouri Western State University, Department of Biology, St. Joseph
[4] Missouri Western State University, Department of Computer Science, Math and Physics, St. Joseph
[5] Hampton University, Biology Department, Hampton
[6] Central High School, St. Joseph
关键词
tetA; Tetracycline Resistance; Tetracycline Resistance Gene; Signed Permutation; pLac Promoter;
D O I
10.1186/1754-1611-2-8
中图分类号
学科分类号
摘要
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. © 2008 Haynes et al; licensee BioMed Central Ltd.
引用
收藏
相关论文
共 50 条
  • [21] Fault-tolerant routing in burnt pancake graphs
    Iwasaki, Tatsuya
    Kaneko, Keiichi
    INFORMATION PROCESSING LETTERS, 2010, 110 (14-15) : 535 - 538
  • [22] The generalized 4-connectivity of burnt pancake graphs
    Wang, Jing
    Wu, Jiang
    Ouyang, Zhangdong
    Huang, Yuanqiu
    DISCRETE APPLIED MATHEMATICS, 2025, 360 : 93 - 114
  • [23] Conditional Diagnosability of Burnt Pancake Networks Under the PMC Model
    Song, Sulin
    Zhou, Shuming
    Li, Xiaoyan
    COMPUTER JOURNAL, 2016, 59 (01): : 91 - 105
  • [24] Hamiltonian cycles and Hamiltonian paths in faulty burnt pancake graphs
    Kaneko, Keiichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (04): : 716 - 721
  • [25] The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
    Yang, Yi-Cheng
    Kao, Shih-Shun
    Klasing, Ralf
    Hsieh, Sun-Yuan
    Chou, Hsin-Hung
    Chang, Jou-Ming
    IEEE ACCESS, 2021, 9 (09): : 16679 - 16691
  • [26] Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs
    Iwasawa, Nagateru
    Watanabe, Tatsuro
    Iwasaki, Tatsuya
    Kaneko, Keiichi
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT 2, PROCEEDINGS, 2010, 6082 : 264 - 274
  • [27] Vulnerability analysis of multiprocessor system based on burnt pancake networks
    Liu, Jiafei
    Zhou, Shuming
    Zhang, Hong
    Chen, Gaolin
    DISCRETE APPLIED MATHEMATICS, 2022, 314 : 304 - 320
  • [28] Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract)
    Gupta, Sambhav
    Cheng, Eddie
    Liptak, Laszlo
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 425 - 435
  • [29] Multidisciplinary engineering to solve the congestion problem in vehicle systems
    Rojas-Ramirez, Jorge
    Trentesaux, Damien
    DYNA, 2018, 93 (05): : 471 - 471
  • [30] On the Complexity of the Pancake Problem
    Yu, Fuxiang
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 167 : 95 - 115