{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:15:57Z","timestamp":1742962557901,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592110"},{"type":"electronic","value":"9783030592127"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59212-7_9","type":"book-chapter","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:05:34Z","timestamp":1600250734000},"page":"115-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multidimensional Period Recovery"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Ayelet","family":"Butman","sequence":"additional","affiliation":[]},{"given":"Eitan","family":"Kondratovsky","sequence":"additional","affiliation":[]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Dina","family":"Sokol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"key":"9_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":"9_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":"9_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 1993, Velen, Germany, 30 June\u20132 July 1993, pp. 79\u201385. ACM (1993)","DOI":"10.1145\/165231.165242"},{"issue":"1","key":"9_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":"9_CR5","unstructured":"Amir, A., Boneh, I.: Dynamic palindrome detection. CoRR, abs\/1906.09732 (2019)"},{"key":"9_CR6","unstructured":"Amir, A., Boneh, I., Charalampopoulos, P., Kondratovsky, E.: Repetition detection in a dynamic string. In: ESA, LIPIcs, vol. 144, pp. 5:1\u20135:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"9_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":"9_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\u201313:20 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2019.07.006","volume":"812","author":"A Amir","year":"2019","unstructured":"Amir, A., Landau, G.M., Marcus, S., Sokol, D.: Two-dimensional maximal repetitions. Theoret. Comput. Sci. 812, 49\u201361 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-38905-4_4","volume-title":"Combinatorial Pattern Matching","author":"M Amit","year":"2013","unstructured":"Amit, M., Crochemore, M., Landau, G.M.: Locating all maximal approximate runs in a string. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 13\u201327. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38905-4_4"},{"issue":"1\u20132","key":"9_CR11","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."},{"issue":"9","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/j.dam.2006.11.017","volume":"156","author":"A Apostolico","year":"2008","unstructured":"Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discret. Appl. Math. 156(9), 1389\u20131398 (2008). General Theory of Information Transfer and Combinatorics","journal-title":"Discret. Appl. Math."},{"key":"9_CR13","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":"9_CR14","unstructured":"Cole, R., et al.: 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)"},{"issue":"5","key":"9_CR15","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":"9_CR16","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":"9_CR17","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-Miller-Rosenberg algorithm in parallel computations on strings and arrays. Theoret. Comput. Sci. 88(1), 59\u201382 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"9_CR18","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":"9_CR19","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":"9_CR20","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":"9_CR21","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":"9_CR22","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":"9_CR23","doi-asserted-by":"crossref","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. (ed.) Proceedings of the 4th Annual ACM Symposium on Theory of Computing, Denver, Colorado, USA, 1\u20133 May 1972, pp. 125\u2013136. ACM (1972)","DOI":"10.1145\/800152.804905"},{"key":"9_CR24","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, 4\u20136 January 2015, pp. 532\u2013551. SIAM (2015)"},{"key":"9_CR25","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, New York, NY, USA, 17\u201318 October 1999, pp. 596\u2013604. IEEE Computer Society (1999)"},{"issue":"1","key":"9_CR26","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":"9_CR27","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":"9_CR28","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). https:\/\/doi.org\/10.1007\/s00453-015-0065-z","journal-title":"Algorithmica"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BFb0029807","volume-title":"Combinatorial Pattern Matching","author":"M R\u00e9gnier","year":"1993","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.) CPM 1993. LNCS, vol. 684, pp. 215\u2013227. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BFb0029807"},{"issue":"1","key":"9_CR30","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. Theoret. Comput. Sci. 262(1), 557\u2013568 (2001)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59212-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T22:19:52Z","timestamp":1723587592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59212-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592110","9783030592127"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59212-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Orlando, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ucf.edu\/spire2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}