{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T05:24:26Z","timestamp":1768800266345,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T00:00:00Z","timestamp":1680739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100015622","name":"Ministerul Cercet\u0103rii \u015fi Inov\u0103rii","doi-asserted-by":"publisher","award":["National Core Program of the National Research, Development and Innovation Plan 2022-2027, Code 23020101."],"award-info":[{"award-number":["National Core Program of the National Research, Development and Innovation Plan 2022-2027, Code 23020101."]}],"id":[{"id":"10.13039\/501100015622","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003759","name":"Universidad Polit\u00e9cnica de Madrid","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003759","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Membr Comput"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Networks of splicing processors are one of the theoretical computational models that take inspiration from nature to efficiently solve problems that our current computational knowledge is not able to. One of the issues restricting\/hindering is practical implementation is the arbitrariness of the underlying graph, since our computational systems usually conform to a predefined topology. We propose simulations of networks of splicing processors having arbitrary underlying graphs by networks whose underlying graphs are of a predefined topology: complete, star, and grid graphs. We show that all of these simulations are time efficient in the meaning that they preserve the time complexity of the original network: each computational step in that network is simulated by a fixed number of computational steps in the new topologic networks. Moreover, these simulations do not modify the order of magnitude of the network size.<\/jats:p>","DOI":"10.1007\/s41965-023-00120-1","type":"journal-article","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T12:05:58Z","timestamp":1680782758000},"page":"108-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Networks of splicing processors: simulations between topologies"],"prefix":"10.1007","volume":"5","author":[{"given":"Jos\u00e9 Angel Sanchez","family":"Mart\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihaela","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,6]]},"reference":[{"key":"120_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00236-012-0169-8","volume":"50","author":"F Arroyo","year":"2013","unstructured":"Arroyo, F., Castellanos, J., Dassow, J., Mitrana, V., & Sanchez-Couso, J. R. (2013). Accepting splicing systems with permitting and forbidding words. Acta Inf., 50, 1\u201314. https:\/\/doi.org\/10.1007\/s00236-012-0169-8","journal-title":"Acta Inf."},{"key":"120_CR2","doi-asserted-by":"publisher","unstructured":"Bordihn, H., Mitrana, V., P\u0103un, A., P\u0103un, M. (2017). Networks of polarized splicing processors. In Theory and Practice of Natural Computing, TPNC 2017, Lecture Notes in Computer Science 10687, 165\u2013177. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-319-71069-3_13","DOI":"10.1007\/978-3-319-71069-3_13"},{"key":"120_CR3","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s11047-018-9691-0","volume":"17","author":"H Bordihn","year":"2018","unstructured":"Bordihn, H., Mitrana, V., Negru, M. C., P\u0103un, A., & P\u0103un, M. (2018). Small networks of polarized splicing processors are universal. Natural Computing, 17, 799\u2013809. https:\/\/doi.org\/10.1007\/s11047-018-9691-0","journal-title":"Natural Computing"},{"key":"120_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-21875-0_5","volume":"6735","author":"J Castellanos","year":"2011","unstructured":"Castellanos, J., Mitrana, V., & Santos, E. (2011). Splicing systems: accepting versus generating. In Models of Computation in Context. CiE 2011, Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, 6735, 41\u201350. https:\/\/doi.org\/10.1007\/978-3-642-21875-0_5","journal-title":"Springer, Berlin, Heidelberg"},{"key":"120_CR5","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T Head","year":"1987","unstructured":"Head, T. (1987). Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biol., 49, 737\u2013759. https:\/\/doi.org\/10.1007\/BF02481771","journal-title":"Bull. Math. Biol."},{"key":"120_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-662-07675-0_7","volume":"2","author":"T Head","year":"1996","unstructured":"Head, T., P\u0103un, G., & Pixton, D. (1996). Language theory and molecular genetics: Generative mechanisms suggested by DNA recombination. In Handbook of Formal Languages, 2, 295\u2013360. https:\/\/doi.org\/10.1007\/978-3-662-07675-0_7","journal-title":"In Handbook of Formal Languages"},{"key":"120_CR7","doi-asserted-by":"publisher","unstructured":"Head, T. (2011). How the structure of DNA molecules provides tools for computation. In Biology, Computation and Linguistics. Frontiers in Artificial Intelligence and Applications vol. 228, 3\u20138. IOS Press. https:\/\/doi.org\/10.3233\/978-1-60750-762-8-3","DOI":"10.3233\/978-1-60750-762-8-3"},{"key":"120_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/9783527645480.CH13","author":"T Head","year":"2012","unstructured":"Head, T. (2012). Restriction enzymes in language generation and plasmid computing In Biomolecular Information Processing: From Logic Systems to Smart Sensors and Actuators, 245\u2013263. Wiley Online Library. https:\/\/doi.org\/10.1002\/9783527645480.CH13","journal-title":"Wiley Online Library"},{"key":"120_CR9","doi-asserted-by":"publisher","unstructured":"Jonoska, N., P\u0103un, G., Rozenberg, G. (Eds.) (2004). Aspects of Molecular Computing. Essays Dedicated to Tom Head on the Occasion of His 70th Birthday, Lecture Notes in Computer Science vol. 2950. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/b94864","DOI":"10.1007\/b94864"},{"key":"120_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.tcs.2008.09.048","volume":"410","author":"R Loos","year":"2009","unstructured":"Loos, R., Manea, F., & Mitrana, V. (2009). On small, reduced, and fast universal accepting networks of splicing processors. Theoretical Computer Science, 410, 406\u2013416. https:\/\/doi.org\/10.1016\/j.tcs.2008.09.048","journal-title":"Theoretical Computer Science"},{"key":"120_CR11","doi-asserted-by":"publisher","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V. (2006). All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size. In: DNA Computing. Lecture Notes in Computer Science, vol. 4287, 47\u201357. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11925903_4","DOI":"10.1007\/11925903_4"},{"key":"120_CR12","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2006.10.015","volume":"371","author":"F Manea","year":"2007","unstructured":"Manea, F., Mart\u00edn-Vide, C., & Mitrana, V. (2007). Accepting networks of splicing processors: complexity results. Theoretical Computer Science, 371, 72\u201382. https:\/\/doi.org\/10.1016\/j.tcs.2006.10.015","journal-title":"Theoretical Computer Science"},{"key":"120_CR13","doi-asserted-by":"publisher","first-page":"2414","DOI":"10.1016\/j.tcs.2010.03.025","volume":"411","author":"V Mitrana","year":"2010","unstructured":"Mitrana, V., Petre, I., & Rogojin, V. (2010). Accepting splicing systems. Theoret. Comput. Sci., 411, 2414\u20132422. https:\/\/doi.org\/10.1016\/j.tcs.2010.03.025","journal-title":"Theoret. Comput. Sci."},{"key":"120_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.25596\/jalc-2021-109","volume":"26","author":"V Mitrana","year":"2021","unstructured":"Mitrana, V., P\u0103un, A., & P\u0103un, M. (2021). Non-preserving accepting splicing systems. Jounal Automata Languages Combinatorics, 26, 109\u2013124. https:\/\/doi.org\/10.25596\/jalc-2021-109","journal-title":"Jounal Automata Languages Combinatorics"},{"key":"120_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(96)00101-1","volume":"70","author":"G P\u0103un","year":"1996","unstructured":"P\u0103un, G. (1996). On the splicing operation. Discrete Applied Mathematics, 70, 57\u201379. https:\/\/doi.org\/10.1016\/0166-218X(96)00101-1","journal-title":"Discrete Applied Mathematics"},{"key":"120_CR16","doi-asserted-by":"publisher","unstructured":"P\u0103un, G., Rozenberg, G., & Salomaa, A. (1998). DNA computing: New Computing Paradigms. Springer, Berlin, Heidelberg.https:\/\/doi.org\/10.1007\/3-540-48523-6_9","DOI":"10.1007\/3-540-48523-6_9"},{"key":"120_CR17","doi-asserted-by":"publisher","unstructured":"Rozenberg, G., & Salomaa, A. (1997). Handbook of Formal Languages. Springer, Berlin, Heidelberg.https:\/\/doi.org\/10.1007\/978-3-662-07675-0","DOI":"10.1007\/978-3-662-07675-0"}],"container-title":["Journal of Membrane Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-023-00120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41965-023-00120-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41965-023-00120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T16:02:25Z","timestamp":1689955345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41965-023-00120-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["120"],"URL":"https:\/\/doi.org\/10.1007\/s41965-023-00120-1","relation":{},"ISSN":["2523-8906","2523-8914"],"issn-type":[{"value":"2523-8906","type":"print"},{"value":"2523-8914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,6]]},"assertion":[{"value":"30 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}