{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:40:10Z","timestamp":1744216810032,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642338595"},{"type":"electronic","value":"9783642338601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33860-1_13","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T22:44:30Z","timestamp":1348699470000},"page":"147-160","source":"Crossref","is-referenced-by-count":2,"title":["Generating DNA Code Words Using Forbidding and Enforcing Systems"],"prefix":"10.1007","author":[{"given":"Daniela","family":"Genova","sequence":"first","affiliation":[]},{"given":"Kalpana","family":"Mahalingam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_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":"13_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1025492906773","volume":"2","author":"M. Cavaliere","year":"2003","unstructured":"Cavaliere, M., Jonoska, N.: Forbidding and enforcing in membrane computing. Natural Computing\u00a02, 215\u2013228 (2003)","journal-title":"Natural Computing"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Deaton, R., Murphy, R., Rose, J., Garzon, M., Franceschetti, D., Stevens Jr., S.: A DNA based implementation of an evolutionary search for good encodings for DNA computation. In: Proc. IEEE Conference on Evolutionary Computation ICEC 1997, pp. 267\u2013271. Institute of Electrical and Electronics Engineers (1997)","DOI":"10.1109\/ICEC.1997.592311"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1090\/dimacs\/054\/16","volume-title":"DNA Based Computers V","author":"A. Ehrenfeucht","year":"2000","unstructured":"Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G., van Vugt, N.: Forbidding and enforcing. In: DNA Based Computers V, vol.\u00a054, pp. 195\u2013206. AMS DIMACS, Providence (2000)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/S0304-3975(01)00088-3","volume":"292","author":"A. Ehrenfeucht","year":"2003","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Forbidding-enforcing systems. Theoretical Computer Science\u00a0292, 611\u2013638 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1073\/pnas.97.4.1385","volume":"97","author":"D. Faulhammer","year":"2000","unstructured":"Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular computation: RNA solutions to chess problems. Proceedings of the National Academy of Sciences, USA\u00a097(4), 1385\u20131389 (2000)","journal-title":"Proceedings of the National Academy of Sciences, USA"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Franco, G., Jonoska, N.: Forbidding and enforcing conditions in DNA self-assembly of graphs. In: Nanotechnology: Science and Computation. Natural Computing Series Part I, pp. 105\u2013118 (2006)","DOI":"10.1007\/3-540-30296-4_6"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s11047-008-9088-6","volume":"8","author":"M. Garzon","year":"2009","unstructured":"Garzon, M.: On codeword design in metric spaces. Natural Computing\u00a08(3), 571\u2013588 (2009)","journal-title":"Natural Computing"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-21875-0_10","volume-title":"Models of Computation in Context","author":"D. Genova","year":"2011","unstructured":"Genova, D.: Defining Languages by Forbidding-Enforcing Systems. In: L\u00f6we, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol.\u00a06735, pp. 92\u2013101. Springer, Heidelberg (2011)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-28332-1_25","volume-title":"Language and Automata Theory and Applications","author":"D. Genova","year":"2012","unstructured":"Genova, D.: Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 289\u2013300. Springer, Heidelberg (2012)"},{"issue":"4","key":"13_CR11","first-page":"375","volume":"11","author":"D. Genova","year":"2006","unstructured":"Genova, D., Jonoska, N.: Topological properties of forbidding-enforcing systems. Journal of Automata, Languages and Combinatorics\u00a011(4), 375\u2013397 (2006)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2011.12.029","volume":"429","author":"D. Genova","year":"2012","unstructured":"Genova, D., Jonoska, N.: Forbidding and enforcing on graphs. Theoretical Computer Science\u00a0429, 108\u2013117 (2012)","journal-title":"Theoretical Computer Science"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1016\/S0304-3975(02)00069-5","volume":"290","author":"S. Hussini","year":"2003","unstructured":"Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. Theoretical Computer Science\u00a0290, 1557\u20131579 (2003)","journal-title":"Theoretical Computer Science"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11047-004-4009-9","volume":"4","author":"N. Jonoska","year":"2005","unstructured":"Jonoska, N., Mahalingam, K., Chen, J.: Involution codes: with application to DNA coded languages. Natural Computing\u00a04, 141\u2013162 (2005)","journal-title":"Natural Computing"},{"key":"13_CR15","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 Informatica\u00a040, 119\u2013157 (2003)","journal-title":"Acta Informatica"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11925903_10","volume-title":"DNA Computing","author":"L. Kari","year":"2006","unstructured":"Kari, L., Mahalingam, K.: DNA Codes and Their Properties. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol.\u00a04287, pp. 127\u2013142. Springer, Heidelberg (2006)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/35001232","volume":"403","author":"Q. Liu","year":"2000","unstructured":"Liu, Q., Wang, L., Frutos, A.G., Condon, A., Corn, R.M., Smith, L.M.: DNA computing on surfaces. Nature\u00a0403, 175\u2013179 (2000)","journal-title":"Nature"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Marathe, A., Condon, A.E., Corn, R.M.: On combinatorial word design. Preliminary Preproceedings of the 5th International Meeting on DNA Based Computers, Boston, pp. 75\u201388 (1999)","DOI":"10.1090\/dimacs\/054\/07"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33860-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:01:36Z","timestamp":1744214496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33860-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642338595","9783642338601"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33860-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}