{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:15:38Z","timestamp":1743052538458,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030000295"},{"type":"electronic","value":"9783030000301"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00030-1_9","type":"book-chapter","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T19:44:00Z","timestamp":1536263040000},"page":"139-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Transcript Design Problem of Oritatami Systems"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hwee","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,7]]},"reference":[{"key":"9_CR1","unstructured":"Bonnet, \u00c9., Rzazewski, P., Sikora, F.: Designing RNA secondary structures is hard. In: Research in Computational Molecular Biology - 22nd Annual International Conference, RECOMB 2018 (2018, accepted)"},{"key":"9_CR2","first-page":"350","volume":"19","author":"A Churkin","year":"2017","unstructured":"Churkin, A., Retwitzer, M.D., Reinharz, V., Ponty, Y., Waldisp\u00fchl, J., Barash, D.: Design of RNAs: comparing programs for inverse RNA folding. Brief. Bioinform. 19, 350\u2013358 (2017)","journal-title":"Brief. Bioinform."},{"key":"9_CR3","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"9_CR4","unstructured":"Geary, C., Meunier, P., Schabanel, N., Seki, S.: Efficient universal computation by greedy molecular folding. CoRR, abs\/1508.00510 (2015)"},{"key":"9_CR5","unstructured":"Geary, C., Meunier, P., Schabanel, N., Seki, S.: Programming biomolecules that fold greedily during transcription. In: Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, pp. 43:1\u201343:14 (2016)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1126\/science.1253920","volume":"345","author":"C Geary","year":"2014","unstructured":"Geary, C., Rothemund, P.W.K., Andersen, E.S.: A single-stranded architecture for cotranscriptional folding of RNA nanostructures. Science 345, 799\u2013804 (2014)","journal-title":"Science"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s00453-016-0196-x","volume":"79","author":"J Hales","year":"2017","unstructured":"Hales, J., H\u00e9liou, A., Manuch, J., Ponty, Y., Stacho, L.: Combinatorial RNA design: designability and structure-approximating algorithm in Watson-Crick and Nussinov-Jacobson energy models. Algorithmica 79(3), 835\u2013856 (2017)","journal-title":"Algorithmica"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-66799-7_3","volume-title":"DNA Computing and Molecular Programming","author":"Y-S Han","year":"2017","unstructured":"Han, Y.-S., Kim, H.: Ruleset optimization on isomorphic oritatami systems. In: Brijder, R., Qian, L. (eds.) DNA 2017. LNCS, vol. 10467, pp. 33\u201345. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66799-7_3"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11047-017-9661-y","volume":"17","author":"Y Han","year":"2018","unstructured":"Han, Y., Kim, H., Ota, M., Seki, S.: Nondeterministic seedless oritatami systems and hardness of testing their equivalence. Nat. Comput. 17(1), 67\u201379 (2018)","journal-title":"Nat. Comput."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-60252-3_13","volume-title":"Descriptional Complexity of Formal Systems","author":"Y-S Han","year":"2017","unstructured":"Han, Y.-S., Kim, H., Rogers, T.A., Seki, S.: Self-attraction removal from oritatami systems. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 164\u2013176. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60252-3_13"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/PL00009189","volume":"20","author":"D Harel","year":"1998","unstructured":"Harel, D., Sardas, M.: An algorithm for straight-line drawing of planar graphs. Algorithmica 20(2), 119\u2013135 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00818163","volume":"125","author":"IL Hofacker","year":"1994","unstructured":"Hofacker, I.L., Fontana, W., Stadler, P.F., Bonhoeffer, L.S., Tacker, M., Schuster, P.: Fast folding and comparison of rna secondary structures. Monatshefte f\u00fcr Chemie \/ Chemical Monthly 125(2), 167\u2013188 (1994)","journal-title":"Monatshefte f\u00fcr Chemie \/ Chemical Monthly"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2016.09.010","volume":"671","author":"M Ota","year":"2017","unstructured":"Ota, M., Seki, S.: Rule set design problems for oritatami system. Theor. Comput. Sci. 671, 16\u201335 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1093\/nar\/gkl1036","volume":"35","author":"A Xayaphoummine","year":"2007","unstructured":"Xayaphoummine, A., Viasnoff, V., Harlepp, S., Isambert, H.: Encoding folding paths of RNA switches. Nucleic Acids Res. 35(2), 614\u2013622 (2007)","journal-title":"Nucleic Acids Res."}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00030-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:42:51Z","timestamp":1709833371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00030-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030000295","9783030000301"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00030-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on DNA Computing and Molecular Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dna24sdnu.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}