{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:52:06Z","timestamp":1742953926538,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637414"},{"type":"electronic","value":"9783031637421"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63742-1_14","type":"book-chapter","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:11:01Z","timestamp":1718655061000},"page":"190-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Rendering of\u00a0Multi-stranded DNA Complexes with\u00a0Pseudoknots"],"prefix":"10.1007","author":[{"given":"Ma\u0142gorzata","family":"Nowicka","sequence":"first","affiliation":[]},{"given":"Vinay K.","family":"Gautam","sequence":"additional","affiliation":[]},{"given":"Pekka","family":"Orponen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(00)00186-4","volume":"104","author":"T Akutsu","year":"2000","unstructured":"Akutsu, T.: Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Appl. Math. 104, 45\u201362 (2000)","journal-title":"Discrete Appl. Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27, 320\u2013331 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00042-9","volume":"74","author":"F Bertault","year":"2000","unstructured":"Bertault, F.: A force-directed algorithm that preserves edge-crossing properties. Inf. Process. Lett. 74, 7\u201313 (2000)","journal-title":"Inf. Process. Lett."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1214\/ss\/1177011077","volume":"8","author":"D Bertsimas","year":"1993","unstructured":"Bertsimas, D., Tsitsiklis, J.: Simulated annealing. Stat. Sci. 8, 10\u201315 (1993)","journal-title":"Stat. Sci."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified O(n) planarity by edge addition. J. Graph Algorithms App. 8, 241\u2013273 (2004)","journal-title":"J. Graph Algorithms App."},{"key":"14_CR6","first-page":"167","volume":"4","author":"RE Bruccoleri","year":"1988","unstructured":"Bruccoleri, R.E., Heinrich, G.: An improved algorithm for nucleic acid secondary structure display. Comput. Appl. Biosci. 4, 167\u2013173 (1988)","journal-title":"Comput. Appl. Biosci."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1093\/bioinformatics\/btp252","volume":"25","author":"Y Byun","year":"2009","unstructured":"Byun, Y., Han, K.: PseudoViewer3: generating planar drawings of large-scale RNA structures with pseudoknots. Bioinformatics 25, 1435\u20131437 (2009)","journal-title":"Bioinformatics"},{"key":"14_CR8","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The Open Graph Drawing Framework (OGDF). In: Handbook of Graph Drawing and Visualization, chap.\u00a017. CRC Press (2014)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geom. App. 7, 211\u2013223 (1997)","journal-title":"Int. J. Comput. Geom. App."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1986","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a graph layout problem with applications to VLSI design. SIAM J. Algebr. Discr. Methods 8, 33\u201358 (1986)","journal-title":"SIAM J. Algebr. Discr. Methods"},{"key":"14_CR11","volume-title":"Graph Drawing","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tammasia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"14_CR12","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representation of planar graphs. Acta Sci. Math. 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2007.09.026","volume":"395","author":"S Gao","year":"2008","unstructured":"Gao, S., Ding, K.: A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class. Theoret. Comput. Sci. 395, 47\u201356 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR14","unstructured":"Gautam, V.K., Long, S., Nowicka, M., Orponen, P.: XDSD: A Tool Bridging DSD System Design to Rule-Based Modelling and Simulation. Web server: https:\/\/xdsd-web.org"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Gautam, V.K., Long, S., Orponen, P.: RuleDSD: a rule-based modelling and simulation tool for DNA strand displacement systems. In: Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies, pp. 158\u2013167 (2020)","DOI":"10.5220\/0008979100002513"},{"issue":"111","key":"14_CR16","doi-asserted-by":"publisher","first-page":"20150580","DOI":"10.1098\/rsif.2015.0580","volume":"12","author":"C Grun","year":"2015","unstructured":"Grun, C., Werfel, J., Zhang, D.Y., Yin, P.: DyNAMiC workbench: an integrated development environment for dynamic DNA nanotechnology. J. R. Soc. Interface 12(111), 20150580 (2015)","journal-title":"J. R. Soc. Interface"},{"key":"14_CR17","unstructured":"Gutwenger, C.: Application of SPQR-trees in the planarization approach for drawing graphs. Ph.D. thesis, Technische Universit\u00e4t Dortmund (2010)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-24595-7_2","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 13\u201324. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_2"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-24595-7_24","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: Graph embedding with minimum depth and maximum external face. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 259\u2013272. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_24"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/PL00009189","volume":"20","author":"D Harel","year":"2000","unstructured":"Harel, D., Meir, S.: An algorithm for straight-line drawing of planar graphs. Algorithmica 20, 119\u2013135 (2000)","journal-title":"Algorithmica"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1006\/bulm.1998.0085","volume":"61","author":"C Haslinger","year":"1999","unstructured":"Haslinger, C., Stadler, P.F.: RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties. Bull. Math. Biol. 61, 437\u2013467 (1999)","journal-title":"Bull. Math. Biol."},{"key":"14_CR22","first-page":"332","volume":"11","author":"M Kaufmann","year":"2020","unstructured":"Kaufmann, M., Bekos, M., Klute, F., Pupyrev, S., Raftopoulou, C., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. Comput. Geom. 11, 332\u2013353 (2020)","journal-title":"J. Comput. Geom."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"3377","DOI":"10.1093\/bioinformatics\/btv372","volume":"31","author":"P Kerpedjiev","year":"2015","unstructured":"Kerpedjiev, P., Hammer, S., Hofacker, I.L.: FoRNA (force-directed RNA): simple and effective online RNA secondary structure diagrams. Bioinformatics 31, 3377\u20133379 (2015)","journal-title":"Bioinformatics"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1093\/bioinformatics\/btr543","volume":"27","author":"MR Lakin","year":"2011","unstructured":"Lakin, M.R., Youssef, S., Polo, F., Emmott, S., Phillips, A.: Visual DSD: a design and analysis tool for DNA strand displacement systems. Bioinformatics 27, 3211\u20133213 (2011)","journal-title":"Bioinformatics"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/978-3-540-27836-8_77","volume-title":"Automata, Languages and Programming","author":"RB Lyngs\u00f8","year":"2004","unstructured":"Lyngs\u00f8, R.B.: Complexity of pseudoknot prediction in simple models. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 919\u2013931. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_77"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1089\/106652700750050862","volume":"7","author":"RB Lyngs\u00f8","year":"2000","unstructured":"Lyngs\u00f8, R.B., Pedersen, C.N.S.: RNA pseudoknot prediction in energy-based models. J. Comput. Biol. 7, 409\u2013427 (2000)","journal-title":"J. Comput. Biol."},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2015.07.041","volume":"632","author":"RL Petersen","year":"2016","unstructured":"Petersen, R.L., Lakin, M.R., Phillips, A.: A strand graph semantics for DNA-based computation. Theoret. Comput. Sci. 632, 43\u201373 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-45253-2_33","volume-title":"Algorithms - ESA 2000","author":"M Pizzonia","year":"2000","unstructured":"Pizzonia, M., Tamassia, R.: Minimum depth graph embedding. In: Paterson, M.S. (ed.) ESA 2000. LNCS, vol. 1879, pp. 356\u2013367. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45253-2_33"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1006\/jmbi.1998.2436","volume":"285","author":"E Rivas","year":"1999","unstructured":"Rivas, E., Eddy, S.R.: A dynamic programming algorithm for RNA structure prediction including pseudoknots. J. Mol. Biol. 285, 2053\u20132068 (1999)","journal-title":"J. Mol. Biol."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Shabash, B., Wiese, K.C.: jViz.RNA 4.0 - visualizing pseudoknots and RNA editing employing compressed tree graphs. PLoS ONE 14(5), e0210281 (2019)","DOI":"10.1371\/journal.pone.0210281"},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1093\/nar\/12.1Part1.75","volume":"12","author":"BA Shapiro","year":"1984","unstructured":"Shapiro, B.A., Maizel, J., Lipkin, L.E., Currey, K., Whitney, C.: Generating non-overlapping displays of nucleic acid secondary structure. Nucleic Acids Res. 12, 75\u201388 (1984)","journal-title":"Nucleic Acids Res."},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"SK Stein","year":"1951","unstructured":"Stein, S.K.: Convex maps. Proc. Am. Math. Soc. 2, 464\u2013466 (1951)","journal-title":"Proc. Am. Math. Soc."},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16, 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and read- ability of diagrams. IEEE Trans. Syst. Man Cybern. 18, 61\u201379 (1988)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"14_CR35","first-page":"26","volume":"46","author":"K Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresber. Deutsch. Math.-Verein. 46, 26\u201332 (1936)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Wiese, K.C., Glen, E., Vasudevan, A.: jViz.Rna - a Java tool for RNA secondary structure visualization. IEEE Trans. NanoBiosci. 4, 212\u2013218 (2005)","DOI":"10.1109\/TNB.2005.853646"},{"key":"14_CR37","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for planar graphs. Technical report\u00a0298, Princeton University (1982)"},{"key":"14_CR38","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jctb.2020.05.008","volume":"145","author":"M Yannakakis","year":"2020","unstructured":"Yannakakis, M.: Planar graphs that need four pages. J. Combin. Theory Ser. B 145, 241\u2013263 (2020)","journal-title":"J. Combin. Theory Ser. B"},{"key":"14_CR39","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/jcc.21596","volume":"32","author":"J Zadeh","year":"2011","unstructured":"Zadeh, J., Steenberg, C., Bois, J., Wolfe, B., Pierce, M., Khan, A., Dirks, R., Pierce, N.: NUPACK: analysis and design of nucleic acid systems. J. Comput. Chem. 32, 170\u20133 (2011)","journal-title":"J. Comput. Chem."},{"key":"14_CR40","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1038\/nchem.957","volume":"3","author":"DY Zhang","year":"2011","unstructured":"Zhang, D.Y., Seelig, G.: Dynamic DNA nanotechnology using strand-displacement reactions. Nat. Chem. 3, 103\u2013113 (2011)","journal-title":"Nat. Chem."}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63742-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:12:48Z","timestamp":1718655168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63742-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637414","9783031637421"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63742-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pohang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/ucnc-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}