{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:19:51Z","timestamp":1770419991203,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031332630","type":"print"},{"value":"9783031332647","type":"electronic"}],"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-33264-7_5","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"51-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Detection of\u00a0Specific Fragments Against a\u00a0Set of\u00a0Sequences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0089-1486","authenticated-orcid":false,"given":"Marie-Pierre","family":"B\u00e9al","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1087-1419","authenticated-orcid":false,"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"issue":"1\u20132","key":"5_CR1","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. Informaticae 56(1\u20132), 121\u2013135 (2003)","journal-title":"Fundam. Informaticae"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/aama.2000.0682","volume":"25","author":"M B\u00e9al","year":"2000","unstructured":"B\u00e9al, M., Mignosi, F., Restivo, A., Sciortino, M.: Forbidden words in symbolic dynamics. Adv. Appl. Math. 25(2), 163\u2013193 (2000)","journal-title":"Adv. Appl. Math."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-13345-3_9","volume-title":"Automata, Languages and Programming","author":"A Blumer","year":"1984","unstructured":"Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., McConnell, R.: Building the minimal DFA for the set of all subwords of a word on-line in linear time. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 109\u2013118. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/3-540-13345-3_9"},{"issue":"3","key":"5_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., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3), 578\u2013595 (1987)","journal-title":"J. ACM"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Bonizzoni, P., Felice, C.D., Pirola, Y., Rizzi, R., Zaccagnino, R., Zizza, R.: Can formal languages help pangenomics to represent and analyze multiple genomes? In Diekert, V., Volkov, M.V. (eds.) Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, May 9\u201313, 2022, Proceedings, volume 13257, LNCS, pp. 3\u201312. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_1","DOI":"10.1007\/978-3-031-05578-2_1"},{"key":"5_CR6","unstructured":"Castiglione, G., Gao, J., Mantaci, S., Restivo, A.: A new distance based on minimal absent words and applications to biological sequences. CoRR, abs\/2105.14990 (2021)"},{"key":"5_CR7","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":"5_CR8","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."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M Crochemore","year":"1986","unstructured":"Crochemore, M.: Transducers and repetitions. Theoret. Comput. Sci. 45(1), 63\u201386 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, 392p (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Crochemore, M., et al.: Ramusat. Absent words in a sliding window with applications. Inf. Comput. 270 (2020)","DOI":"10.1016\/j.ic.2019.104461"},{"issue":"3","key":"5_CR12","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":"5_CR13","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12\u201314 November 2000, Redondo Beach, California, USA, pp. 390\u2013398. IEEE Computer Society (2000)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"1","key":"5_CR15","first-page":"05","volume":"1","author":"P. Khorsand, L. Denti, H. G. S. V. Consortium, P. Bonizzoni, R. Chikhi, F. Hormozdiari","year":"2021","unstructured":"P. Khorsand, L. Denti, H. G. S. V. Consortium, P. Bonizzoni, R. Chikhi, F. Hormozdiari: Comparative genome analysis using sample-specific string detection in accurate long reads. Bioinform. Adv. 1(1), 05 (2021)","journal-title":"Bioinform. Adv."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Li, H.: Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics 28(14), 1838\u20131844 (2012)","DOI":"10.1093\/bioinformatics\/bts280"},{"issue":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Mignosi, F., Restivo, A., Sciortino, M.: Forbidden factors in finite and infinite words. In: Karhum\u00e4ki, J., Maurer, H.A., Paun, G., Rozenberg, G. (eds.) Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp 339\u2013350. Springer, Cham (1999). https:\/\/doi.org\/10.1007\/978-3-642-60207-8_30","DOI":"10.1007\/978-3-642-60207-8_30"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings\u2013Practical On-Line Search Algorithms for Texts and Biological Sequences. Cambridge University Press, 232p (2002)","DOI":"10.1017\/CBO9781316135228"},{"key":"5_CR20","doi-asserted-by":"crossref","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 (2009)","DOI":"10.1186\/1471-2105-10-137"},{"issue":"15","key":"5_CR21","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.1093\/bioinformatics\/btv189","volume":"31","author":"RM Silva","year":"2015","unstructured":"Silva, R.M., Pratas, D., Castro, L., Pinho, A.J., Ferreira, P.J.S.G.: Three minimal sequences found in ebola virus genomes and absent from human DNA. Bioinform. 31(15), 2421\u20132425 (2015)","journal-title":"Bioinform."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:04:10Z","timestamp":1684397050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"19","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":"59% - 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":"6","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":"4- Invited papers and 32 submissions (31 regular ones and one invited)","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)"}}]}}