{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:12Z","timestamp":1758585612131,"version":"3.44.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052278","type":"print"},{"value":"9783032052285","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"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-05228-5_11","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:23Z","timestamp":1758474083000},"page":"124-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Number of\u00a0MUSs Crossing a\u00a0Position"],"prefix":"10.1007","author":[{"given":"Hiroto","family":"Fujimaru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-9434","authenticated-orcid":false,"given":"Takuya","family":"Mieno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"issue":"9","key":"11_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.3390\/A13090224","volume":"13","author":"P Abedin","year":"2020","unstructured":"Abedin, P., K\u00fclekci, M.O., Thankachan, S.V.: A survey on shortest unique substring queries. Algorithms 13(9), 224 (2020). https:\/\/doi.org\/10.3390\/A13090224","journal-title":"Algorithms"},{"key":"11_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2022.104999","volume":"291","author":"T Akagi","year":"2023","unstructured":"Akagi, T., Funakoshi, M., Inenaga, S.: Sensitivity of string compressors and repetitiveness measures. Inf. Comput. 291, 104999 (2023). https:\/\/doi.org\/10.1016\/j.ic.2022.104999","journal-title":"Inf. Comput."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-319-19929-0_3","volume-title":"Combinatorial Pattern Matching","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Cunial, F., Gagie, T., Prezza, N., Raffinot, M.: Composite repetition-aware data structures. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 26\u201339. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_3"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnell, R.M., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3), 578\u2013595 (1987). https:\/\/doi.org\/10.1145\/28869.28873","journal-title":"J. ACM"},{"issue":"1","key":"11_CR5","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."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1186\/1471-2105-6-123","volume":"6","author":"B Haubold","year":"2005","unstructured":"Haubold, B., Pierstorff, N., M\u00f6ller, F., Wiehe, T.: Genome comparison without alignment using shortest unique substrings. BMC Bioinf. 6, 123 (2005). https:\/\/doi.org\/10.1186\/1471-2105-6-123","journal-title":"BMC Bioinf."},{"issue":"1\u20134","key":"11_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3233\/FI-2011-536","volume":"110","author":"L Ilie","year":"2011","unstructured":"Ilie, L., Smyth, W.F.: Minimum unique substrings and maximum repeats. Fund. Informaticae 110(1\u20134), 183\u2013195 (2011). https:\/\/doi.org\/10.3233\/FI-2011-536","journal-title":"Fund. Informaticae"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Inenaga, S., Mieno, T., Arimura, H., Funakoshi, M., Fujishige, Y.: Computing minimal absent words and extended bispecial factors with CDAWG space. In: IWOCA 2024. Lecture Notes in Computer Science, vol. 14764, pp. 327\u2013340. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-63021-7_25","DOI":"10.1007\/978-3-031-63021-7_25"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Mieno, T., Inenaga, S., Bannai, H., Takeda, M.: Shortest unique substring queries on run-length encoded strings. In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Krak\u00f3w, Poland, 22\u201326 August 2016. LIPIcs, vol.\u00a058, pp. 69:1\u201369:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2016.69","DOI":"10.4230\/LIPICS.MFCS.2016.69"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/J.TCS.2020.09.017","volume":"845","author":"T Mieno","year":"2020","unstructured":"Mieno, T., K\u00f6ppl, D., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Space-efficient algorithms for computing minimal\/shortest unique substrings. Theor. Comput. Sci. 845, 230\u2013242 (2020). https:\/\/doi.org\/10.1016\/J.TCS.2020.09.017","journal-title":"Theor. Comput. Sci."},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Nishimoto, T., Tabei, Y.: R-enum: Enumeration of characteristic substrings in bwt-runs bounded space. In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, Wroc\u0142aw, Poland, 5\u20137 July 2021. LIPIcs, vol.\u00a0191, pp. 21:1\u201321:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2021.21","DOI":"10.4230\/LIPICS.CPM.2021.21"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Pei, J., Wu, W.C., Yeh, M.: On shortest unique substring queries. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp. 937\u2013948. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544887","DOI":"10.1109\/ICDE.2013.6544887"}],"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-032-05228-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:24Z","timestamp":1758474084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}