Rule set design problems for oritatami systems
type: Item
instance of: scholarly article
title: Rule set design problems for oritatami systems
zbMATH Open document ID: 1370.68096
author: Makoto Ota
author: Shinnosuke Seki
published in: Theoretical Computer Science
publication date: 2017-05-18T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 6720004
zbMATH Keywords: co-transcriptional folding
zbMATH Keywords: oritatami system
zbMATH Keywords: algorithmic self-assembly
zbMATH Keywords: time complexity
zbMATH Keywords: linear-time 2SAT solver
describes a project that uses: ViennaRNA
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.09.010
OpenAlex ID: W2523042949
cites work: Control of Boolean networks: hardness results and algorithms for tree structured networks
cites work: Programming Biomolecules That Fold Greedily During Transcription
cites work: Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence
cites work: Q3577833
cites work: Q4714446
cites work: P-completeness of Cellular Automaton Rule 110
cites work: Q4198056
cites work: The complexity of satisfiability problems
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
DOI: 10.1016/J.TCS.2016.09.010
description: scientific article; zbMATH DE number 6720004