{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T18:10:02Z","timestamp":1709489402112},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,11,28]],"date-time":"2008-11-28T00:00:00Z","timestamp":1227830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s00224-008-9161-7","type":"journal-article","created":{"date-parts":[[2008,11,27]],"date-time":"2008-11-27T17:44:51Z","timestamp":1227807891000},"page":"301-316","source":"Crossref","is-referenced-by-count":2,"title":["Time and Space Complexity for Splicing Systems"],"prefix":"10.1007","volume":"47","author":[{"given":"Remco","family":"Loos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsunori","family":"Ogihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,28]]},"reference":[{"issue":"4","key":"9161_CR1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0022-0000(71)80025-9","volume":"5","author":"R.V. Book","year":"1971","unstructured":"Book, R.V.: Time-bounded grammars and their languages. J. Comput. Syst. Sci. 5(4), 397\u2013429 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"9161_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K. Culik II","year":"1991","unstructured":"Culik, K. II, Harju, T.: Splicing semigroups of dominoes and DNA. Discrete Appl. Math. 31, 261\u2013277 (1991)","journal-title":"Discrete Appl. Math."},{"issue":"5-6","key":"9161_CR3","first-page":"29","volume":"3","author":"A.V. Gladki\u012d","year":"1964","unstructured":"Gladki\u012d, A.V.: On the complexity of derivations in phase-structure grammars. Algebra Logika Semin. 3(5-6), 29\u201344 (1964) (in Russian)","journal-title":"Algebra Logika Semin."},{"key":"9161_CR4","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biol. 49, 737\u2013759 (1987)","journal-title":"Bull. Math. Biol."},{"key":"9161_CR5","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":"9161_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2006.03.002","volume":"358","author":"R. Loos","year":"2006","unstructured":"Loos, R.: An alternative definition of splicing. Theor. Comput. Sci. 358, 75\u201387 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9161_CR7","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1080\/00207160701228101","volume":"84","author":"R. Loos","year":"2007","unstructured":"Loos, R., Mitrana, V.: Non-preserving splicing with delay. Int. J. Comput. Math. 84(4), 427\u2013436 (2007)","journal-title":"Int. J. Comput. Math."},{"issue":"1-2","key":"9161_CR8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.tcs.2007.06.010","volume":"386","author":"R. Loos","year":"2007","unstructured":"Loos, R., Ogihara, M.: Complexity theory for splicing systems. Theor. Comput. Sci. 386(1-2), 132\u2013150 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9161_CR9","first-page":"1817","volume-title":"Proceedings of the 1999 Genetic and Evolutionary Computation Conference","author":"M. Ogihara","year":"1999","unstructured":"Ogihara, M.: Relating the minimum model for DNA computation and Boolean circuits. In: Proceedings of the 1999 Genetic and Evolutionary Computation Conference, pp. 1817\u20131821. Morgan Kaufmann, San Francisco (1999)"},{"key":"9161_CR10","first-page":"309","volume-title":"Unconventional Models of Computation","author":"M. Ogihara","year":"1998","unstructured":"Ogihara, M., Ray, A.: The minimum DNA computation model and its computational power. In: Unconventional Models of Computation, pp. 309\u2013322. Springer, Singapore (1998)"},{"key":"9161_CR11","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"1","key":"9161_CR12","first-page":"27","volume":"1","author":"Gh. P\u0103un","year":"1996","unstructured":"P\u0103un, Gh.: Regular extended H systems are computationally universal. J. Autom. Lang. Comb. 1(1), 27\u201336 (1996)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"9161_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0304-3975(96)00082-5","volume":"168","author":"Gh. P\u0103un","year":"1996","unstructured":"P\u0103un, Gh., Rozenberg, G., Salomaa, A.: Computing by splicing. Theor. Comput. Sci. 168(2), 321\u2013336 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9161_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing\u2014New Computing Paradigms","author":"Gh. P\u0103un","year":"1998","unstructured":"P\u0103un, Gh., Rozenberg, G., Salomaa, A.: DNA Computing\u2014New Computing Paradigms. Springer, Berlin (1998)"},{"key":"9161_CR15","doi-asserted-by":"crossref","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. 69, 101\u2013124 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9161_CR16","first-page":"213","volume-title":"Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architecture","author":"J.H. Reif","year":"1995","unstructured":"Reif, J.H.: Parallel molecular computation. In: Proceedings of the 7th ACM Symposium on Parallel Algorithms and Architecture, pp. 213\u2013223. ACM Press, New York (1995)"},{"key":"9161_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 77\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9161-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-008-9161-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9161-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T17:29:51Z","timestamp":1709486991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-008-9161-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,28]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9161"],"URL":"https:\/\/doi.org\/10.1007\/s00224-008-9161-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,28]]}}}