{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:24:53Z","timestamp":1767900293110,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0166-218x(91)90054-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"261-277","source":"Crossref","is-referenced-by-count":96,"title":["Splicing semigroups of dominoes and DNA"],"prefix":"10.1016","volume":"31","author":[{"suffix":"II","given":"Karel","family":"Culik","sequence":"first","affiliation":[]},{"given":"Tero","family":"Harju","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90054-Z_BIB1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90070-6","article-title":"Dominoes over a free monoid","volume":"18","author":"Culik","year":"1982","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0166-218X(91)90054-Z_BIB2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1080\/00207168908803715","article-title":"On the undecidability of splicing systems","volume":"27","author":"Denninghoff","year":"1989","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0166-218X(91)90054-Z_BIB3","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","article-title":"Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors","volume":"49","author":"Head","year":"1987","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/0166-218X(91)90054-Z_BIB4","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0166-218X(91)90054-Z_BIB5","series-title":"Genes III","author":"Lewin","year":"1987"},{"key":"10.1016\/0166-218X(91)90054-Z_BIB6","series-title":"Recombinant DNA: A Short Course","author":"Watson","year":"1983"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190054Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190054Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:20:12Z","timestamp":1555136412000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190054Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0166218X9190054Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90054-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}