{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T19:42:42Z","timestamp":1757706162687,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540389903"},{"type":"electronic","value":"9783540389910"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_78","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"771-777","source":"Crossref","is-referenced-by-count":4,"title":["Solving SAT and HPP with Accepting Splicing Systems"],"prefix":"10.1007","author":[{"given":"Remco","family":"Loos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"78_CR1","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.tcs.2005.03.035","volume":"340","author":"P. Bonizzoni","year":"2005","unstructured":"Bonizzoni, P., Mauri, G.: Regular splicing languages and subclasses. Theoret. Comput. Sci.\u00a0340, 349\u2013363 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"78_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K. Culik II","year":"1991","unstructured":"Culik II, K., Harju, T.: Splicing semigroups of dominoes and DNA. Discrete Appl. Math.\u00a031, 261\u2013277 (1991)","journal-title":"Discrete Appl. Math."},{"key":"78_CR3","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"78_CR4","series-title":"Lecture Notes in Computer Science","first-page":"151","volume-title":"Proc. 10th Internat. Meeting on DNA Based Computers, DNA10","author":"T. Harju","year":"2005","unstructured":"Harju, T., Margenstern, M.: Splicing systems for universal Turing machines. In: Milan, C.F., et al. (eds.) Proc. 10th Internat. Meeting on DNA Based Computers, DNA10. LNCS, vol.\u00a03384, pp. 151\u2013160. Springer, Heidelberg (2005)"},{"key":"78_CR5","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/S0092-8240(87)90018-8","volume":"49","author":"T. Head","year":"1987","unstructured":"Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biology\u00a049, 737\u2013759 (1987)","journal-title":"Bull. Math. Biology"},{"key":"78_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"78_CR7","unstructured":"Loos, R.: An alternative definition of splicing. Theoret. Comput. Sci. (to appear)"},{"key":"78_CR8","unstructured":"Loos, R., Ogihara, M.: A complexity theory for splicing systems (submitted, 2006)"},{"issue":"1","key":"78_CR9","first-page":"27","volume":"1","author":"G. Paun","year":"1996","unstructured":"Paun, G.: Regular extended H systems are computationally universal. J. Automata, languages, Combinatorics\u00a01(1), 27\u201336 (1996)","journal-title":"J. Automata, languages, Combinatorics"},{"key":"78_CR10","volume-title":"DNA computing - New computing paradigms","author":"G. Paun","year":"1998","unstructured":"Paun, G., Rozenberg, G., Salomaa, A.: DNA computing - New computing paradigms. Springer, Berlin (1998)"},{"key":"78_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","volume":"69","author":"D. Pixton","year":"1996","unstructured":"Pixton, D.: Regularity of Splicing Languages. Discrete Appl. Math.\u00a069, 101\u2013124 (1996)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:17:07Z","timestamp":1664241427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11844297_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}