{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:26:11Z","timestamp":1775017571587,"version":"3.50.1"},"reference-count":11,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1134\/s0032946022020028","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T05:20:17Z","timestamp":1657603217000},"page":"111-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications"],"prefix":"10.1134","volume":"58","author":[{"given":"M.","family":"Kova\u010devi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"issue":"8","key":"5046_CR1","doi-asserted-by":"publisher","first-page":"4996","DOI":"10.1109\/TIT.2017.2688361","volume":"63","author":"S Jain","year":"2017","unstructured":"Jain, S., Farnoud, F., Schwartz, M., and Bruck, J., Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms, IEEE Trans. Inform. Theory, 2017, vol.\u00a063, no.\u00a08, pp.\u00a04996\u2060\u2013\u20605010. https:\/\/doi.org\/10.1109\/TIT.2017.2688361","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"5046_CR2","doi-asserted-by":"publisher","first-page":"2194","DOI":"10.1109\/LCOMM.2018.2868666","volume":"22","author":"M Kova\u010devi\u0107","year":"2018","unstructured":"Kova\u010devi\u0107, M. and Tan, V.Y.F., Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems, IEEE Commun. Lett., 2018, vol.\u00a022, no.\u00a011, pp.\u00a02194\u2060\u2013\u20602197. https:\/\/doi.org\/10.1109\/LCOMM.2018.2868666","journal-title":"IEEE Commun. Lett"},{"key":"5046_CR3","doi-asserted-by":"crossref","unstructured":"Lenz, A., J\u00fcnger, N., and Wachter-Zeh, A., Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes, https:\/\/arXiv.org\/abs\/1807.02874v3 [cs.IT], 2018.","DOI":"10.1007\/s10623-018-0523-0"},{"issue":"10","key":"5046_CR4","doi-asserted-by":"publisher","first-page":"6735","DOI":"10.1109\/TCOMM.2019.2931342","volume":"67","author":"M Kova\u010devi\u0107","year":"2019","unstructured":"Kova\u010devi\u0107, M., Zero-Error Capacity of Duplication Channels, IEEE Trans. Commun., 2019, vol.\u00a067, no.\u00a010, pp.\u00a06735\u2060\u2013\u20606742. https:\/\/doi.org\/10.1109\/TCOMM.2019.2931342","journal-title":"IEEE Trans. Commun"},{"issue":"8","key":"5046_CR5","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1109\/TIT.2020.2981069","volume":"66","author":"YM Chee","year":"2020","unstructured":"Chee, Y.M., Chrisnata, J., Kiah, H.M., and Nguyen, T.T., Efficient Encoding\/Decoding of GC-Balanced Codes Correcting Tandem Duplications, IEEE Trans. Inform. Theory, 2020, vol.\u00a066, no.\u00a08, pp.\u00a04892\u2060\u2013\u20604903. https:\/\/doi.org\/10.1109\/TIT.2020.2981069","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5046_CR6","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1109\/TIT.2015.2505735","volume":"62","author":"F Farnoud","year":"2016","unstructured":"Farnoud, F., Schwartz, M., and Bruck, J., The Capacity of String-Duplication Systems, IEEE Trans. Inform. Theory, 2016, vol.\u00a062, no.\u00a02, pp.\u00a0811\u2060\u2013\u2060824. https:\/\/doi.org\/10.1109\/TIT.2015.2505735","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"5046_CR7","doi-asserted-by":"publisher","first-page":"6129","DOI":"10.1109\/TIT.2017.2728079","volume":"63","author":"S Jain","year":"2017","unstructured":"Jain, S., Farnoud, F., and Bruck, J., Capacity and Expressiveness of Genomic Tandem Duplication, IEEE Trans. Inform. Theory, 2017, vol.\u00a063, no.\u00a010, pp.\u00a06129\u2060\u2013\u20606138. https:\/\/doi.org\/10.1109\/TIT.2017.2728079","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5046_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.dam.2004.10.003","volume":"146","author":"P Leupold","year":"2005","unstructured":"Leupold, P., Mart\u00edn-Vide, C., and Mitrana, V., Uniformly Bounded Duplication Languages, Discrete Appl. Math., 2005, vol.\u00a0146, no.\u00a03, pp.\u00a0301\u2060\u2013\u2060310. https:\/\/doi.org\/10.1016\/j.dam.2004.10.003","journal-title":"Discrete Appl. Math"},{"issue":"3","key":"5046_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"2","author":"CE Shannon","year":"1956","unstructured":"Shannon, C.E., The Zero Error Capacity of a Noisy Channel, IRE Trans. Inform. Theory, 1956, vol.\u00a02, no.\u00a03, pp.\u00a08\u2060\u2013\u206019. https:\/\/doi.org\/10.1109\/TIT.1956.1056798","journal-title":"IRE Trans. Inform. Theory"},{"key":"5046_CR10","unstructured":"Marcus, B.H., Roth, R.M., and Siegel, P.H., An Introduction to Coding for Constrained Systems (unpublished manuscript), 5th ed., 2001. Available online at http:\/\/www.math.ubc.ca\/~marcus\/Handbook."},{"issue":"3","key":"5046_CR11","doi-asserted-by":"publisher","DOI":"10.1145\/3338514","volume":"15","author":"YM Chee","year":"2019","unstructured":"Chee, Y.M., Chrisnata, J., Kiah, H.M., and Nguyen, T.T., Deciding the Confusability of Words under Tandem Repeats in Linear Time, ACM Trans. Algorithms, 2019, vol.\u00a015, no.\u00a03, Art. 42 (22\u00a0pp.). https:\/\/doi.org\/10.1145\/3338514","journal-title":"ACM Trans. Algorithms"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022020028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946022020028","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022020028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:46:29Z","timestamp":1775011589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946022020028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["5046"],"URL":"https:\/\/doi.org\/10.1134\/s0032946022020028","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292322020028","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"4 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}