Advertisement

Transcript design problem of oritatami systems

  • Yo-Sub Han
  • Hwee KimEmail author
  • Shinnosuke Seki
Article
  • 8 Downloads

Abstract

RNA cotranscriptional folding refers to the phenomenon in which an RNA transcript folds upon itself while being synthesized out of a gene. Oritatami model is a computation model of this phenomenon, which lets its sequence (transcript) of beads (abstract molecules) fold cotranscriptionally by the interactions between beads according to its ruleset. We study the problem of designing a transcript that folds into the given conformation using the given ruleset, which is called the transcript design problem. We prove that the problem is computationally difficult to solve (NP-hard). Then we design efficient poly-time algorithms with additional restrictions on the oritatami system.

Keywords

Oritatami system Self-assembly RNA cotranscriptional folding Optimization 

Notes

Acknowledgements

Han is supported by the Basic Science Research Program through NRF (2018R1D1A1A09084107) and the International Cooperation Program managed by NRF of Korea (2017K2A9A2A08000270). Kim is partially supported by NIH R01GM109459, and by NSF’s CCF-1526485 and DMS-1800443. Kim is also partially supported by the Southeast Center for Mathematics and Biology, an NSF-Simons Research Center for Mathematics of Complex Biological Systems, under National Science Foundation Grant No. DMS-1764406 and Simons Foundation Grant No. 594594. Seki is supported in part by JST Program to Disseminate Tenure Tracking System, MEXT, Japan, No. 6F36, JSPS Grant-in-Aid for Young Scientists (A) No. 16H05854 and for Challenging Research (Exploratory) No. 18K19779, and JSPS-NRF Bilateral Program No. YB29004.

References

  1. Bonnet É, Rzażewski P, Sikora F (2018) Designing RNA secondary structures is hard. In: Proceedings of the 22nd annual international conference on research in computational molecular (RECOMB), pp 248–250Google Scholar
  2. Churkin A, Retwitzer MD, Reinharz V, Ponty Y, Waldispühl J, Barash D (2017) Design of RNAs: comparing programs for inverse RNA folding. Brief Bioinform 19(2):350–358Google Scholar
  3. Demaine ED, Hendricks J, Olsen M, Patitz MJ, Rogers TA, Schabanel N, Seki S, Thomas H (2018) Know when to fold ’em: self-assembly of shapes by folding in oritatami. In: Proceedings of the 24th international conference on dna computing and molecular programming (DNA), pp 19–36Google Scholar
  4. Garey MR, Johnson DS (1979) Computer and intractability: a guide to the theory of NP-completeness. W. H Freeman, New YorkzbMATHGoogle Scholar
  5. Geary C, Rothemund PWK, Andersen ES (2014) A single-stranded architecture for cotranscriptional folding of RNA nanostructures. Science 345:799–804CrossRefGoogle Scholar
  6. Geary CW, Meunier P, Schabanel N, Seki S (2016) Programming biomolecules that fold greedily during transcription. In: Proceedings of the 41st international symposium on mathematical foundations of computer science (MFCS), pp 43:1–43:14Google Scholar
  7. Geary CW, Meunier P, Schabanel N, Seki S (2018) Proving the turing universality of oritatami co-transcriptional folding. In: Proceedings of the 29th international symposium on algorithms and computation (ISAAC), pp 23:1–23:13Google Scholar
  8. Geary C, Meunier P, Schabanel N, Seki S (2019) Oritatami: a computational model for molecular co-transcriptional folding. Int J Mol Sci 20(9):2259CrossRefGoogle Scholar
  9. Hales J, Héliou A, Manuch J, Ponty Y, Stacho L (2017) Combinatorial RNA design: designability and structure-approximating algorithm in Watson–Crick and Nussinov–Jacobson energy models. Algorithmica 79(3):835–856MathSciNetCrossRefGoogle Scholar
  10. Han Y, Kim H (2017) Ruleset optimization on isomorphic oritatami systems. In: Proceedings of the 23rd international conference on DNA computing and molecular programming (DNA), pp 33–45Google Scholar
  11. Han Y, Kim H (2018) Construction of geometric structure by oritatami system. In: Proceedings of the 24th international conference on DNA computing and molecular programming (DNA), pp 173–188Google Scholar
  12. Han Y, Kim H, Rogers TA, Seki S (2017) Self-attraction removal from oritatami systems. In: Proceedings of the 19th international conference on descriptional complexity of formal systems (DCFS), pp 164–176CrossRefGoogle Scholar
  13. Han Y, Kim H, Ota M, Seki S (2018) Nondeterministic seedless oritatami systems and hardness of testing their equivalence. Nat Comput 17(1):67–79MathSciNetCrossRefGoogle Scholar
  14. Harel D, Sardas M (1998) An algorithm for straight-line drawing of planar graphs. Algorithmica 20(2):119–135MathSciNetCrossRefGoogle Scholar
  15. Hofacker IL, Fontana W, Stadler PF, Bonhoeffer LS, Tacker M, Schuster P (1994) Fast folding and comparison of rna secondary structures. Monatshefte für Chemie / Chemical Monthly 125(2):167–188CrossRefGoogle Scholar
  16. Ota M, Seki S (2017) Rule set design problems for oritatami system. Theor Comput Sci 671:16–35MathSciNetCrossRefGoogle Scholar
  17. Xayaphoummine A, Viasnoff V, Harlepp S, Isambert H (2007) Encoding folding paths of RNA switches. Nucleic Acids Res 35(2):614–622CrossRefGoogle Scholar

Copyright information

© Springer Nature B.V. 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceYonsei UniversitySeoulRepublic of Korea
  2. 2.Department of Mathematics and StatisticsUniversity of South FloridaTampaUSA
  3. 3.Department of Computer and Network EngineeringUniversity of Electro-CommunicationsChofuJapan

Personalised recommendations