Abstract
The oritatami system (OS) is a model of computation by cotranscriptional folding, being inspired by the recent experimental success of RNA origami to self-assemble an RNA tile cotranscriptionally. The OSs implemented so far, including the binary counter and Turing machine simulator, are deterministic, that is, uniquely fold into one conformation, while nondeterminism is intrinsic in biomolecular folding. We introduce nondeterminism to the OS and propose a nondeterministic OS (NOS) that chooses an assignment of Boolean values nondeterministically and evaluates a logical formula on the assignment. This NOS is seedless in the sense that it does not require any initial conformation like the RNA origami. The NOS enables proving the coNP-hardness of deciding, given two NOSs, if there exists no conformation that one of them folds but the other does not.
| Original language | English |
|---|---|
| Pages (from-to) | 67-79 |
| Number of pages | 13 |
| Journal | Natural Computing |
| Volume | 17 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2018 Mar 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
Cite this
}
Nondeterministic seedless oritatami systems and hardness of testing their equivalence. / Han, Yo-Sub; Kim, Hwee; Ota, Makoto; Seki, Shinnosuke.
In: Natural Computing, Vol. 17, No. 1, 01.03.2018, p. 67-79.Research output: Contribution to journal › Article
TY - JOUR
T1 - Nondeterministic seedless oritatami systems and hardness of testing their equivalence
AU - Han, Yo-Sub
AU - Kim, Hwee
AU - Ota, Makoto
AU - Seki, Shinnosuke
PY - 2018/3/1
Y1 - 2018/3/1
N2 - The oritatami system (OS) is a model of computation by cotranscriptional folding, being inspired by the recent experimental success of RNA origami to self-assemble an RNA tile cotranscriptionally. The OSs implemented so far, including the binary counter and Turing machine simulator, are deterministic, that is, uniquely fold into one conformation, while nondeterminism is intrinsic in biomolecular folding. We introduce nondeterminism to the OS and propose a nondeterministic OS (NOS) that chooses an assignment of Boolean values nondeterministically and evaluates a logical formula on the assignment. This NOS is seedless in the sense that it does not require any initial conformation like the RNA origami. The NOS enables proving the coNP-hardness of deciding, given two NOSs, if there exists no conformation that one of them folds but the other does not.
AB - The oritatami system (OS) is a model of computation by cotranscriptional folding, being inspired by the recent experimental success of RNA origami to self-assemble an RNA tile cotranscriptionally. The OSs implemented so far, including the binary counter and Turing machine simulator, are deterministic, that is, uniquely fold into one conformation, while nondeterminism is intrinsic in biomolecular folding. We introduce nondeterminism to the OS and propose a nondeterministic OS (NOS) that chooses an assignment of Boolean values nondeterministically and evaluates a logical formula on the assignment. This NOS is seedless in the sense that it does not require any initial conformation like the RNA origami. The NOS enables proving the coNP-hardness of deciding, given two NOSs, if there exists no conformation that one of them folds but the other does not.
UR - http://www.scopus.com/inward/record.url?scp=85035774108&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85035774108&partnerID=8YFLogxK
U2 - 10.1007/s11047-017-9661-y
DO - 10.1007/s11047-017-9661-y
M3 - Article
AN - SCOPUS:85035774108
VL - 17
SP - 67
EP - 79
JO - Natural Computing
JF - Natural Computing
SN - 1567-7818
IS - 1
ER -