{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:05:03Z","timestamp":1742951103818,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_25","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"327-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Minimal Absent Words and\u00a0Extended Bispecial Factors with\u00a0CDAWG Space"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","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-2701-0271","authenticated-orcid":false,"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2547-1509","authenticated-orcid":false,"given":"Mitsuru","family":"Funakoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuta","family":"Fujishige","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"issue":"1","key":"25_CR1","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."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2018.09.011","volume":"792","author":"Y Almirantis","year":"2019","unstructured":"Almirantis, Y., et al.: On overabundant words and their application to biological sequence analysis. Theor. Comput. Sci. 792, 85\u201395 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"25_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."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-23826-5_22","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Cunial, F.: Space-efficient detection of unusual words. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 222\u2013233. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_22"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-67428-5_14","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2017","unstructured":"Belazzougui, D., Cunial, F.: Fast label extraction in the CDAWG. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 161\u2013175. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_14"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"MA Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5\u201312 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0022-0000(05)80002-9","volume":"48","author":"O Berkman","year":"1994","unstructured":"Berkman, O., Vishkin, U.: Finding level-ancestors in trees. J. Comput. Syst. Sci. 48(2), 214\u2013230 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_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., Seiferas, J.: The smallest automation recognizing the subwords of a text. Theoret. Comput. Sci. 40, 31\u201355 (1985)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"25_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)","journal-title":"J. ACM"},{"key":"25_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. Theoret. Comput. Sci. 450, 109\u2013116 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"25_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., Mercas, R., Pissis, S.P.: Alignment-free sequence comparison using absent words. Inf. Comput. 262, 57\u201368 (2018)","journal-title":"Inf. Comput."},{"key":"25_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"},{"issue":"11","key":"25_CR14","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":"25_CR15","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Navarro, G.: Improved antidictionary based compression. In: Proceedings of 12th International Conference of the Chilean Computer Science Society, pp. 7\u201313. IEEE (2002)","DOI":"10.1109\/SCCC.2002.1173168"},{"key":"25_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2023.114093","volume":"973","author":"Y Fujishige","year":"2023","unstructured":"Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H., Takeda, M.: Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theoret. Comput. Sci. 973, 114093 (2023). https:\/\/doi.org\/10.1016\/J.TCS.2023.114093","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20134","key":"25_CR17","first-page":"183","volume":"110","author":"L Ilie","year":"2011","unstructured":"Ilie, L., Smyth, W.F.: Minimum unique substrings and maximum repeats. Fund. Inform. 110(1\u20134), 183\u2013195 (2011)","journal-title":"Fund. Inform."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Inenaga, S.: Linear-size suffix tries and linear-size CDAWGs simplified and improved. CoRR abs\/2401.04509 (2024)","DOI":"10.1007\/s00236-024-00465-9"},{"issue":"6","key":"25_CR19","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."},{"issue":"1\u20132","key":"25_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"F Mignosi","year":"2002","unstructured":"Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theor. Comput. Sci. 273(1\u20132), 99\u2013117 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-031-43980-3_27","volume-title":"SPIRE 2023","author":"K Okabe","year":"2023","unstructured":"Okabe, K., Mieno, T., Nakashima, Y., Inenaga, S., Bannai, H.: Linear-time computation of generalized minimal absent words for multiple strings. In: Nardini, F.M., Pisanti, N., Venturini, R. (eds.) SPIRE 2023. LNCS, vol. 14240, pp. 331\u2013344. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43980-3_27"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-137","volume":"10","author":"AJ Pinho","year":"2009","unstructured":"Pinho, A.J., Ferreira, P.J.S.G., Garcia, S.P., Rodrigues, J.M.O.S.: On finding minimal absent words. BMC Bioinform. 10, 1\u201311 (2009)","journal-title":"BMC Bioinform."},{"issue":"21","key":"25_CR23","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"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jda.2011.01.001","volume":"11","author":"J Radoszewski","year":"2012","unstructured":"Radoszewski, J., Rytter, W.: On the structure of compacted subword graphs of Thue-Morse words and their applications. J. Discrete Algorithms 11, 15\u201324 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2006.07.025","volume":"363","author":"W Rytter","year":"2006","unstructured":"Rytter, W.: The structure of subword graphs and suffix trees of Fibonacci words. Theor. Comput. Sci. 363(2), 211\u2013223 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311. IEEE (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T10:58:07Z","timestamp":1732273087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}