{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:01:10Z","timestamp":1780743670989,"version":"3.54.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031439797","type":"print"},{"value":"9783031439803","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-43980-3_6","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"62-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Wheeler Language Recognition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3495-3753","authenticated-orcid":false,"given":"Ruben","family":"Becker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0098-3620","authenticated-orcid":false,"given":"Davide","family":"Cenzato","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1117-5020","authenticated-orcid":false,"given":"Sung-Hwan","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7242-0096","authenticated-orcid":false,"given":"Bojana","family":"Kodric","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8502-5896","authenticated-orcid":false,"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3553-4953","authenticated-orcid":false,"given":"Nicola","family":"Prezza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104820","volume":"281","author":"J Alanko","year":"2021","unstructured":"Alanko, J., D\u2019Agostino, G., Policriti, A., Prezza, N.: Wheeler languages. Inf. Comput. 281, 104820 (2021). https:\/\/doi.org\/10.1016\/j.ic.2021.104820","journal-title":"Inf. Comput."},{"key":"6_CR2","unstructured":"Becker, R., et al.: Sorting Finite Automata via Partition Refinement (2023). 10.48550\/arXiv. 2305.05129, to appear at ESA 2023"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Becker, R., Cenzato, D., Kim, S.H., Kodric, B., Policriti, A., Prezza, N.: Optimal wheeler language recognition (2023). https:\/\/doi.org\/10.48550\/arXiv.2306.04737","DOI":"10.48550\/arXiv.2306.04737"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Conte, A., Cotumaccio, N., Gagie, T., Manzini, G., Prezza, N., Sciortino, M.: Computing matching statistics on wheeler DFAs. In: Data Compression Conference (DCC), pp. 150\u2013159 (2023). https:\/\/doi.org\/10.1109\/DCC55655.2023.00023","DOI":"10.1109\/DCC55655.2023.00023"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N., D\u2019Agostino, G., Policriti, A., Prezza, N.: Co-lexicographically ordering automata and regular languages - part I. J. ACM 70, 1\u201373 (2023). https:\/\/doi.org\/10.1145\/3607471, (online available)","DOI":"10.1145\/3607471"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N., Prezza, N.: On indexing and compressing finite automata. In: Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2585\u20132599 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.153","DOI":"10.1137\/1.9781611976465.153"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"113709","DOI":"10.1016\/j.tcs.2023.113709","volume":"949","author":"G D\u2019Agostino","year":"2023","unstructured":"D\u2019Agostino, G., Martincigh, D., Policriti, A.: Ordering regular languages and automata: complexity. Theoret. Comput. Sci. 949, 113709 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.113709","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Eizenga, J.M., et al.: Pangenome graphs. Ann. Rev. Genomics Hum. Genet. 21(1), 139\u2013162 (2020). https:\/\/doi.org\/10.1146\/annurev-genom-120219-080406, pMID: 32453966","DOI":"10.1146\/annurev-genom-120219-080406"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Equi, M., Grossi, R., M\u00e4kinen, V., Tomescu, A.I.: On the complexity of string matching for graphs. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 55:1\u201355:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.55","DOI":"10.4230\/LIPIcs.ICALP.2019.55"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2017.06.016","volume":"698","author":"T Gagie","year":"2017","unstructured":"Gagie, T., Manzini, G., Sir\u00e9n, J.: Wheeler graphs: a framework for BWT-based data structures. Theoret. Comput. Sci. 698, 67\u201378 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.06.016","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Hopcroft, J.: An $$n\\log n$$ algorithm for minimizing states in a finite automaton. In: Proceedings of an International Symposium on the Theory of Machines and Computations, pp. 189\u2013196 (1971). https:\/\/doi.org\/10.1016\/B978-0-12-417750-5.50022-1","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Kim, S.H., Olivares, F., Prezza, N.: Faster prefix-sorting algorithms for deterministic finite automata. In: Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 16:1\u201316:16 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2023.16","DOI":"10.4230\/LIPIcs.CPM.2023.16"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Nerode, A.: Linear automaton transformations. In: Proceedings of the American Mathematical Society, vol. 9, no. 4, pp. 541\u2013544 (1958). https:\/\/doi.org\/10.2307\/2033204","DOI":"10.2307\/2033204"},{"issue":"2\u20133","key":"6_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.tcs.2005.09.023","volume":"348","author":"R Williams","year":"2005","unstructured":"Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348(2\u20133), 357\u2013365 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.023","journal-title":"Theor. Comput. Sci."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:45Z","timestamp":1695124965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_6","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":"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)"}}]}}