Abstract
An oritatami system is a novel mathematical model of RNA cotranscriptional folding, which has recently proven extremely significant in information processing in organisms and also controllable artificially in a test tube to construct an artificial structure by folding an RNA sequence. This model has turned out to be Turing universal. One next step is to simplify the Turing universal oritatami system and another is to characterize weaker oritatami systems as we may not need Turing universality for applications. In this paper, we look at oritatami systems that folds a unary sequence, and show that under reasonable assumptions, these systems are not universal.
This work is supported in part by KAKENHI Grant-in-Aid for Challenging Research (Exploratory) No. 18K19779 granted to S. Z. F. and S. S. and JST Program to Disseminate Tenure Tracking System No. 6F36 granted to S. S.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)
Cook, M.: Universality in elementary cellular automata. Complex Syst. 15, 1–40 (2004)
Demaine, E., et al.: Know when to fold ’Em: self-assembly of shapes by folding in oritatami. In: Doty, D., Dietz, H. (eds.) DNA 2018. LNCS, vol. 11145, pp. 19–36. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00030-1_2
Elonen, A., et al.: Algorithmic design of 3D wireframes RNA polyhedral. DNA 24 poster (2018)
Geary, C.W., Andersen, E.S.: Design principles for single-stranded RNA origami structures. In: Murata, S., Kobayashi, S. (eds.) DNA 2014. LNCS, vol. 8727, pp. 1–19. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11295-4_1
Geary, C., Meunier, P.E., Schabanel, N., Seki, S.: Programming biomolecules that fold greedily during transcription. In: Proceedings of MFCS 2016, LIPIcs, vol. 58, pp. 43:1–43:14 (2016)
Geary, C., Meunier, P.E., Schabanel, N., Seki, S.: Proving the turing universality of oritatami cotranscriptional folding. In: Proceedings of ISAAC 2018 (2018, in press)
Geary, C., Rothemund, P.W.K., Andersen, E.S.: A single-stranded architecture for cotranscriptional folding of RNA nanostructures. Science 345(6198), 799–804 (2014)
Hales, T.C.: The Jordan curve theorem, formally and informally. Am. Math. Mon. 114(10), 882–894 (2007)
Han, D., et al.: Single-stranded DNA and RNA origami. Science 358(6369), 1402 (2017)
Pratchett, T.: Troll Bridge. Pan Books, London (1992)
Acknowledgements
We thank Yo-Sub Han for his valuable comments on the contents of this paper.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Fazekas, S.Z., Maruyama, K., Morita, R., Seki, S. (2019). On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence. In: Gopal, T., Watada, J. (eds) Theory and Applications of Models of Computation. TAMC 2019. Lecture Notes in Computer Science(), vol 11436. Springer, Cham. https://doi.org/10.1007/978-3-030-14812-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-14812-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14811-9
Online ISBN: 978-3-030-14812-6
eBook Packages: Computer ScienceComputer Science (R0)