Rule set design problems for oritatami systems

DOI10.1016/J.TCS.2016.09.010zbMath1370.68096OpenAlexW2523042949MaRDI QIDQ529023

Shinnosuke Seki, Makoto Ota

Publication date: 18 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.010

zbMATH Keywords

time complexityalgorithmic self-assemblyco-transcriptional foldinglinear-time 2SAT solveroritatami system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Protein sequences, DNA sequences (92D20)

Related Items (4)

Counting infinitely by oritatami co-transcriptional folding ⋮ Transcript design problem of oritatami systems ⋮ Unnamed Item ⋮ Ruleset optimization on isomorphic oritatami systems

Uses Software

• ViennaRNA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Control of Boolean networks: hardness results and algorithms for tree structured networks
• Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence
• P-completeness of Cellular Automaton Rule 110
• Programming Biomolecules That Fold Greedily During Transcription
• The complexity of satisfiability problems

This page was built for publication: Rule set design problems for oritatami systems