Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An introduction to tile-based self-assembly and a survey of recent results
MJ Patitz - Natural Computing, 2014 - Springer
We first give an introduction to the field of tile-based self-assembly, focusing primarily on
theoretical models and their algorithmic nature. We start with a description of Winfree's …
theoretical models and their algorithmic nature. We start with a description of Winfree's …
Intrinsic universality and the computational power of self-assembly
D Woods - … Transactions of the Royal Society A …, 2015 - royalsocietypublishing.org
Molecular self-assembly, the formation of large structures by small pieces of matter sticking
together according to simple local interactions, is a ubiquitous phenomenon. A challenging …
together according to simple local interactions, is a ubiquitous phenomenon. A challenging …
Theory of algorithmic self-assembly
D Doty - Communications of the ACM, 2012 - dl.acm.org
Theory of algorithmic self-assembly Page 1 78 communications of the acm | december 2012 |
vol. 55 | no. 12 review articles PHO T O g RAPH B Y ZUBEIR TAI seLF-asseMBLY is the process …
vol. 55 | no. 12 review articles PHO T O g RAPH B Y ZUBEIR TAI seLF-asseMBLY is the process …
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
We describe a computational model for studying the complexity of self-assembled structures
with active molecular components. Our model captures notions of growth and movement …
with active molecular components. Our model captures notions of growth and movement …
Intrinsic universality in tile self-assembly requires cooperation
We prove a negative result on the power of a model of algorithmic self-assembly for which
finding general techniques and results has been notoriously difficult. Specifically, we prove …
finding general techniques and results has been notoriously difficult. Specifically, we prove …
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
The field of algorithmic self-assembly is concerned with the computational and expressive
power of nanoscale self-assembling molecular systems. In the well-studied cooperative, or …
power of nanoscale self-assembling molecular systems. In the well-studied cooperative, or …
The two-handed tile assembly model is not intrinsically universal
Abstract The Two-Handed Tile Assembly Model (2HAM) is a model of algorithmic self-
assembly in which large structures, or assemblies of tiles, are grown by the binding of …
assembly in which large structures, or assemblies of tiles, are grown by the binding of …
Non-explosivity of stochastically modeled reaction networks that are complex balanced
We consider stochastically modeled reaction networks and prove that if a constant solution
to the Kolmogorov forward equation decays fast enough relatively to the transition rates …
to the Kolmogorov forward equation decays fast enough relatively to the transition rates …
Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly
In this paper we explore the power of geometry to overcome the limitations of non-
cooperative self-assembly. We define a generalization of the abstract Tile Assembly Model …
cooperative self-assembly. We define a generalization of the abstract Tile Assembly Model …
Oritatami: a computational model for molecular co-transcriptional folding
We introduce and study the computational power of Oritatami, a theoretical model that
explores greedy molecular folding, whereby a molecular strand begins to fold before its …
explores greedy molecular folding, whereby a molecular strand begins to fold before its …