{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:46Z","timestamp":1742913166464,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031721991"},{"type":"electronic","value":"9783031722004"}],"license":[{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-72200-4_23","type":"book-chapter","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:01:50Z","timestamp":1726686110000},"page":"306-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["2d Side-Sharing Tandems with\u00a0Mismatches"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6692-1693","authenticated-orcid":false,"given":"Shoshana","family":"Marcus","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2478-2636","authenticated-orcid":false,"given":"Dina","family":"Sokol","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8563-3427","authenticated-orcid":false,"given":"Sarah","family":"Zelikovitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P.: Algebraic combinatorics on words: by Lothaire ISBN: 0-521-81220-8. Semigroup Forum 70(1), 154\u2013155 (2005)","DOI":"10.1007\/s00233-004-0146-9"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s00453-022-01016-9","volume":"85","author":"A Amir","year":"2023","unstructured":"Amir, A., Butman, A., Landau, G.M., Marcus, S., Sokol, D.: Double string tandem repeats. Algorithmica 85(1), 170\u2013187 (2023). https:\/\/doi.org\/10.1007\/s00453-022-01016-9","journal-title":"Algorithmica"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Amit, M., Crochemore, M., Landau, G.M.: Locating all maximal approximate runs in a string. In: Fischer, J., Sanders, P. (eds.) Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a07922, pp. 13\u201327. Springer (2013https:\/\/doi.org\/10.1007\/978-3-642-38905-4_4, https:\/\/doi.org\/10.1007\/978-3-642-38905-4_4","DOI":"10.1007\/978-3-642-38905-4_4"},{"key":"23_CR4","doi-asserted-by":"publisher","unstructured":"Amit, M., Crochemore, M., Landau, G.M., Sokol, D.: Locating maximal approximate runs in a string. Theor. Comput. Sci. 700, 45\u201362 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.07.021","DOI":"10.1016\/j.tcs.2017.07.021"},{"issue":"1\u20132","key":"23_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(98)00182-0","volume":"237","author":"A Apostolico","year":"2000","unstructured":"Apostolico, A., Brimkov, V.E.: Fibonacci arrays and their two-dimensional repetitions. Theoret. Comput. Sci. 237(1\u20132), 263\u2013273 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00182-0","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"23_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.dam.2005.02.019","volume":"151","author":"A Apostolico","year":"2005","unstructured":"Apostolico, A., Brimkov, V.E.: Optimal discovery of repetitions in 2d. Discret. Appl. Math. 151(1\u20133), 5\u201320 (2005). https:\/\/doi.org\/10.1016\/j.dam.2005.02.019","journal-title":"Discret. Appl. Math."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Bland, W., Smyth, W.F.: Three overlapping squares: the general case characterized and applications. Theor. Comput. Sci. 596, 23\u201340 (2015). https:\/\/doi.org\/10.1016\/J.TCS.2015.06.037","DOI":"10.1016\/J.TCS.2015.06.037"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Radoszewski, J., Rytter, W., Walen, T., Zuba, W.: The number of repetitions in 2d-strings. In: Grandoni, F., Herman, G., Sanders, P. (eds.) 28th Annual European Symposium on Algorithms, ESA 2020, 7\u20139 September 2020, Pisa (Virtual Conference). LIPIcs, vol.\u00a0173, pp. 32:1\u201332:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.32","DOI":"10.4230\/LIPIcs.ESA.2020.32"},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett. 12(5), 244\u2013250 (1981)","journal-title":"Inf. Process. Lett."},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Deza, A., Franek, F., Jiang, M.: A computational substantiation of the d-step approach to the number of distinct squares problem. Discret. Appl. Math. 212, 81\u201387 (2016). https:\/\/doi.org\/10.1016\/J.DAM.2016.04.025","DOI":"10.1016\/J.DAM.2016.04.025"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/8307.8309","volume":"17","author":"Z Galil","year":"1986","unstructured":"Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News 17(4), 52\u201354 (1986). https:\/\/doi.org\/10.1145\/8307.8309","journal-title":"SIGACT News"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Ghazawi, S., Landau, G.M.: Lower bounds for the number of repetitions in 2d strings. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 179\u2013192. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_15","DOI":"10.1007\/978-3-030-86692-1_15"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, 17\u201318 October, 1999, New York, pp. 596\u2013604. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814634","DOI":"10.1109\/SFFCS.1999.814634"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"303","author":"RM Kolpakov","year":"2003","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 303(1), 135\u2013156 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00448-6","journal-title":"Theor. Comput. Sci."},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Kucherov, G., Sokol, D.: Approximate tandem repeats. In: Encyclopedia of Algorithms, pp. 106\u2013109. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_24","DOI":"10.1007\/978-1-4939-2864-4_24"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"GM Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. J. Comput. Biol. 8(1), 1\u201318 (2001). https:\/\/doi.org\/10.1089\/106652701300099038","journal-title":"J. Comput. Biol."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"MG Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An O(n log n) algorithm for finding all repetitions in a string. J. Algorithms 5(3), 422\u2013432 (1984). https:\/\/doi.org\/10.1016\/0196-6774(84)90021-X","journal-title":"J. Algorithms"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Marcus, S., Sokol, D., Zelikovitz, S.: Runs of side-sharing tandems in rectangular arrays. In: Pedreira, O., Estivill-Castro, V. (eds.) SISAP 2023. LNCS, vol. 14289, pp. 88\u2013102. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-46994-7_8","DOI":"10.1007\/978-3-031-46994-7_8"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13, 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Sagot, M., Myers, E.W.: Identifying satellites in nucleic acid sequences. In: Istrail, S., Pevzner, P.A., Waterman, M.S. (eds.) Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, RECOMB 1998, New York, 22\u201325 March 1998, pp. 234\u2013242. ACM (1998). https:\/\/doi.org\/10.1145\/279069.279120","DOI":"10.1145\/279069.279120"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/BIOINFORMATICS\/BTL309","volume":"23","author":"D Sokol","year":"2007","unstructured":"Sokol, D., Benson, G., Tojeira, J.: Tandem repeats over the edit distance. Bioinformatics 23(2), 30\u201335 (2007). https:\/\/doi.org\/10.1093\/BIOINFORMATICS\/BTL309","journal-title":"Bioinformatics"},{"issue":"3","key":"23_CR22","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). https:\/\/doi.org\/10.1109\/TIT.1977.1055714","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"23_CR23","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055934","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72200-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:03:11Z","timestamp":1726686191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72200-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,19]]},"ISBN":["9783031721991","9783031722004"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72200-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,9,19]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Vallarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/computo.fismat.umich.mx\/spire2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}