{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T01:10:02Z","timestamp":1748394602193,"version":"3.41.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T00:00:00Z","timestamp":1431993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11047-015-9502-9","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T13:57:01Z","timestamp":1431957421000},"page":"31-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pseudo-inversion: closure properties and decidability"],"prefix":"10.1007","volume":"15","author":[{"given":"Da-Jung","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-Dong","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hwee","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Ki","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,19]]},"reference":[{"key":"9502_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2012.06.009","volume":"483","author":"D Cantone","year":"2013","unstructured":"Cantone D, Cristofaro S, Faro S (2013) Efficient string-matching allowing for non-overlapping inversions. Theor Comput Sci 483:85\u201395","journal-title":"Theor Comput Sci"},{"key":"9502_CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.tcs.2012.04.002","volume":"454","author":"E Chiniforooshan","year":"2012","unstructured":"Chiniforooshan E, Daley M, Ibarra OH, Kari L, Seki S (2012) One-reversal counter machines and multihead automata: revisited. Theor Comput Sci 454:81\u201387","journal-title":"Theor Comput Sci"},{"key":"9502_CR3","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.tcs.2014.10.036","volume":"575","author":"DJ Cho","year":"2015","unstructured":"Cho DJ, Han YS, Kim H (2015a) Alignment with non-overlapping inversions and translocations on two strings. Theor Comput Sci 575:90\u2013101","journal-title":"Theor Comput Sci"},{"key":"9502_CR4","doi-asserted-by":"crossref","unstructured":"Cho DJ, Han YS, Kim H (2015b) Frequent pattern mining with non-overlapping inversions. In: Proceedings of the 9th language and automata theory and applications, vol 8977, pp 121\u2013132","DOI":"10.1007\/978-3-319-15579-1_9"},{"issue":"1\u20133","key":"9502_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","volume":"306","author":"M Daley","year":"2003","unstructured":"Daley M, Ibarra OH, Kari L (2003) Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theor Comput Sci 306(1\u20133):19\u201338","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9502_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.tcs.2004.03.043","volume":"320","author":"M Daley","year":"2004","unstructured":"Daley M, Kari L, McQuillan I (2004) Families of languages defined by ciliate bio-operations. Theor Comput Sci 320(1):51\u201369","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9502_CR7","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0304-3975(01)00096-2","volume":"270","author":"J Dassow","year":"2002","unstructured":"Dassow J, Mitrana V, Salomaa A (2002) Operations and language generating devices suggested by the genome evolution. Theor Comput Sci 270(1):701\u2013738","journal-title":"Theor Comput Sci"},{"key":"9502_CR8","unstructured":"Deaton R, Garzon M, Murphy RC, Rose JA, Franceschetti DR, Stevens SE Jr (1996) Genetic search of reliable encodings for DNA-based computation. In: Proceedings of the 1st annual conference on genetic programming, pp 9\u201315"},{"key":"9502_CR9","unstructured":"Garzon M, Deaton R, Nino LF, Stevens E, Wittner M (1998) Encoding genomes for DNA computing. In: Proceedings of the 3rd annual conference on genetic programming, pp 684\u2013690"},{"key":"9502_CR10","volume-title":"Algebraic and automata-theoretic properties of formal languages","author":"S Ginsburg","year":"1975","unstructured":"Ginsburg S (1975) Algebraic and automata-theoretic properties of formal languages. North-Holland Publishing Company, Amsterdam"},{"key":"9502_CR11","volume-title":"Introduction to automata theory, languages, and computation","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft J, Ullman J (1979) Introduction to automata theory, languages, and computation, 2nd edn. Addison-Wesley, Reading","edition":"2"},{"issue":"3","key":"9502_CR12","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1016\/S0304-3975(02)00069-5","volume":"290","author":"S Hussini","year":"2003","unstructured":"Hussini S, Kari L, Konstantinidis S (2003) Coding properties of DNA languages. Theor Comput Sci 290(3):1557\u20131579","journal-title":"Theor Comput Sci"},{"key":"9502_CR13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra OH (1978) Reversal bounded multicounter machines and their decision problems. J ACM 25:116\u2013133","journal-title":"J ACM"},{"key":"9502_CR14","doi-asserted-by":"crossref","unstructured":"Ibarra OH (2014) On decidability and closure properties of language classes with respect to bio-operations. In: Proceedings of 20th DNA computing and molecular programming, pp 148\u2013160","DOI":"10.1007\/978-3-319-11295-4_10"},{"issue":"1,2","key":"9502_CR15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FUN-2008-861-207","volume":"86","author":"N Jonoska","year":"2008","unstructured":"Jonoska N, Kari L, Mahalingam K (2008) Involution solid and join codes. Fundam Inform 86(1,2):127\u2013142","journal-title":"Fundam Inform"},{"issue":"2","key":"9502_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11047-004-4009-9","volume":"4","author":"N Jonoska","year":"2005","unstructured":"Jonoska N, Mahalingam K, Chen J (2005) Involution codes: with application to DNA coded languages. Nat Comput 4(2):141\u2013162","journal-title":"Nat Comput"},{"key":"9502_CR17","doi-asserted-by":"crossref","unstructured":"J\u00fcrgensen H, Konstantinidis S (1997) Codes. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol I, pp 511\u2013607. Springer","DOI":"10.1007\/978-3-642-59136-5_8"},{"issue":"4","key":"9502_CR18","doi-asserted-by":"crossref","first-page":"453","DOI":"10.3233\/FUN-2006-71405","volume":"71","author":"L Kari","year":"2006","unstructured":"Kari L, Losseva E, Konstantinidis S, Sos\u00edk P, Thierrin G (2006) A formal language analysis of DNA hairpin structures. Fundam Inform 71(4):453\u2013475","journal-title":"Fundam Inform"},{"key":"9502_CR19","doi-asserted-by":"crossref","unstructured":"Kari L, Mahalingam K (2006) DNA codes and their properties. In: Proceedings of the 12th international meeting on DNA computing, pp 127\u2013142","DOI":"10.1007\/11925903_10"},{"issue":"4","key":"9502_CR20","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"EL Post","year":"1946","unstructured":"Post EL (1946) A variant of a recursively unsolvable problem. Bull Am Math Soc 52(4):264\u2013268","journal-title":"Bull Am Math Soc"},{"key":"9502_CR21","volume-title":"Formal languages","author":"A Salomaa","year":"1973","unstructured":"Salomaa A (1973) Formal languages. Academic Press, Waltham"},{"issue":"4","key":"9502_CR22","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF02459633","volume":"54","author":"M Sch\u00f6niger","year":"1992","unstructured":"Sch\u00f6niger M, Waterman MS (1992) A local algorithm for DNA sequence alignment with inversions. Bul Math Biol 54(4):521\u2013536","journal-title":"Bul Math Biol"},{"key":"9502_CR23","volume-title":"A second course in formal languages and automata theory","author":"J Shallit","year":"2009","unstructured":"Shallit J (2009) A second course in formal languages and automata theory. Cambridge University Press, Cambridge"},{"key":"9502_CR24","volume-title":"Theory of computation","author":"D Wood","year":"1986","unstructured":"Wood D (1986) Theory of computation. Harper & Row, New York"},{"key":"9502_CR25","doi-asserted-by":"crossref","unstructured":"Yokomori T, Kobayashi S (1995) DNA evolutionary linguistics and RNA structure modeling: a computational approach. In: Proceedings of the 1st intelligence in neural and biological systems, pp 38\u201345. IEEE Computer Society","DOI":"10.1109\/INBS.1995.404281"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9502-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9502-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9502-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:52:16Z","timestamp":1748393536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9502-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,19]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9502"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9502-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2015,5,19]]}}}