6 citations · 20 across the 10 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2015
Proving the Turing Universality of Oritatami Co-Transcriptional Folding (Full Text)
Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel +1
We study the oritatami model for molecular co-transcriptional folding. In oritatami systems, the transcript (the "molecule") folds as it is synthesized (transcribed), according to…
cs.CG2015★ 3 cited
It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition
Florent Becker, Pierre-Étienne Meunier
We present a strict separation between the class of "mismatch free" self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently gr…
cs.CG2014
Noncooperative algorithms in self-assembly
Pierre-Étienne Meunier
We show the first non-trivial positive algorithmic results (i.e. programs whose output is larger than their size), in a model of self-assembly that has so far resisted many attempt…