{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:23:16Z","timestamp":1743085396540,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031469930"},{"type":"electronic","value":"9783031469947"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46994-7_8","type":"book-chapter","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:02:16Z","timestamp":1698303736000},"page":"88-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Runs of\u00a0Side-Sharing Tandems in\u00a0Rectangular Arrays"],"prefix":"10.1007","author":[{"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":[]},{"given":"Sarah","family":"Zelikovitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Allouche, J.P.: Algebraic combinatorics on words. Semigroup Forum 70, 154\u2013155 (2005). https:\/\/doi.org\/10.1007\/s00233-004-0146-9","DOI":"10.1007\/s00233-004-0146-9"},{"key":"8_CR2","doi-asserted-by":"publisher","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","DOI":"10.1007\/s00453-022-01016-9"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Amir, A., Landau, G.M., Marcus, S., Sokol, D.: Two-dimensional maximal repetitions. Theoret. Comput. Sci. 812, 49\u201361 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.07.006","DOI":"10.1016\/j.tcs.2019.07.006"},{"key":"8_CR4","doi-asserted-by":"crossref","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","DOI":"10.1016\/S0304-3975(98)00182-0"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Apostolico, A., Brimkov, V.E.: Optimal discovery of repetitions in 2D. Discrete Appl. Math. 151(1\u20133), 5\u201320 (2005). https:\/\/doi.org\/10.1016\/j.dam.2005.02.019","DOI":"10.1016\/j.dam.2005.02.019"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: A new characterization of maximal repetitions by Lyndon trees. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4\u20136 January 2015, pp. 562\u2013571 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.38","DOI":"10.1137\/1.9781611973730.38"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017). https:\/\/doi.org\/10.1137\/15M1011032","DOI":"10.1137\/15M1011032"},{"key":"8_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, Italy (Virtual Conference). LIPIcs, vol. 173, pp. 1\u201318. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.32","DOI":"10.4230\/LIPIcs.ESA.2020.32"},{"key":"8_CR9","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT press (2022)"},{"key":"8_CR10","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/S0097539795280068","DOI":"10.1137\/S0097539795280068"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Ilie, L., Rytter, W.: Repetitions in strings: algorithms and combinatorics. Theoret. Comput. Sci. 410(50), 5227\u20135235 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.08.024","DOI":"10.1016\/j.tcs.2009.08.024"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: Extracting powers and periods in a word from its runs structure. Theoret. Comput. Sci. 521, 29\u201341 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.11.018","DOI":"10.1016\/j.tcs.2013.11.018"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13(5), 405\u2013425 (1995). https:\/\/doi.org\/10.1007\/BF01190846","DOI":"10.1007\/BF01190846"},{"key":"8_CR14","unstructured":"Davoodi, P.: Data structures: range queries and space efficiency, Ph. D. thesis, Aarhus University (2011)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-86692-1_15","volume-title":"String Processing and Information Retrieval","author":"P Gawrychowski","year":"2021","unstructured":"Gawrychowski, P., Ghazawi, S., Landau, G.M.: Lower bounds for the number of\u00a0repetitions in 2D strings. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 179\u2013192. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_15"},{"key":"8_CR16","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, pp. 596\u2013604. New York, NY, USA. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814634","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-48321-7_31","volume-title":"Fundamentals of Computation Theory","author":"R Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: On maximal repetitions in words. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 374\u2013385. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48321-7_31"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Applied combinatorics on words, vol. 105. Cambridge University Press (2005)","DOI":"10.1017\/CBO9781107341005"},{"key":"8_CR19","doi-asserted-by":"publisher","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","DOI":"10.1007\/s00453-015-0065-z"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257\u2013276 (1985). https:\/\/doi.org\/10.1137\/0214021","DOI":"10.1137\/0214021"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46994-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T07:03:16Z","timestamp":1698303796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46994-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031469930","9783031469947"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46994-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Coruna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2023\/","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":"33","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":"16","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":"48% - 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":"3","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)"}},{"value":"Familiarity, LaTeX and LNCS friendly, steering committee has subscription","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}