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 条
  • [1] Container problem in burnt pancake graphs
    Sawada, N
    Suzuki, Y
    Kaneko, K
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, 2005, 3758 : 479 - 490
  • [2] Neighbor connectivity of pancake graphs and burnt pancake graphs
    Gu, Mei-Mei
    Chang, Jou-Ming
    DISCRETE APPLIED MATHEMATICS, 2023, 324 : 46 - 57
  • [3] Cycles in the burnt pancake graph
    Blanco, Saul A.
    Buehrle, Charles
    Patidar, Akshay
    DISCRETE APPLIED MATHEMATICS, 2019, 271 : 1 - 14
  • [4] An algorithm for node-to-set disjoint paths problem in burnt pancake graphs
    Kaneko, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2003, E86D (12): : 2588 - 2594
  • [5] Star structure connectivities of pancake graphs and burnt pancake graphs
    Dilixiati, Subinur
    Sabir, Eminjan
    Meng, Jixiang
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2021, 36 (05) : 440 - 448
  • [6] Neighbor-connectivity of pancake networks and burnt pancake networks
    Wang, Na
    Meng, Jixiang
    Tian, Yingzhi
    THEORETICAL COMPUTER SCIENCE, 2022, 916 : 31 - 39
  • [7] PAPER Feedback Node Sets in Pancake Graphs and Burnt Pancake
    Jung, Sinyu
    Kaneko, Keiichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2023, E106D (10) : 1677 - 1685
  • [8] An algorithm for node-to-node disjoint paths problem in burnt pancake graphs
    Kaneko, Keiichi
    Sawada, Naoki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (01) : 306 - 313
  • [9] The Spanning Connectivity of the Burnt Pancake Graphs
    Chin, Cherng
    Weng, Tien-Hsiung
    Hsu, Lih-Hsing
    Chiou, Shang-Chia
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (03) : 389 - 400
  • [10] Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs
    Cheng, Eddie
    Hu, Philip
    Jia, Roger
    Liptak, Laszlo
    Scholten, Brian
    Voss, James
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2014, 29 (05) : 499 - 512