Transcript design problem of oritatami systems

DOI10.1007/s11047-019-09776-0zbMath1530.68095OpenAlexW2990941195WikidataQ126658800 ScholiaQ126658800MaRDI QIDQ6151174

Hwee Kim, Yo-Sub Han, Shinnosuke Seki

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-019-09776-0

zbMATH Keywords

optimizationself-assemblyoritatami systemRNA cotranscriptional folding

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Impossibility of strict assembly of infinite fractals by oritatami

Cites Work

• Rule set design problems for oritatami systems
• An algorithm for straight-line drawing of planar graphs
• Know when to fold 'em: self-assembly of shapes by folding in oritatami
• Construction of geometric structure by oritatami system
• Combinatorial RNA design: designability and structure-approximating algorithm in Watson-Crick and Nussinov-Jacobson energy models
• Self-attraction removal from oritatami systems
• Programming Biomolecules That Fold Greedily During Transcription
• Ruleset optimization on isomorphic oritatami systems
• Nondeterministic seedless oritatami systems and hardness of testing their equivalence
• Unnamed Item
• Unnamed Item

This page was built for publication: Transcript design problem of oritatami systems