{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:20:52Z","timestamp":1760710852924,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T00:00:00Z","timestamp":1644796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T00:00:00Z","timestamp":1644796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1475\/18"],"award-info":[{"award-number":["1475\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2018141"],"award-info":[{"award-number":["2018141"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00453-022-00926-y","type":"journal-article","created":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T06:02:28Z","timestamp":1644818548000},"page":"1490-1510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multidimensional Period Recovery"],"prefix":"10.1007","volume":"84","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Ayelet","family":"Butman","sequence":"additional","affiliation":[]},{"given":"Eitan","family":"Kondratovsky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1686-0094","authenticated-orcid":false,"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Dina","family":"Sokol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,14]]},"reference":[{"key":"926_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2017.10.026","volume":"710","author":"A Amir","year":"2018","unstructured":"Amir, A., Amit, M., Landau, G.M., Sokol, D.: Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710, 2\u201318 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"926_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/S0097539795298321","volume":"27","author":"A Amir","year":"1998","unstructured":"Amir, A., Benson, G.: Two-dimensional periodicity in rectangular arrays. SIAM J. Comput. 27(1), 90\u2013106 (1998)","journal-title":"SIAM J. Comput."},{"key":"926_CR3","doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G., Farach, M.: Optimal parallel two dimensional pattern matching. In: Snyder, L. (ed.) Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA \u201993, Velen, Germany, June 30\u2013July 2, 1993, pp. 79\u201385. ACM (1993)","DOI":"10.1145\/165231.165242"},{"issue":"1","key":"926_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2705","volume":"144","author":"A Amir","year":"1998","unstructured":"Amir, A., Benson, G., Farach, M.: Optimal parallel two dimensional text searching on a CREW PRAM. Inf. Comput. 144(1), 1\u201317 (1998)","journal-title":"Inf. Comput."},{"key":"926_CR5","unstructured":"Amir, A., Boneh, I.: Dynamic palindrome detection (2019). CoRR arXiv:1906.09732"},{"key":"926_CR6","unstructured":"Amir, A., Boneh, I., Charalampopoulos, P., Kondratovsky, E.: Repetition detection in a dynamic string. In: European Symposium on Algorithms ESA, Volume 144 of LIPIcs, pp. 5:1\u20135:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"926_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ic.2015.02.004","volume":"241","author":"A Amir","year":"2015","unstructured":"Amir, A., Eisenberg, E., Levy, A.: Approximate periodicity. Inf. Comput. 241, 215\u2013226 (2015)","journal-title":"Inf. Comput."},{"issue":"1","key":"926_CR8","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2390176.2390189","volume":"9","author":"A Amir","year":"2012","unstructured":"Amir, A., Eisenberg, E., Levy, A., Porat, E., Shapira, N.: Cycle detection and correction. ACM Trans. Algorithms 9(1), 13:1-13:20 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"926_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2019.07.006","volume":"812","author":"A Amir","year":"2020","unstructured":"Amir, A., Landau, G.M., Marcus, S., Sokol, D.: Two-dimensional maximal repetitions. Theor. Comput. Sci. 812, 49\u201361 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"926_CR10","doi-asserted-by":"publisher","first-page":"2857","DOI":"10.1007\/s00453-019-00559-8","volume":"81","author":"A Amir","year":"2019","unstructured":"Amir, A., Levy, A., Lewenstein, M., Lubin, R., Porat, B.: Can we recover the cover? Algorithmica 81(7), 2857\u20132875 (2019)","journal-title":"Algorithmica"},{"key":"926_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2019.05.020","volume":"793","author":"A Amir","year":"2019","unstructured":"Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. Theor. Comput. Sci. 793, 59\u201369 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"926_CR12","doi-asserted-by":"crossref","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\u201319, 2013. Proceedings, Volume 7922 of Lecture Notes in Computer Science, pp. 13\u201327. Springer (2013)","DOI":"10.1007\/978-3-642-38905-4_4"},{"issue":"1\u20132","key":"926_CR13","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. Theor. Comput. Sci. 237(1\u20132), 263\u2013273 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"926_CR14","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Appl. Math. 156(9):1389\u20131398 (2008). General Theory of Information Transfer and Combinatorics","DOI":"10.1016\/j.dam.2006.11.017"},{"key":"926_CR15","unstructured":"Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem (2015). CoRR, arXiv:1406.0263v7"},{"key":"926_CR16","doi-asserted-by":"crossref","unstructured":"Boyer, R.S., Moore, J.S.: MJRTY: a fast majority vote algorithm. In: Boyer, R.S. (ed.) Automated Reasoning: Essays in Honor of Woody Bledsoe, Automated Reasoning Series, pp. 105\u2013118. Kluwer Academic Publishers (1991)","DOI":"10.1007\/978-94-011-3488-0_5"},{"key":"926_CR17","doi-asserted-by":"crossref","unstructured":"Cole, R., Crochemore, M., Galil, Z., Gasieniec, L., Hariharan, R., Muthukrishnan, S., Park, K., Rytter, W.: Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3\u20135 November 1993, pp. 248\u2013258. IEEE Computer Society (1993)","DOI":"10.1109\/SFCS.1993.366862"},{"key":"926_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2013.11.018","volume":"521","author":"M Crochemore","year":"2014","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521, 29\u201341 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"926_CR19","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."},{"issue":"3","key":"926_CR20","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/S0097539795280068","volume":"27","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Gasieniec, L., Hariharan, R., Muthukrishnan, S., Rytter, W.: A constant time optimal parallel algorithm for two-dimensional pattern matching. SIAM J. Comput. 27(3), 668\u2013681 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"926_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(91)90073-B","volume":"88","author":"M Crochemore","year":"1991","unstructured":"Crochemore, M., Rytter, W.: Usefulness of the Karp\u2013Miller\u2013Rosenberg algorithm in parallel computations on strings and arrays. Theor. Comput. Sci. 88(1), 59\u201382 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"926_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16(1), 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1\u20133","key":"926_CR23","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"Z Galil","year":"1985","unstructured":"Galil, Z.: Optimal parallel algorithms for string matching. Inf. Control 67(1\u20133), 144\u2013157 (1985)","journal-title":"Inf. Control"},{"issue":"4","key":"926_CR24","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)","journal-title":"SIGACT News"},{"issue":"5","key":"926_CR25","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1137\/S0097539792241941","volume":"25","author":"Z Galil","year":"1996","unstructured":"Galil, Z., Park, K.: Alphabet-independent two-dimensional witness computation. SIAM J. Comput. 25(5), 907\u2013935 (1996)","journal-title":"SIAM J. Comput."},{"key":"926_CR26","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2016.09.011","volume":"118","author":"G Gamard","year":"2017","unstructured":"Gamard, G., Richomme, G., Shallit, J., Smith, T.J.: Periodicity in rectangular arrays. Inf. Process. Lett. 118, 58\u201363 (2017)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"926_CR27","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4), 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"926_CR28","unstructured":"Karp, R.M., Miller, R.E., Rosenberg, A.L.: Rapid identification of repeated patterns in strings, trees and arrays. In: Fischer, P.C., Zeiger, H.P., Ullman, J.D., Rosenberg, A.L. (eds.) Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1\u20133, 1972, Denver, Colorado, USA, pp. 125\u2013136. ACM (1972)"},{"key":"926_CR29","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Walen, T.: Internal pattern matching queries in a text and applications. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4\u20136, 2015, pp. 532\u2013551. SIAM (2015)"},{"key":"926_CR30","doi-asserted-by":"crossref","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 \u201999, 17\u201318 October, 1999, New York, NY, USA, pp. 596\u2013604. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"issue":"1","key":"926_CR31","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)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"926_CR32","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)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"926_CR33","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-015-0065-z","volume":"77","author":"S Marcus","year":"2017","unstructured":"Marcus, S., Sokol, D.: 2d Lyndon words and applications. Algorithmica 77(1), 116\u2013133 (2017)","journal-title":"Algorithmica"},{"key":"926_CR34","unstructured":"R\u00e9gnier, M., Rostami, L.: A unifying look at d-dimensional periodicities and space coverings. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2\u20134, 1993, Proceedings, Volume 684 of Lecture Notes in Computer Science, pp. 215\u2013227. Springer (1993)"},{"issue":"1","key":"926_CR35","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0304-3975(00)00365-0","volume":"262","author":"JS Sim","year":"2001","unstructured":"Sim, J.S., Iliopoulos, C.S., Park, K., Smyth, W.F.: Approximate periods of strings. Theor. Comput. Sci. 262(1), 557\u2013568 (2001)","journal-title":"Theor. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00926-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00926-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00926-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T13:19:25Z","timestamp":1726665565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00926-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,14]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["926"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00926-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,2,14]]},"assertion":[{"value":"16 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}