{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:09:55Z","timestamp":1758586195283,"version":"3.44.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_32","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:36Z","timestamp":1758498336000},"page":"434-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizers in\u00a0Semi-dynamic Strings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1988-3507","authenticated-orcid":false,"given":"Wiktor","family":"Zuba","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5406-8121","authenticated-orcid":false,"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1445-1932","authenticated-orcid":false,"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2022.06.002","volume":"927","author":"T Akagi","year":"2022","unstructured":"Akagi, T., et al.: Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. 927, 109\u2013119 (2022)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"32_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1240233.1240242","volume":"3","author":"A Amir","year":"2007","unstructured":"Amir, A., Landau, G.M., Lewenstein, M., Sokol, D.: Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2), 19 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"32_CR3","unstructured":"Bannai, H., Charalampopoulos, P., Radoszewski, J.: Maintaining the size of LZ77 on semi-dynamic strings. In: CPM 2024, pp. 1\u201320 (2024)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd Edition. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"8","key":"32_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.3390\/a11080118","volume":"11","author":"A Brodnik","year":"2018","unstructured":"Brodnik, A., Jekovec, M.: Sliding suffix tree. Algorithms 11(8), 118 (2018)","journal-title":"Algorithms"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Chikhi, R., Holub, J., Medvedev, P.: Data structures to represent a set of k-long DNA sequences. ACM Comput. Surv. 54(1), 1\u201322 (2022)","DOI":"10.1145\/3445967"},{"key":"32_CR7","unstructured":"Clifford, R., Gawrychowski, P., Kociumaka, T., Martin, D.P., Uznanski, P.: The dynamic k-mismatch problem. In: CPM 2022, pp. 1\u201315 (2022)"},{"key":"32_CR8","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company (2001)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Crochemore, M., H\u00e9liou, A., Kucherov, G., Mouchard, L., Pissis, S.P., Ramusat, Y.: Absent words in a sliding window with applications. Inf. Comput. 270 (2020)","DOI":"10.1016\/j.ic.2019.104461"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Edgar, R.: Syncmers are more sensitive than minimizers for selecting conserved k-mers in biological sequences. PeerJ 9, e10805 (2021)","DOI":"10.7717\/peerj.10805"},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"ER Fiala","year":"1989","unstructured":"Fiala, E.R., Greene, D.H.: Data compression with finite windows. Commun. ACM 32(4), 490\u2013505 (1989)","journal-title":"Commun. ACM"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Gabory, E., Liu, C., Loukides, G., Pissis, S.P., Zuba, W.: Space-efficient indexes for uncertain strings. In: ICDE 2024, pp. 4828\u20134842. IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00367"},{"issue":"1","key":"32_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/s13015-025-00270-0","volume":"20","author":"R Groot Koerkamp","year":"2025","unstructured":"Groot Koerkamp, R., Liu, D., Pibiri, G.E.: The open-closed mod-minimizer algorithm. Algorithms Mol. Biol. 20(1), 4 (2025)","journal-title":"Algorithms Mol. Biol."},{"key":"32_CR14","doi-asserted-by":"publisher","unstructured":"Groot\u00a0Koerkamp, R., Martayan, I.: SimdMinimizers: computing random minimizers, fast. bioRxiv (2025). https:\/\/doi.org\/10.1101\/2025.01.27.634998","DOI":"10.1101\/2025.01.27.634998"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Gu, M., Farach, M., Beigel, R.: An efficient algorithm for dynamic text indexing. In: SODA 1994, pp. 697\u2013704 (1994)","DOI":"10.25291\/VR\/1994-1-VR-697"},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S1570-8667(03)00064-9","volume":"2","author":"S Inenaga","year":"2004","unstructured":"Inenaga, S., Shinohara, A., Takeda, M., Arikawa, S.: Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms 2(1), 33\u201351 (2004)","journal-title":"J. Discrete Algorithms"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/11537311_49","volume-title":"Fundamentals of Computation Theory","author":"Y Ishida","year":"2005","unstructured":"Ishida, Y., Inenaga, S., Shinohara, A., Takeda, M.: Fully incremental LCS computation. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 563\u2013574. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11537311_49"},{"issue":"2","key":"32_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S1570-8667(03)00082-0","volume":"2","author":"S Kim","year":"2004","unstructured":"Kim, S., Park, K.: A dynamic edit distance table. J. Discrete Algorithms 2(2), 303\u2013312 (2004)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"32_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"GM Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557\u2013582 (1998)","journal-title":"SIAM J. Comput."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Larsson, N.J.: Extended application of suffix trees to data compression. In: DCC 1996, pp. 190\u2013199 (1996)","DOI":"10.1109\/DCC.1996.488324"},{"issue":"14","key":"32_CR22","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1093\/bioinformatics\/btw152","volume":"32","author":"H Li","year":"2016","unstructured":"Li, H.: Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences. Bioinform. 32(14), 2103\u20132110 (2016)","journal-title":"Bioinform."},{"issue":"18","key":"32_CR23","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1093\/bioinformatics\/bty191","volume":"34","author":"H Li","year":"2018","unstructured":"Li, H.: Minimap2: pairwise alignment for nucleotide sequences. Bioinform. 34(18), 3094\u20133100 (2018)","journal-title":"Bioinform."},{"issue":"11","key":"32_CR24","doi-asserted-by":"publisher","first-page":"11093","DOI":"10.1109\/TKDE.2022.3231780","volume":"35","author":"G Loukides","year":"2023","unstructured":"Loukides, G., Pissis, S.P., Sweering, M.: Bidirectional string anchors for improved text indexing and top-$$k$$ similarity search. IEEE Trans. Knowl. Data Eng. 35(11), 11093\u201311111 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"32_CR25","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/s00453-021-00864-1","volume":"84","author":"T Mieno","year":"2022","unstructured":"Mieno, T., Fujishige, Y., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing minimal unique substrings for a sliding window. Algorithmica 84(3), 670\u2013693 (2022)","journal-title":"Algorithmica"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Mieno, T., Funakoshi, M.: Shortest unique palindromic substring queries in semi-dynamic settings. In: IWOCA 2022, pp. 425\u2013438 (2022)","DOI":"10.1007\/978-3-031-06678-8_31"},{"key":"32_CR27","doi-asserted-by":"publisher","first-page":"106174","DOI":"10.1016\/j.ipl.2021.106174","volume":"173","author":"T Mieno","year":"2022","unstructured":"Mieno, T., Watanabe, K., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173, 106174 (2022)","journal-title":"Inf. Process. Lett."},{"issue":"18","key":"32_CR28","doi-asserted-by":"publisher","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","volume":"20","author":"M Roberts","year":"2004","unstructured":"Roberts, M., Hayes, W.B., Hunt, B.R., Mount, S.M., Yorke, J.A.: Reducing storage requirements for biological sequence comparison. Bioinform. 20(18), 3363\u20133369 (2004)","journal-title":"Bioinform."},{"issue":"11","key":"32_CR29","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1101\/gr.275648.121","volume":"31","author":"K Sahlin","year":"2021","unstructured":"Sahlin, K.: Effective sequence similarity detection with strobemers. Genome Res. 31(11), 2080\u20132094 (2021)","journal-title":"Genome Res."},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Schleimer, S., Wilkerson, D.S., Aiken, A.: Winnowing: local algorithms for document fingerprinting. In: SIGMOD 2003, pp. 76\u201385 (2003)","DOI":"10.1145\/872757.872770"},{"key":"32_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-89097-3_12","volume-title":"String Processing and Information Retrieval","author":"M Senft","year":"2008","unstructured":"Senft, M., Dvo\u0159\u00e1k, T.: Sliding CDAWG perfection. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 109\u2013120. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89097-3_12"},{"issue":"6","key":"32_CR32","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1314690.1314692","volume":"54","author":"M Thorup","year":"2007","unstructured":"Thorup, M.: Equivalence between priority queues and sorting. J. ACM 54(6), 28 (2007)","journal-title":"J. ACM"},{"key":"32_CR33","unstructured":"Verbeek, H., Ayad, L.A.K., Loukides, G., Pissis, S.P.: Minimizing the minimizers via alphabet reordering. In: CPM 2024, pp. 1\u201313 (2024)"},{"issue":"3","key":"32_CR34","doi-asserted-by":"publisher","first-page":"R46","DOI":"10.1186\/gb-2014-15-3-r46","volume":"15","author":"DE Wood","year":"2014","unstructured":"Wood, D.E., Salzberg, S.L.: Kraken: ultrafast metagenomic sequence classification using exact alignments. Genome Biol. 15(3), R46 (2014)","journal-title":"Genome Biol."},{"issue":"12","key":"32_CR35","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1089\/cmb.2023.0094","volume":"30","author":"H Zheng","year":"2023","unstructured":"Zheng, H., Mar\u00e7ais, G., Kingsford, C.: Creating and using minimizer sketches in computational genomics. J. Comput. Biol. 30(12), 1251\u20131276 (2023)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:40Z","timestamp":1758498340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}