{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:56:03Z","timestamp":1743087363542,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642236372"},{"type":"electronic","value":"9783642236389"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23638-9_11","type":"book-chapter","created":{"date-parts":[[2011,9,9]],"date-time":"2011-09-09T17:31:12Z","timestamp":1315589472000},"page":"115-129","source":"Crossref","is-referenced-by-count":1,"title":["Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolae","family":"Santean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1142\/S0129054108006169","volume":"19","author":"C. Campeanu","year":"2008","unstructured":"Campeanu, C., Konstantinidis, S.: State complexity of the subword closure operation with applications to DNA coding. International Journal of Foundations of Computer Science\u00a019(5), 1099\u20131112 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"volume-title":"Preproceedings of DNA9","year":"2003","key":"11_CR2","unstructured":"Chen, J., Reif, J. (eds.): Preproceedings of DNA9, June 2003. Madison, Wisconsin (2003)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C.: Automata for matching patterns. In: [14], pp. 399\u2013462","DOI":"10.1007\/978-3-662-07675-0_9"},{"key":"11_CR4","unstructured":"Cui, B.: Encoding methods for DNA languages defined via the subword closure operation. MSc Thesis, Dept. Math. and Computing Science, Saint Mary\u2019s University, Canada (2007)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Cui, B., Konstantinidis, S.: DNA coding using the subword closure operation. In: [8], pp. 284\u2013289.","DOI":"10.1007\/978-3-540-77962-9_30"},{"key":"11_CR6","volume-title":"Algorithms","author":"S. Dasgupta","year":"2006","unstructured":"Dasgupta, S., Papadimitriou, C.H., Vazirani, U.V.: Algorithms. McGraw-Hill, New York (2006)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"10th International Workshop on DNA Computing","year":"2005","unstructured":"Ferretti, C., Mauri, G., Zandron, C. (eds.): 10th International Workshop on DNA Computing.LNCS, vol.\u00a03384. Springer, Heidelberg (2005)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77962-9_1","volume-title":"DNA Computing","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Demaine, M.L., Fekete, S.P., Ishaque, M., Rafalin, E., Schweller, R.T., Souvaine, D.L.: Staged self-assembly: Nanomanufacture of arbitrary shapes with O(1) glues. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol.\u00a04848, pp. 1\u201314. Springer, Heidelberg (2008)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1992","year":"1992","unstructured":"Havel, I.M., Koubek, V. (eds.): MFCS 1992. LNCS, vol.\u00a0629. Springer, Heidelberg (1992)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Jonoska, N., Mahalingam, K.: Languages of DNA based code words. In: [2], pp. 58\u201368","DOI":"10.1007\/978-3-540-24628-2_8"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P.: Bond-free languages: formalizations, maximality and construction methods. In: [7], pp. 169\u2013181","DOI":"10.1007\/11493785_15"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-14455-4_25","volume-title":"Developments in Language Theory","author":"L. Kari","year":"2010","unstructured":"Kari, L., Seki, S.: Schema for parallel insertion and deletion. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 267\u2013278. Springer, Heidelberg (2010)"},{"key":"11_CR13","unstructured":"Mahalingam, K.: Involution codes: with application to DNA strand design. PhD Thesis, Department of Mathematics, University of South Florida, Florida, USA (2004)"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"11_CR14","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol.\u00a0I. Springer, Berlin (1997)"},{"key":"11_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Berlin (2009)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular Languages. In: [14], pp. 41\u2013110.","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23638-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T03:03:06Z","timestamp":1560567786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23638-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642236372","9783642236389"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23638-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}