{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:02Z","timestamp":1746295802057,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319081229"},{"type":"electronic","value":"9783319081236"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08123-6_8","type":"book-chapter","created":{"date-parts":[[2014,7,7]],"date-time":"2014-07-07T13:08:12Z","timestamp":1404738492000},"page":"93-104","source":"Crossref","is-referenced-by-count":3,"title":["Pseudo-inversion on Formal Languages"],"prefix":"10.1007","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","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","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.: Efficient string-matching allowing for non-overlapping inversions. Theoretical Computer Science\u00a0483, 85\u201395 (2013)","journal-title":"Theoretical Computer Science"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2012.04.002","volume":"454","author":"E. Chiniforooshan","year":"2012","unstructured":"Chiniforooshan, E., Daley, M., Ibarra, O.H., Kari, L., Seki, S.: One-reversal counter machines and multihead automata: Revisited. Theoretical Computer Science\u00a0454, 81\u201387 (2012)","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-04657-0_25","volume-title":"Algorithms and Computation","author":"D.-J. Cho","year":"2014","unstructured":"Cho, D.-J., Han, Y.-S., Kim, H.: Alignment with non-overlapping inversions on two strings. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol.\u00a08344, pp. 261\u2013272. Springer, Heidelberg (2014)"},{"issue":"1-3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","volume":"306","author":"M. Daley","year":"2003","unstructured":"Daley, M., Ibarra, O.H., Kari, L.: Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theoretical Computer Science\u00a0306(1-3), 19\u201338 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","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.: Families of languages defined by ciliate bio-operations. Theoretical Computer Science\u00a0320(1), 51\u201369 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","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.: Operations and language generating devices suggested by the genome evolution. Theoretical Computer Science\u00a0270(1), 701\u2013738 (2002)","journal-title":"Theoretical Computer Science"},{"unstructured":"Deaton, R., Garzon, M., Murphy, R.C., Rose, J.A., Franceschetti, D.R., Stevens Jr., S.E.: Genetic search of reliable encodings for DNA-based computation. In: First Conference on Genetic Programming, pp. 9\u201315 (1996)","key":"8_CR7"},{"unstructured":"Garzon, M., Deaton, R., Nino, L.F., Stevens, E., Wittner, M.: Encoding genomes for DNA computing. In: Proceedings of the Third Annual Conference on Genetic Programming 1998, pp. 684\u2013690 (1998)","key":"8_CR8"},{"unstructured":"Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages. North-Holland Publishing Company (1975)","key":"8_CR9"},{"key":"8_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (1979)","edition":"2"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","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.: Coding properties of DNA languages. Theoretical Computer Science\u00a0290(3), 1557\u20131579 (2003)","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal bounded multicounter machines and their decision problems. Journal of the ACM\u00a025, 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"8_CR13","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.: Involution solid and join codes. Fundamenta Informaticae\u00a086(1-2), 127\u2013142 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11047-004-4009-9","volume":"4","author":"N. Jonoska","year":"2005","unstructured":"Jonoska, N., Mahalingam, K., Chen, J.: Involution codes: With application to DNA coded languages. Natural Computing\u00a04(2), 141\u2013162 (2005)","journal-title":"Natural Computing"},{"doi-asserted-by":"crossref","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Handbook of Formal Languages. I, pp. 511\u2013607. Springer (1997)","key":"8_CR15","DOI":"10.1007\/978-3-642-59136-5_8"},{"issue":"4","key":"8_CR16","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.: A formal language analysis of DNA hairpin structures. Fundamenta Informaticae\u00a071(4), 453\u2013475 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11925903_10","volume-title":"DNA Computing","author":"L. Kari","year":"2006","unstructured":"Kari, L., Mahalingam, K.: DNA codes and their properties. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol.\u00a04287, pp. 127\u2013142. Springer, Heidelberg (2006)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0029799","volume-title":"Combinatorial Pattern Matching","author":"J. Kececioglu","year":"1993","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for the inversion distance between two chromosomes. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 87\u2013105. Springer, Heidelberg (1993)"},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E.L. Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society\u00a052(4), 264\u2013268 (1946)","journal-title":"Bulletin of the American Mathematical Society"},{"unstructured":"Salomaa, A.: Formal Languages. Academic Press (1973)","key":"8_CR20"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF02459633","volume":"54","author":"M. Schniger","year":"1992","unstructured":"Schniger, M., Waterman, M.S.: A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology\u00a054(4), 521\u2013536 (1992)","journal-title":"Bulletin of Mathematical Biology"},{"doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2009)","key":"8_CR22","DOI":"10.1017\/CBO9780511808876"},{"key":"8_CR23","series-title":"LNBI","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11851561_18","volume-title":"Algorithms in Bioinformatics","author":"A.F. Vellozo","year":"2006","unstructured":"Vellozo, A.F., Alves, C.E.R., do Lago, A.P.: Alignment with non-overlapping inversions in O(n 3)-time. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 186\u2013196. Springer, Heidelberg (2006)"},{"unstructured":"Wood, D.: Theory of Computation. Harper & Row (1986)","key":"8_CR24"},{"doi-asserted-by":"crossref","unstructured":"Yokomori, T., Kobayashi, S.: 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 (1995)","key":"8_CR25","DOI":"10.1109\/INBS.1995.404281"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08123-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:57:51Z","timestamp":1746295071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08123-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319081229","9783319081236"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08123-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}