کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4952177 | 1442018 | 2017 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Rule set design problems for oritatami systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Rule set design problems for oritatami systems Rule set design problems for oritatami systems](/preview/png/4952177.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 671, 6 April 2017, Pages 26-35
Journal: Theoretical Computer Science - Volume 671, 6 April 2017, Pages 26-35
نویسندگان
Makoto Ota, Shinnosuke Seki,