{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:32Z","timestamp":1759637792278,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T00:00:00Z","timestamp":1455753600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","award":["R2824A01"],"award-info":[{"award-number":["R2824A01"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00236-016-0258-1","type":"journal-article","created":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T10:10:28Z","timestamp":1455790228000},"page":"379-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Disjunctivity and other properties of sets of pseudo-bordered words"],"prefix":"10.1007","volume":"54","author":[{"given":"Lila","family":"Kari","sequence":"first","affiliation":[]},{"given":"Manasi S.","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,18]]},"reference":[{"key":"258_CR1","doi-asserted-by":"publisher","unstructured":"Blondin Mass\u00e9, A., Gaboury, S., Hall\u00e9, S.: Pseudoperiodic words. In: Yen, H.C., Ibarra, O. (eds.) Developments in Language Theory. Lecture Notes in Computer Science, vol. 7410, pp. 308\u2013319. Springer, Berlin Heidelberg (2012)","DOI":"10.1007\/978-3-642-31653-1_28"},{"issue":"8","key":"258_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/PL00013314","volume":"37","author":"A Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Periodic-like words, periodicity, and boxes. Acta Inf. 37(8), 597\u2013618 (2001)","journal-title":"Acta Inf."},{"key":"258_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2014.07.016","volume":"550","author":"DJ Cho","year":"2014","unstructured":"Cho, D.J., Han, Y.S., Ko, S.K.: Decidability of involution hypercodes. Theor. Comput. Sci. 550, 90\u201399 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"258_CR4","first-page":"167","volume":"89","author":"S Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for Abelian periods. Bull. EATCS 89, 167\u2013170 (2006)","journal-title":"Bull. EATCS"},{"key":"258_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"key":"258_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"258_CR7","first-page":"33","volume":"24","author":"LJ Cummings","year":"1997","unstructured":"Cummings, L.J., Smyth, W.F.: Weak repetitions in strings. J. Comb. Math. Comb. Comput. 24, 33\u201348 (1997)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"258_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.tcs.2009.09.037","volume":"411","author":"E Czeizler","year":"2010","unstructured":"Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. Theor. Comput. Sci. 411, 617\u2013630 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"13","key":"258_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.tcs.2006.07.009","volume":"362","author":"A Luca de","year":"2006","unstructured":"de Luca, A., De Luca, A.: Pseudopalindrome closure operators in free monoids. Theor. Comput. Sci. 362(13), 282\u2013300 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"258_CR10","first-page":"257","volume":"20","author":"P Gawrychowski","year":"2013","unstructured":"Gawrychowski, P., Manea, F., Merca\u015f, R., Nowotka, D., Tiseanu, C.: Finding pseudo-repetitions. Leibniz Int. Proc. Inf. 20, 257\u2013268 (2013)","journal-title":"Leibniz Int. Proc. Inf."},{"key":"258_CR11","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Manea, F., Nowotka, D.: Discovering hidden repetitions in words. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) The Nature of Computation. Logic, Algorithms, Applications. Lecture Notes in Computer Science, vol. 7921, pp. 210\u2013219. Springer, Berlin Heidelberg (2013)","DOI":"10.1007\/978-3-642-39053-1_24"},{"key":"258_CR12","unstructured":"Gawrychowski, P., Manea, F., Nowotka, D.: Testing generalised freeness of words. In: Mayr, E.W., Portier, N. (eds.) 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol. 25, pp. 337\u2013349. Schloss Dagstuhl\u2013Leibniz\u2013Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2014)"},{"key":"258_CR13","volume-title":"Formal Languages and Their Relation to Automata","author":"JE Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal Languages and Their Relation to Automata. Addison-Wesley Longman Publishing Co. Inc, Boston (1969)"},{"issue":"1","key":"258_CR14","first-page":"29","volume":"15","author":"S Hsu","year":"1989","unstructured":"Hsu, S., Ito, M., Shyr, H.: Some properties of overlapping order and related languages. Soochow J. Math. 15(1), 29\u201345 (1989)","journal-title":"Soochow J. Math."},{"issue":"2","key":"258_CR15","first-page":"371","volume":"31","author":"C Huang","year":"2010","unstructured":"Huang, C., Hsiao, P.C., Liau, C.J.: A note of involutively bordered words. J. Inf. Opt. Sci. 31(2), 371\u2013386 (2010)","journal-title":"J. Inf. Opt. Sci."},{"key":"258_CR16","doi-asserted-by":"publisher","unstructured":"Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. In: Jonoska, N., Seeman, N. (Eds.) Proceedings of DNA7. Lecture Notes in Computer Science, vol. 2340, pp. 57\u201369. Springer (2002)","DOI":"10.1007\/3-540-48017-X_6"},{"key":"258_CR17","unstructured":"Jonoska, N., Kephart, D., Mahalingam, K.: Generating DNA code words. Congr. Numerantium. 156, 99\u2013110 (2002)"},{"key":"258_CR18","first-page":"207","volume-title":"Discrete Mathematics and Computer Science","author":"L Kari","year":"2014","unstructured":"Kari, L., Kulkarni, M.S.: Pseudo-identities and bordered words. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Discrete Mathematics and Computer Science, pp. 207\u2013222. Editura Academiei Rom\u00e2ne, Romania (2014)"},{"issue":"05","key":"258_CR19","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1142\/S0129054107005145","volume":"18","author":"L Kari","year":"2007","unstructured":"Kari, L., Mahalingam, K.: Involutively bordered words. Int. J. Found. Comput. Sci. 18(05), 1089\u20131106 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"258_CR20","doi-asserted-by":"publisher","unstructured":"Kari, L., Mahalingam, K.: Watson\u2013Crick conjugate and commutative words. In: Garzon, M., Yan, H. (eds.) DNA Computing. Lecture Notes in Computer Science, vol. 4848, pp. 273\u2013283. Springer, Berlin Heidelberg (2008)","DOI":"10.1007\/978-3-540-77962-9_29"},{"issue":"2","key":"258_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11047-009-9131-2","volume":"9","author":"L Kari","year":"2010","unstructured":"Kari, L., Mahalingam, K.: Watson\u2013Crick palindromes in DNA computing. Natural Comput. 9(2), 297\u2013316 (2010)","journal-title":"Natural Comput."},{"key":"258_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jcss.2008.08.002","volume":"75","author":"L Kari","year":"2009","unstructured":"Kari, L., Seki, S.: On pseudoknot-bordered words and their properties. J. Comput. Syst. Sci. 75, 113\u2013121 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"258_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.3233\/FI-2010-285","volume":"101","author":"L Kari","year":"2010","unstructured":"Kari, L., Seki, S.: An improved bound for an extension of Fine and Wilf\u2019s theorem and its optimality. Fundam. Inf. 101, 215\u2013236 (2010)","journal-title":"Fundam. Inf."},{"key":"258_CR24","unstructured":"Kopecki, S.: Personal communication (2015)"},{"key":"258_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"258_CR26","doi-asserted-by":"publisher","unstructured":"Shyr, H., Thierrin, G.: Disjunctive languages and codes. In: Karpinski, M. (ed.) Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 56, pp. 171\u2013176. Springer, Berlin Heidelberg (1977)","DOI":"10.1007\/3-540-08442-8_83"},{"key":"258_CR27","unstructured":"Shyr, H.J.: Free Monoids and Languages. Department of Mathematics, Soochow University, Taipei, Taiwan (1979)"},{"key":"258_CR28","volume-title":"Introduction to Cryptography with Coding Theory","author":"W Trappe","year":"2006","unstructured":"Trappe, W., Washington, L.C.: Introduction to Cryptography with Coding Theory. Pearson Education India, New Delhi (2006)"},{"issue":"4356","key":"258_CR29","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1038\/171737a0","volume":"171","author":"JD Watson","year":"1953","unstructured":"Watson, J.D., Crick, F.H.: Molecular structure of nucleic acids. Nature 171(4356), 737\u2013738 (1953)","journal-title":"Nature"},{"key":"258_CR30","unstructured":"Wong, F.R.: Algebraic Properties of d-Primitive Words. Master\u2019s thesis. Chuang-Yuan Christian University, Chuang Li, Taiwan (1994)"},{"issue":"13","key":"258_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0166-218X(98)00105-X","volume":"89","author":"S Yu","year":"1998","unstructured":"Yu, S.: d-Minimal languages. Disc. Appl. Math. 89(13), 243\u2013262 (1998)","journal-title":"Disc. Appl. Math."},{"key":"258_CR32","volume-title":"Languages and Codes","author":"SS Yu","year":"2005","unstructured":"Yu, S.S.: Languages and Codes. Tsang Hai Book Publishing Co., Taichung (2005)"},{"issue":"3","key":"258_CR33","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0258-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-016-0258-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0258-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0258-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T17:22:04Z","timestamp":1600190524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-016-0258-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,18]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["258"],"URL":"https:\/\/doi.org\/10.1007\/s00236-016-0258-1","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2016,2,18]]}}}