{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:46:29Z","timestamp":1757310389870},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490241"},{"type":"electronic","value":"9783540684237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11925903_14","type":"book-chapter","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T16:03:04Z","timestamp":1166025784000},"page":"182-194","source":"Crossref","is-referenced-by-count":7,"title":["Hairpin Structures Defined by DNA Trajectories"],"prefix":"10.1007","author":[{"given":"Michael","family":"Domaratzki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","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 (2006)","DOI":"10.1007\/11925903_14"},{"key":"14_CR2","unstructured":"Kari, L., Konstantinidis, S., Losseva, E., Sos\u00edk, P., Thierrin, G.: Hairpin structures in DNA words. In: Carbone, A., Daley, M., Kari, L., McQuillan, I., Pierce, N. (eds.) The 11th International Meeting on DNA Computing: DNA 11, Preliminary Proceedings, pp. 267\u2013277 (2005)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11505877_26","volume-title":"Developments in Language Theory","author":"L. Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P., Thierrin, G.: On Hairpin-Free Words and Languages. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 296\u2013307. Springer, Heidelberg (2005)"},{"issue":"12","key":"14_CR4","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"P. Rothemund","year":"2004","unstructured":"Rothemund, P., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol.\u00a02(12), e424 (2004)","journal-title":"PLoS Biol."},{"key":"14_CR5","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."},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"14_CR6","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)"},{"key":"14_CR7","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)"},{"key":"14_CR8","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."},{"issue":"4","key":"14_CR9","first-page":"349","volume":"59","author":"M. Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Trajectory-based embedding relations. Fund. Inf.\u00a059(4), 349\u2013363 (2004)","journal-title":"Fund. Inf."},{"key":"14_CR10","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":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-24628-2_8","volume-title":"DNA Computing","author":"N. Jonoska","year":"2004","unstructured":"Jonoska, N., Mahalingam, K.: Languages of DNA based code words. In: Chen, J., Reif, J.H. (eds.) DAN 2003. LNCS, vol.\u00a02943, pp. 61\u201373. Springer, Heidelberg (2004)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-55808-X_48","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A. Szilard","year":"1992","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol.\u00a0629, pp. 494\u2013503. Springer, Heidelberg (1992)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11779148_17","volume-title":"Developments in Language Theory","author":"M. Domaratzki","year":"2006","unstructured":"Domaratzki, M.: Characterizing DNA Bond Shapes Using Trajectories. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 180\u2013191. Springer, Heidelberg (2006)"},{"key":"14_CR14","first-page":"157","volume":"54","author":"N. Rampersad","year":"2005","unstructured":"Rampersad, N., Shallit, J.: Words avoiding reversed subwords. J. Combin. Math. and Combin. Comput.\u00a054, 157\u2013164 (2005)","journal-title":"J. Combin. Math. and Combin. Comput."},{"key":"14_CR15","unstructured":"Cassaigne, J.: Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots. PhD thesis, Universit\u00e9 Paris 6 (1994)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0097-3165(74)90041-7","volume":"16","author":"R. Entringer","year":"1974","unstructured":"Entringer, R., Jackson, D., Schatz, J.: On nonrepetitive sequences. J. Combin. Theory. Ser. A\u00a016, 159\u2013164 (1974)","journal-title":"J. Combin. Theory. Ser. A"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11925903_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:46:16Z","timestamp":1619509576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11925903_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490241","9783540684237"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11925903_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}