{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T18:50:54Z","timestamp":1674845454545},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"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":2238,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1016\/j.tcs.2006.10.007","type":"journal-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T20:21:50Z","timestamp":1161202910000},"page":"3-16","source":"Crossref","is-referenced-by-count":1,"title":["On codes defined by bio-operations"],"prefix":"10.1016","volume":"378","author":[{"given":"Mark","family":"Daley","sequence":"first","affiliation":[]},{"given":"Michael","family":"Domaratzki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2006.10.007_b1","series-title":"Theory of Codes","author":"Berstel","year":"1996"},{"key":"10.1016\/j.tcs.2006.10.007_b2","series-title":"Developments in Language Theory 2004","first-page":"163","article-title":"Codes defined by bio-operations","volume":"vol. 3340","author":"Daley","year":"2004"},{"issue":"1","key":"10.1016\/j.tcs.2006.10.007_b3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","article-title":"Closure properties and decision questions of some language classes under ciliate bio-operations","volume":"306","author":"Daley","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.10.007_b4","series-title":"DLT 2002: Developments in Language Theory, Sixth International Conference","first-page":"116","article-title":"Some properties of ciliate bio-operations","volume":"vol. 2450","author":"Daley","year":"2003"},{"issue":"1","key":"10.1016\/j.tcs.2006.10.007_b5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.tcs.2004.03.043","article-title":"Families of languages defined by ciliate bio-operations","volume":"320","author":"Daley","year":"2004","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.10.007_b6","doi-asserted-by":"crossref","unstructured":"M. Domaratzki, Hairpin structures defined by DNA trajectories, in: Pre-proceedings of DNA 12, Seoul, South Korea, 2006, pp.\u00a011\u201321","DOI":"10.1007\/11925903_14"},{"key":"10.1016\/j.tcs.2006.10.007_b7","series-title":"DLT 2006: Developments in Language Theory","first-page":"180","article-title":"Characterizing DNA bond shapes using trajectories","volume":"vol. 4036","author":"Domaratzki","year":"2006"},{"key":"10.1016\/j.tcs.2006.10.007_b8","doi-asserted-by":"crossref","unstructured":"M. Domaratzki, Bond-free DNA language classes, Nat. Comput. (in press)","DOI":"10.1007\/s11047-006-9022-8"},{"issue":"6\u20137","key":"10.1016\/j.tcs.2006.10.007_b9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s00236-004-0140-4","article-title":"Trajectory-based codes","volume":"40","author":"Domaratzki","year":"2004","journal-title":"Acta Inf."},{"key":"10.1016\/j.tcs.2006.10.007_b10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","article-title":"On free monoids partially ordered by embedding","volume":"6","author":"Haines","year":"1969","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.tcs.2006.10.007_b11","doi-asserted-by":"crossref","unstructured":"T. Harju, J. Karhum\u00e4ki, Morphisms, pp. 439\u2013510. In [22]","DOI":"10.1007\/978-3-642-59136-5_7"},{"issue":"3","key":"10.1016\/j.tcs.2006.10.007_b12","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","article-title":"Ordering by divisibility in abstract algebras","volume":"2","author":"Higman","year":"1952","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/j.tcs.2006.10.007_b13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.tcs.2006.10.007_b14","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/0022-0000(91)90026-2","article-title":"Outfix and infix codes and related classes of languages","volume":"43","author":"Ito","year":"1991","journal-title":"J. Comp. Sys. Sci."},{"key":"10.1016\/j.tcs.2006.10.007_b15","doi-asserted-by":"crossref","unstructured":"H. J\u00fcrgensen, S. Konstantinidis, Codes, pp. 511\u2013600. In [22]","DOI":"10.1007\/978-3-642-59136-5_8"},{"key":"10.1016\/j.tcs.2006.10.007_b16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(94)90230-5","article-title":"On language equations with invertible operations","volume":"132","author":"Kari","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.10.007_b17","series-title":"Codes, Involutions and DNA Encoding","first-page":"376","volume":"vol. 2300","author":"Kari","year":"2002"},{"issue":"2","key":"10.1016\/j.tcs.2006.10.007_b18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s00236-003-0118-7","article-title":"Sticky-free and overhang-free DNA languages","volume":"40","author":"Kari","year":"2003","journal-title":"Acta. Inf."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2006.10.007_b19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.tcs.2004.12.032","article-title":"On properties of bond-free DNA languages","volume":"334","author":"Kari","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.10.007_b20","series-title":"Jewels are Forever: Contributions on Theoretical Computer Science in Honour of Arto Salomaa","first-page":"35","article-title":"Synchronized shuffle and regular languages","author":"Latteux","year":"1999"},{"key":"10.1016\/j.tcs.2006.10.007_b21","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/j.tcs.2006.10.007_b22","series-title":"Handbook of Formal Languages, Vol. I","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506007055?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506007055?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T22:26:04Z","timestamp":1555885564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397506007055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["S0304397506007055"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2006.10.007","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}