{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T18:40:05Z","timestamp":1736620805496,"version":"3.32.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,10,26]],"date-time":"2006-10-26T00:00:00Z","timestamp":1161820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,10,26]],"date-time":"2006-10-26T00:00:00Z","timestamp":1161820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s11047-006-9022-8","type":"journal-article","created":{"date-parts":[[2006,10,25]],"date-time":"2006-10-25T14:54:00Z","timestamp":1161788040000},"page":"371-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Bond-free DNA language classes"],"prefix":"10.1007","volume":"6","author":[{"given":"Michael","family":"Domaratzki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,26]]},"reference":[{"key":"9022_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L Adleman","year":"1994","unstructured":"Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021\u20131024","journal-title":"Science"},{"key":"9022_CR2","unstructured":"Berstel J and Perrin D (1996) Theory of Codes. Available at http:\/\/www-igm.univ-mlv.fr\/%7Eberstel\/LivreCodes\/Codes.html"},{"issue":"2\u20133","key":"9022_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2004.02.031","volume":"320","author":"M Domaratzki","year":"2004a","unstructured":"Domaratzki M (2004a) Deletion along trajectories. Theoretical Computer Science 320(2\u20133):293\u2013313","journal-title":"Theoretical Computer Science"},{"issue":"6\u20137","key":"9022_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00236-004-0140-4","volume":"40","author":"M Domaratzki","year":"2004b","unstructured":"Domaratzki M (2004b) Trajectory-Based Codes. Acta Informatica 40(6\u20137):491\u2013527","journal-title":"Acta Informatica"},{"issue":"4","key":"9022_CR5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.3233\/FUN-2004-59403","volume":"59","author":"M Domaratzki","year":"2004c","unstructured":"Domaratzki M (2004c) Trajectory-Based Embedding Relations. Fundamenta Informatica 59(4):349\u2013363","journal-title":"Fundamenta Informatica"},{"key":"9022_CR6","first-page":"107","volume":"86","author":"M Domaratzki","year":"2005","unstructured":"Domaratzki M (2005) More Words on Trajectories. Bulletin of the European Association of Theoretical Computer Science 86:107\u2013145","journal-title":"Bulletin of the European Association of Theoretical Computer Science"},{"key":"9022_CR7","unstructured":"Domaratzki M and Salomaa K (2005) Codes defined by multiple sets of trajectories. In: Esik Z and Fulop Z (eds) Automata and Formal Languages (AFL\u201905), pp. 97\u2013111, Theoretical Computer Science (to appear)"},{"key":"9022_CR8","doi-asserted-by":"crossref","unstructured":"Ginsburg S (1966) The Mathematical Theory of Context-Free Languages. McGraw-Hill","DOI":"10.1145\/321312.321318"},{"key":"9022_CR9","unstructured":"Hopcroft JE and Ullman JD (1979) Introduction to Automata Theory, Languages, and Computation. Addison-Wesley"},{"issue":"3","key":"9022_CR10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1145\/322017.322020","volume":"24","author":"H Hunt","year":"1977","unstructured":"Hunt H, Rosenkrantz D (1977) On equivalence and containment problems for formal languages. Journal of the Association for Computing Machinery 24(3):387\u2013396","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"9022_CR11","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1016\/S0304-3975(02)00069-5","volume":"290","author":"S Hussini","year":"2002","unstructured":"Hussini S, Kari L, Konstantinidis S (2002) Coding properties of DNA languages. Theoretical Computer Science 290(3):1557\u20131579","journal-title":"Theoretical Computer Science"},{"key":"9022_CR12","doi-asserted-by":"crossref","unstructured":"J\u00fcrgensen H and Konstantinidis S (1997) Codes. In: Rozenberg G and Salomaa A (eds) Handbook of Formal Languages, Springer pp. 511\u2013600","DOI":"10.1007\/978-3-642-59136-5_8"},{"issue":"3","key":"9022_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0020-0190(01)00153-3","volume":"80","author":"A Kadrie","year":"2001","unstructured":"Kadrie A, Dare V, Thomas D, Subramanian K (2001) Algebraic Properties of the shuffle over \u03c9-trajectories. Information Processing Letters 80(3):139\u2013144","journal-title":"Information Processing Letters"},{"key":"9022_CR14","doi-asserted-by":"crossref","unstructured":"Kari L, Kitto R and Thierrin G (2003a) Codes, involutions and DNA encoding. In: Brauer W et\u00a0al. (eds) Vol. 2300 of LNCS, pp. 376\u2013393","DOI":"10.1007\/3-540-45711-9_21"},{"key":"9022_CR15","unstructured":"Kari L and Sos\u00edk P (2003) Language deletions on trajectories. Technical Report 606, Computer Science Department, University of Western Ontario"},{"issue":"1\u20133","key":"9022_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2004.09.038","volume":"332","author":"L Kari","year":"2005","unstructured":"Kari L, Sos\u00edk P (2005) Aspects of shuffle and deletion on trajectories. Theoretical Computer Science 332(1\u20133):47\u201361","journal-title":"Theoretical Computer Science"},{"key":"9022_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.jcss.2004.08.005","volume":"70","author":"L Kari","year":"2005","unstructured":"Kari L, Konstantinidis S (2005) Language equations, maximality and error-detection. Journal of Computer and System Sciences 70:157\u2013178","journal-title":"Journal of Computer and System Sciences"},{"key":"9022_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00236-003-0118-7","volume":"40","author":"L Kari","year":"2003b","unstructured":"Kari L, Konstantinidis S, Losseva E, Wozniak G (2003b) Sticky-free and overhang-free DNA languages. Acta Informatica 40:119\u2013157","journal-title":"Acta Informatica"},{"key":"9022_CR19","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1142\/S0129054105003467","volume":"16","author":"L Kari","year":"2005a","unstructured":"Kari L, Konstantinidis S, Sos\u00edk P (2005a) Bond-free Languages: Formalisms, Maximality and Construction Methods. International Journal of Foundations of Computer Sciences 16:1039\u20131070","journal-title":"International Journal of Foundations of Computer Sciences"},{"key":"9022_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2004.12.032","volume":"334","author":"L Kari","year":"2005b","unstructured":"Kari L, Konstantinidis S, Sos\u00edk P (2005b) On properties of bond-free DNA languages. Theoretical Computer Science 334:131\u2013159","journal-title":"Theoretical Computer Science"},{"key":"9022_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A Mateescu","year":"1998","unstructured":"Mateescu A, Rozenberg G, Salomaa A (1998) Shuffle on trajectories: Syntactic constraints. Theoretical Computer Science 197:1\u201356","journal-title":"Theoretical Computer Science"},{"key":"9022_CR22","doi-asserted-by":"crossref","unstructured":"Nowotka D and Harju T (2004) Periodicity and unbordered words. In: Diekert V and Habib M (eds) STACS (Montpellier, 2004), Vol. 2996 of LNCS, pp. 294\u2013304","DOI":"10.1007\/978-3-540-24749-4_26"},{"key":"9022_CR23","volume-title":"Free Monoids and Languages","author":"H Shyr","year":"2001","unstructured":"Shyr H (2001) Free Monoids and Languages. Hon Min Book Company, Taichung, Taiwan"},{"key":"9022_CR24","doi-asserted-by":"crossref","unstructured":"Yu S (1997) Regular languages. In: Rozenberg G and Salomaa A (eds) Handbook of Formal Languages, Springer pp. 41\u2013110.","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-006-9022-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-006-9022-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-006-9022-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-006-9022-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T17:30:56Z","timestamp":1736616656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-006-9022-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,26]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["9022"],"URL":"https:\/\/doi.org\/10.1007\/s11047-006-9022-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2006,10,26]]},"assertion":[{"value":"27 January 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}