{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:40Z","timestamp":1725543460203},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_17","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T01:55:49Z","timestamp":1150854949000},"page":"180-191","source":"Crossref","is-referenced-by-count":2,"title":["Characterizing DNA Bond Shapes Using Trajectories"],"prefix":"10.1007","author":[{"given":"Michael","family":"Domaratzki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular computation of solutions to combinatorial problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"17_CR2","volume-title":"Theoretical and Experimental DNA Computation","author":"M. Amos","year":"2005","unstructured":"Amos, M.: Theoretical and Experimental DNA Computation. Springer, Heidelberg (2005)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Domaratzki, M.: Hairpin structures defined by DNA trajectories. Technical Report TR-2006-001, Jodrey School of Computer Science, Acadia University (submitted for publication, 2006)","DOI":"10.1007\/11925903_14"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1016\/S0304-3975(02)00069-5","volume":"290","author":"S. Hussini","year":"2002","unstructured":"Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. Theor. Comp. Sci.\u00a0290(3), 1557\u20131579 (2002)","journal-title":"Theor. Comp. Sci."},{"key":"17_CR5","first-page":"99","volume":"156","author":"N. Jonoska","year":"2002","unstructured":"Jonoska, N., Kephart, D., Mahalingam, K.: Generating DNA code words. Congressus Numerantium\u00a0156, 99\u2013110 (2002)","journal-title":"Congressus Numerantium"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-45711-9_21","volume-title":"Formal and Natural Computing","author":"L. Kari","year":"2002","unstructured":"Kari, L., Kitto, R., Thierrin, G.: Codes, involutions and DNA encoding. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 376\u2013393. Springer, Heidelberg (2002)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11753681_12","volume-title":"DNA Computing","author":"L. Kari","year":"2006","unstructured":"Kari, L., Konstantinidis, S., Losseva, E., Sos\u00edk, P., Thierrin, G.: Hairpin structures in DNA words. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol.\u00a03892, pp. 158\u2013170. Springer, Heidelberg (2006)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00236-003-0118-7","volume":"40","author":"L. Kari","year":"2003","unstructured":"Kari, L., Konstantinidis, S., Losseva, E., Wozniak, G.: Sticky-free and overhang-free DNA languages. Acta Inform.\u00a040, 119\u2013157 (2003)","journal-title":"Acta Inform."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1142\/S0129054105003467","volume":"16","author":"L. Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P.: Bond-free languages: Formalisms, maximality and construction methods. Int. J. Found. Comp. Sci.\u00a016, 1039\u20131070 (2005)","journal-title":"Int. J. Found. Comp. Sci."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2004.12.032","volume":"334","author":"L. Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P.: On properties of bond-free DNA languages. Theor. Comp. Sci.\u00a0334, 131\u2013159 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A. Mateescu","year":"1998","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comp. Sci.\u00a0197, 1\u201356 (1998)","journal-title":"Theor. Comp. Sci."},{"key":"17_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"17_CR13","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:15:47Z","timestamp":1619493347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11779148_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}