{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T16:23:15Z","timestamp":1758039795472,"version":"3.44.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100015622","name":"Ministerul Cercet\u0103rii \u015fi Inov\u0103rii","doi-asserted-by":"publisher","award":["PNRR\/2022\/C9\/MCID\/I8 project 760231\/2023"],"award-info":[{"award-number":["PNRR\/2022\/C9\/MCID\/I8 project 760231\/2023"]}],"id":[{"id":"10.13039\/501100015622","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018987","name":"Ministerul Cercet\u0103rii, Inov\u0103rii \u015fi Digitaliz\u0103rii","doi-asserted-by":"publisher","award":["23020101(SIA-PRO), contract no 7N\/2022","23020101(SIA-PRO), contract no 7N\/2022"],"award-info":[{"award-number":["23020101(SIA-PRO), contract no 7N\/2022","23020101(SIA-PRO), contract no 7N\/2022"]}],"id":[{"id":"10.13039\/100018987","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11047-024-10008-3","type":"journal-article","created":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T18:41:13Z","timestamp":1736188873000},"page":"419-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Networks of splicing processors: path graph topology simulation"],"prefix":"10.1007","volume":"24","author":[{"given":"Jos\u00e9 Angel S\u00e1nchez","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":[[2025,1,7]]},"reference":[{"key":"10008_CR1","unstructured":"Becker WM, Kleinsmith LJ, Hardin J (2006) The world of the cell. Pearson\/Benjamin Cummings, San Francisco"},{"key":"10008_CR2","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 MC, P\u0103un A, P\u0103un A (2018) Small networks of polarized splicing processors are universal. Nat Comput 17:799\u2013809","journal-title":"Nat Comput"},{"key":"10008_CR3","doi-asserted-by":"crossref","unstructured":"Bordihn H, Mitrana V, P\u0103un A, P\u0103un A (2017) Networks of polarized splicing processors. In: Mart\u00edn-Vide C, Neruda R, Vega-Rodr\u00edguez MA (eds) Theory and practice of natural computing, TPNC 2017, vol LNCS 10687. Springer, Heidelberg, pp 165\u2013177","DOI":"10.1007\/978-3-319-71069-3_13"},{"key":"10008_CR4","doi-asserted-by":"crossref","unstructured":"Castellanos J, Mitrana V, Santos E (2011) Splicing systems: accepting versus generating. In: L\u00f6we B, Normann D, Soskov IN, Soskova AA (eds.) Models of computation in context\u20147th conference on computability in Europe, CiE 2011, vol LNCS 6735. Springer, Heidelberg, pp 41\u201350","DOI":"10.1007\/978-3-642-21875-0_5"},{"key":"10008_CR5","first-page":"1598","volume":"13","author":"C Dragoi","year":"2007","unstructured":"Dragoi C, Mitrana V, Manea F (2007) Accepting networks of evolutionary processors with filtered connections. J Univ Comput Sci 13:1598\u20131614","journal-title":"J Univ Comput Sci"},{"key":"10008_CR6","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/S0092-8240(87)90018-8","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","journal-title":"Bull Math Biol"},{"key":"10008_CR7","doi-asserted-by":"crossref","unstructured":"Head T (2011) How the structure of DNA molecules provides tools for computation. In: Bel-Enguix G, Dahl V, Jim\u00e9nez-L\u00f3pez MD (eds) Biology, computation and linguistics vol. 228 of Frontiers in Artificial Intelligence and Applications, IOS Press, Amsterdam, pp 3\u20138","DOI":"10.3233\/978-1-60750-762-8-3"},{"key":"10008_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-662-07675-0_7","volume-title":"Handbook of formal languages","author":"T Head","year":"1997","unstructured":"Head T, P\u0103un G, Pixton D (1997) Language theory and molecular genetics: generative mechanisms suggested by DNA recombination. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages. Springer, Heidelberg, pp 295\u2013360"},{"key":"10008_CR9","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. Theor Comput Sci 410:406\u2013416","journal-title":"Theor Comput Sci"},{"key":"10008_CR10","doi-asserted-by":"crossref","unstructured":"Loos R, Mart\u00edn-Vide C, Mitrana V (2006) Solving SAT and HPP with accepting splicing systems. In: Runarsson TP, Beyer H-G, Burke EK, Merelo\u00a0Guerv\u00f3s JJ, Whitley LD, Yao X (eds) Parallel Problem Solving from Nature\u2014PPSN IX, vol LNCS 4193. Springer, Heidelberg, pp 771\u2013777","DOI":"10.1007\/11844297_78"},{"key":"10008_CR11","doi-asserted-by":"crossref","unstructured":"Manea F, Mart\u00edn-Vide C, Mitrana V (2005) Accepting networks of splicing processors. In: Cooper SB, L\u00f6we B, Torenvliet L (eds.) New computational paradigms, first conference on computability in Europe, CiE 2005, vol LNCS 3526, Springer, Heidelberg, pp 300\u2013309","DOI":"10.1007\/11494645_38"},{"key":"10008_CR12","doi-asserted-by":"crossref","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: Mao C, Yokomori T (eds) DNA computing, 12th international meeting on DNA computing, vol LNCS 4287. Springer, Heidelberg, pp 47\u201357","DOI":"10.1007\/11925903_4"},{"key":"10008_CR13","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. Theor Comput Sci 371:72\u201382","journal-title":"Theor Comput Sci"},{"key":"10008_CR14","doi-asserted-by":"crossref","unstructured":"Manea F, Mart\u00edn-Vide C, Mitrana V (2010) Accepting networks of evolutionary word and picture processors: a survey. In: Mart\u00edn-Vide C (ed) Scientific applications of language methods vol. mathematics, computing, language, and life: frontiers in mathematical linguistics and language theory. World Scientific, Singapore, pp 525\u2013560","DOI":"10.1142\/9781848165458_0010"},{"key":"10008_CR15","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. Theor Comput Sci 411:2414\u20132422","journal-title":"Theor Comput Sci"},{"key":"10008_CR16","doi-asserted-by":"crossref","unstructured":"Mitrana V, P\u0103un M, S\u00e1nchez\u00a0Mart\u00edn JA (2024) Networks of splicing processors with various topologies. In: Vicente JM, Val-Calvo M, Adeli H (eds) Bioinspired systems for translational applications: from robotics to social engineering\u201410th international work-conference on the interplay between natural and artificial computation, IWINAC 2024, vol LNCS 14675. Springer, Heidelberg, pp 430\u2013440","DOI":"10.1007\/978-3-031-61137-7_40"},{"key":"10008_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA computing: new computing paradigms","author":"G P\u0103un","year":"1998","unstructured":"P\u0103un G, Rozenberg G, Salomaa A (1998) DNA computing: new computing paradigms. Springer, Heidelberg"},{"key":"10008_CR18","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. Discret Appl Math 70:57\u201379","journal-title":"Discret Appl Math"},{"key":"10008_CR19","doi-asserted-by":"crossref","unstructured":"Rozenberg G, B\u00e4ck T, Kok JN (eds) (2012) Handbook of natural computing. Springer, Heidelberg","DOI":"10.1007\/978-3-540-92910-9"},{"key":"10008_CR20","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/s41965-023-00120-1","volume":"5","author":"JA S\u00e1nchez Mart\u00edn","year":"2023","unstructured":"S\u00e1nchez Mart\u00edn JA, Mitrana V, P\u0103un M (2023) Networks of splicing processors: simulations between topologies. J Membr Comput 5:108\u2013115","journal-title":"J Membr Comput"},{"key":"10008_CR21","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez\u00a0Mart\u00edn JA, Mitrana V, P\u0103un M, S\u00e1nchez\u00a0Couso JR (2024) Networks of splicing processors: wheel graph topology simulation (submitted)","DOI":"10.1007\/s11047-024-10008-3"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-024-10008-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-024-10008-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-024-10008-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T05:02:35Z","timestamp":1757566955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-024-10008-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,7]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10008"],"URL":"https:\/\/doi.org\/10.1007\/s11047-024-10008-3","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2025,1,7]]},"assertion":[{"value":"16 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declares that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statements"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}