Self-attraction removal from oritatami systems

Yo Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

RNA cotranscriptional folding refers to the phenomenon in which an RNA transcript folds upon itself while being synthesized (transcribed). Oritatami is a computational model of this phenomenon, which lets its transcript, a sequence of beads (abstract molecules) fold cotranscriptionally via interactions between beads according to its ruleset. In this paper, we study the problem of removing self-attractions, which lets a bead interact with another bead of the same kind, from a given oritatami system without changing its behavior. We provide an algorithm for that with overhead linear in the delay parameter, which should be considerably smaller than the length of its transcript. We also show that this overhead is tight.

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings
EditorsGiovanni Pighizzini, Cezar Campeanu
PublisherSpringer Verlag
Pages164-176
Number of pages13
ISBN (Print)9783319602516
DOIs
Publication statusPublished - 2017 Jan 1
Event19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 - Milano, Italy
Duration: 2017 Jul 32017 Jul 5

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10316 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017
CountryItaly
CityMilano
Period17/7/317/7/5

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., Kim, H., Rogers, T. A., & Seki, S. (2017). Self-attraction removal from oritatami systems. In G. Pighizzini, & C. Campeanu (Eds.), Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings (pp. 164-176). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10316 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-60252-3_13