Rule set design problems for oritatami systems
| Autor: | Shinnosuke Seki, Makoto Ota |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0301 basic medicine
chemistry.chemical_classification Dna template Theoretical computer science General Computer Science Computer science RNA 0102 computer and information sciences 01 natural sciences Theoretical Computer Science 03 medical and health sciences chemistry.chemical_compound 030104 developmental biology Enzyme chemistry 010201 computation theory & mathematics Transcription (biology) RNA polymerase Molecule Time complexity |
| Zdroj: | Theoretical Computer Science. 671:26-35 |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2016.09.010 |
| Popis: | A single-stranded RNA is transcribed from its DNA template by an RNA polymerase enzyme. The RNA transcript begins to fold upon itself while it is still being transcribed. This ubiquitous phenomenon is called cotranscriptional folding and was recently used as an engineering tool to self-assemble “RNA origami” tile by Geary, Rothemund, and Andersen (2014) [8] . The oritatami system (OS) is a new mathematical model of algorithmic self-assembly by cotranscriptional folding, proposed by Geary, Meunier, Schabanel, and Seki (2016). A problem of designing OSs is studied in this paper. We provide a sharp boundary between the NP-hardness and polynomial-time computability of this problem with respect to the relative speed of transcription to folding and valence of molecules. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect