{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:59:08Z","timestamp":1742925548102,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"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-43980-3_27","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"331-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear-Time Computation of\u00a0Generalized Minimal Absent Words for\u00a0Multiple Strings"],"prefix":"10.1007","author":[{"given":"Kouta","family":"Okabe","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-0001-6269-9353","authenticated-orcid":false,"given":"Yuto","family":"Nakashima","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"27_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). https:\/\/doi.org\/10.1016\/j.tcs.2022.06.002","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/s13015-017-0094-z","volume":"12","author":"Y Almirantis","year":"2017","unstructured":"Almirantis, Y., et al.: On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1), 5 (2017)","journal-title":"Algorithms Mol. Biol."},{"issue":"5","key":"27_CR3","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s00224-020-10018-5","volume":"65","author":"LAK Ayad","year":"2021","unstructured":"Ayad, L.A.K., Badkobeh, G., Fici, G., H\u00e9liou, A., Pissis, S.P.: Constructing antidictionaries of long texts in output-sensitive space. Theory Comput. Syst. 65(5), 777\u2013797 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1186\/s12859-014-0388-9","volume":"15","author":"C Barton","year":"2014","unstructured":"Barton, C., Heliou, A., Mouchard, L., Pissis, S.P.: Linear-time computation of minimal absent words using suffix array. BMC Bioinform. 15(1), 388 (2014)","journal-title":"BMC Bioinform."},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"B\u00e9al, M., Crochemore, M.: Fast detection of specific fragments against a set of sequences. In: Drewes, F., Volkov, M. (eds.) Developments in Language Theory. DLT 2023. LNCS, vol. 13911, pp. 51\u201360. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33264-7_5","DOI":"10.1007\/978-3-031-33264-7_5"},{"issue":"1\u20132","key":"27_CR6","first-page":"121","volume":"56","author":"M B\u00e9al","year":"2003","unstructured":"B\u00e9al, M., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundam. Inform. 56(1\u20132), 121\u2013135 (2003)","journal-title":"Fundam. Inform."},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-60922-9_45","volume-title":"STACS 96","author":"M-P B\u00e9al","year":"1996","unstructured":"B\u00e9al, M.-P., Mignosi, F., Restivo, A.: Minimal forbidden words and symbolic dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 555\u2013566. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60922-9_45"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-40450-4_12","volume-title":"Algorithms \u2013 ESA 2013","author":"D Belazzougui","year":"2013","unstructured":"Belazzougui, D., Cunial, F., K\u00e4rkk\u00e4inen, J., M\u00e4kinen, V.: Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 133\u2013144. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_12"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31\u201355 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"27_CR10","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., 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"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2012.04.031","volume":"450","author":"S Chairungsee","year":"2012","unstructured":"Chairungsee, S., Crochemore, M.: Using minimal absent words to build phylogeny. Theor. Comput. Sci. 450, 109\u2013116 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ic.2018.06.002","volume":"262","author":"P Charalampopoulos","year":"2018","unstructured":"Charalampopoulos, P., Crochemore, M., Fici, G., Merca\u015f, R., Pissis, S.P.: Alignment-free sequence comparison using absent words. Inf. Comput. 262, 57\u201368 (2018)","journal-title":"Inf. Comput."},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-00479-8_11","volume-title":"String Processing and Information Retrieval","author":"P Charalampopoulos","year":"2018","unstructured":"Charalampopoulos, P., Crochemore, M., Pissis, S.P.: On extended special factors of a word. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 131\u2013138. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00479-8_11"},{"key":"27_CR14","unstructured":"Crawford, T., Badkobeh, G., Lewis, D.: Searching page-images of early music scanned with OMR: a scalable solution using minimal absent words. In: ISMIR 2018, pp. 233\u2013239 (2018)"},{"issue":"11","key":"27_CR15","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1109\/5.892711","volume":"88","author":"M Crochemore","year":"2000","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Data compression using antidictionaries. Proc. IEEE 88(11), 1756\u20131768 (2000)","journal-title":"Proc. IEEE"},{"key":"27_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.104461","volume":"270","author":"M Crochemore","year":"2020","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, 104461 (2020)","journal-title":"Inf. Comput."},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Process. Lett. 67(3), 111\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"key":"27_CR18","unstructured":"Crochemore, M., Navarro, G.: Improved antidictionary based compression. In: 12th International Conference of the Chilean Computer Science Society, 2002. Proceedings, pp. 7\u201313. IEEE (2002)"},{"key":"27_CR19","unstructured":"Fici, G.: Minimal forbidden words and applications. Ph.D. thesis, Universit\u00e0 di Palermo and Universit\u00e9 Paris-Est Marne-la-Vall\u00e9e (2006)"},{"key":"27_CR20","unstructured":"Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H., Takeda, M.: Computing DAWGs and minimal absent words in linear time for integer alphabets. In: MFCS 2016, vol. 58, pp. 38:1\u201338:14 (2016)"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H., Takeda, M.: Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theor. Comput. Sci. (2023, to appear)","DOI":"10.1016\/j.tcs.2023.114093"},{"issue":"6","key":"27_CR22","doi-asserted-by":"publisher","first-page":"3139","DOI":"10.1093\/nar\/gkab139","volume":"49","author":"G Koulouras","year":"2021","unstructured":"Koulouras, G., Frith, M.C.: Significant non-existence of sequences in genomes and proteomes. Nucleic Acids Res. 49(6), 3139\u20133155 (2021)","journal-title":"Nucleic Acids Res."},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-38919-2_13","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"T Mieno","year":"2020","unstructured":"Mieno, T., et al.: Minimal unique substrings and minimal absent words in a sliding window. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 148\u2013160. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_13"},{"issue":"21","key":"27_CR24","doi-asserted-by":"publisher","first-page":"5129","DOI":"10.1093\/bioinformatics\/btaa686","volume":"36","author":"D Pratas","year":"2020","unstructured":"Pratas, D., Silva, J.M.: Persistent minimal sequences of SARS-CoV-2. Bioinformatics 36(21), 5129\u20135132 (2020)","journal-title":"Bioinformatics"}],"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-031-43980-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:04:19Z","timestamp":1695125059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_27","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":"20 September 2023","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":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","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":"47","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":"31","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":"0","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":"66% - 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":"3","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)"}}]}}