{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:18:09Z","timestamp":1725459489839},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045107","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T09:16:11Z","timestamp":1139217371000},"page":"403-411","source":"Crossref","is-referenced-by-count":3,"title":["An algorithm for identifying spliced languages"],"prefix":"10.1007","author":[{"given":"Sam M.","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K. Culik II","year":"1991","unstructured":"K. Culik II and T. Harju, Splicing semigroups of dominos and DNA, Discrete Applied Mathematics 31 (1991), pp. 261\u2013277.","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR2","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0221033","volume":"21","author":"R.W. Gatterdam","year":"1992","unstructured":"R.W. Gatterdam, Algorithms for Splicing Systems, SIAM J. Computing 21 (1992), pp. 507\u2013520.","journal-title":"SIAM J. Computing"},{"key":"42_CR3","unstructured":"M. Harrison, Introduction to Formal Language Theory, Addison Wesley, (1978)."},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"T. Head, Formal Language Theory and DNA: An Analysis of the Generative Capacity of Specific Recombinant Behaviors, Bulletin of Mathematical Biology 49 (1987), pp. 737\u2013759.","journal-title":"Bulletin of Mathematical Biology"},{"key":"42_CR5","unstructured":"J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley, (1979)."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/12.93741","volume":"40","author":"S. Kim","year":"1991","unstructured":"S. Kim, R. McNaughton and R. McCloskey, A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata, IEEE Trans. Computers 40 (1991), pp. 1087\u20131093.","journal-title":"IEEE Trans. Computers"},{"key":"42_CR7","unstructured":"S. Kim, Computational Modeling for Genetic Splicing Systems, (to appear in SIAM J. Computing)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"S. Kim, Identifying Genetically Spliced Languages, Proc. of ICEC'97, pp. 231\u2013235.","DOI":"10.1109\/ICEC.1997.592301"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T09:03:41Z","timestamp":1549703021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0045107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}