Know When to Fold 'Em: Self-assembly of Shapes by Folding in Oritatami

被引:14
作者
Demaine, Erik D. [1 ]
Hendricks, Jacob [2 ]
Olsen, Meagan [3 ]
Patitz, Matthew J. [3 ]
Rogers, Trent A. [3 ]
Schabanel, Nicolas [4 ,5 ]
Seki, Shinnosuke [6 ]
Thomas, Hadley [7 ]
机构
[1] MIT, CSAIL, Cambridge, MA 02139 USA
[2] Univ Wisconsin, Dept Comp Sci & Informat Syst, River Falls, WI 54022 USA
[3] Univ Arkansas, Dept Comp Sci & Comp Engn, Fayetteville, AR 72701 USA
[4] Univ Lyon, CNRS, Ecole Normale Super Lyon, LIP,UMR 5668, Lyon, France
[5] Univ Lyon, IXXI, Lyon, France
[6] Univ Electrocommun, Tokyo, Japan
[7] Colorado Sch Mines, Golden, CO 80401 USA
来源
DNA COMPUTING AND MOLECULAR PROGRAMMING (DNA 2018) | 2018年 / 11145卷
关键词
RNA-POLYMERASE; TRANSCRIPTION;
D O I
10.1007/978-3-030-00030-1_2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An oritatami system (OS) is a theoretical model of self-assembly via co-transcriptional folding. It consists of a growing chain of beads which can form bonds with each other as they are transcribed. During the transcription process, the delta most recently produced beads dynamically fold so as to maximize the number of bonds formed, self-assemblying into a shape incrementally. The parameter delta is called the delay and is related to the transcription rate in nature. This article initiates the study of shape self-assembly using oritatami. A shape is a connected set of points in the triangular lattice. We first show that oritatami systems differ fundamentally from tile-assembly systems by exhibiting a family of infinite shapes that can be tile-assembled but cannot be folded by any OS. As it is NP-hard in general to determine whether there is an OS that folds into (self-assembles) a given finite shape, we explore the folding of upscaled versions of finite shapes. We show that any shape can be folded from a constant size seed, at any scale n >= 3, by an OS with delay 1. We also show that any shape can be folded at the smaller scale 2 by an OS with unbounded delay. This leads us to investigate the influence of delay and to prove that, for all delta > 2, there are shapes that can be folded (at scale 1) with delay delta but not with delay delta' < delta. These results serve as a foundation for the study of shape-building in this new model of self-assembly, and have the potential to provide better understanding of cotranscriptional folding in biology, as well as improved abilities of experimentalists to design artificial systems that self-assemble via this complex dynamical process.
引用
收藏
页码:19 / 36
页数:18
相关论文
共 26 条
[1]  
[Anonymous], 2016, P 28 ACM S PARALLELI, DOI [DOI 10.1145/2935764.2935784, 10.1145/2935764.2935784]
[2]  
[Anonymous], 2016, THESIS
[3]  
[Anonymous], ARXIV150800510V2
[4]   Not being (super)thin or solid is hard: A study of grid Hamiltonicity [J].
Arkin, Esther M. ;
Fekete, Sandor P. ;
Islam, Kamrul ;
Meijer, Henk ;
Mitchell, Joseph S. B. ;
Nunez-Rodriguez, Yurai ;
Polishchuk, Valentin ;
Rappaport, David ;
Xiao, Henry .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2009, 42 (6-7) :582-605
[5]   RNAII TRANSCRIBED BY IPTG-INDUCED T7 RNA-POLYMERASE IS NONFUNCTIONAL AS A REPLICATION PRIMER FOR COLE1-TYPE PLASMIDS IN ESCHERICHIA-COLI [J].
CHAO, MY ;
KAN, MC ;
LINCHAO, S .
NUCLEIC ACIDS RESEARCH, 1995, 23 (10) :1691-1695
[6]  
Demaine E.D., 2018, ARXIV180704682
[7]   Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) [J].
Demaine, Erik D. ;
Patitz, Matthew J. ;
Schweller, Robert T. ;
Summers, Scott M. .
28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 :201-212
[8]   Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues [J].
Erik D. Demaine ;
Martin L. Demaine ;
Sándor P. Fekete ;
Mashhood Ishaque ;
Eynat Rafalin ;
Robert T. Schweller ;
Diane L. Souvaine .
Natural Computing, 2008, 7 (3) :347-370
[9]  
Elliott D., 2016, Molecular biology of RNA
[10]  
Feynman R. P., 1996, Feynman Lectures on Computation