scientific article; zbMATH DE number 7561377

DOI10.4230/LIPICS.ISAAC.2018.23MaRDI QIDQ5091013

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

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1508.00510

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

molecular computingTuring universalityco-transcriptional folding

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (8)

Counting infinitely by oritatami co-transcriptional folding ⋮ Impossibility of strict assembly of infinite fractals by oritatami ⋮ Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami ⋮ Freezing 1-Tag Systems with States ⋮ Counting Infinitely by Oritatami Co-transcriptional Folding ⋮ Transcript design problem of oritatami systems ⋮ Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami ⋮ A general architecture of oritatami systems for simulating arbitrary finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Binary pattern tile set synthesis is NP-hard
• Rule set design problems for oritatami systems
• Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
• Know when to fold 'em: self-assembly of shapes by folding in oritatami
• Programming Biomolecules That Fold Greedily During Transcription
• Ruleset optimization on isomorphic oritatami systems

This page was built for publication: