Programming Biomolecules That Fold Greedily During Transcription

DOI10.4230/LIPICS.MFCS.2016.43zbMath1398.68161OpenAlexW2533314863MaRDI QIDQ4608605

Shinnosuke Seki, Pierre-Étienne Meunier, Nicolas Schabanel, Unnamed Author

Publication date: 21 March 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6456/pdf/LIPIcs-MFCS-2016-43.pdf/

zbMATH Keywords

self-assemblynatural computingmolecular folding

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (11)

Nondeterministic seedless oritatami systems and hardness of testing their equivalence ⋮ Impossibility of strict assembly of infinite fractals by oritatami ⋮ Unnamed Item ⋮ Rule set design problems for oritatami systems ⋮ Transcript design problem of oritatami systems ⋮ Unnamed Item ⋮ Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami ⋮ Ruleset optimization on isomorphic oritatami systems ⋮ Self-Attraction Removal from Oritatami Systems ⋮ A general architecture of oritatami systems for simulating arbitrary finite automata ⋮ Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence

This page was built for publication: Programming Biomolecules That Fold Greedily During Transcription