{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:48:22Z","timestamp":1757450902518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"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_12","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"143-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Space-Time Trade-Offs for the LCP Array of\u00a0Wheeler DFAs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1402-5298","authenticated-orcid":false,"given":"Nicola","family":"Cotumaccio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-4444","authenticated-orcid":false,"given":"Dominik","family":"K\u00f6ppl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3553-4953","authenticated-orcid":false,"given":"Nicola","family":"Prezza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Alanko, J., D\u2019Agostino, G., Policriti, A., Prezza, N.: Regular languages meet prefix sorting. In: Proceedings of the 31st Symposium on Discrete Algorithms, (SODA 2020), pp. 911\u2013930. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.55","DOI":"10.1137\/1.9781611975994.55"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"104820","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)","journal-title":"Inf. Comput."},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Bankevich, A., et al.: SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. J. Comput. Biol. 19(5), 455\u2013477 (2012). https:\/\/doi.org\/10.1089\/cmb.2012.0021, pMID: 22506599","DOI":"10.1089\/cmb.2012.0021"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Boucher, C., Bowe, A., Gagie, T., Puglisi, S.J., Sadakane, K.: Variable-order de Bruijn graphs. In: 2015 Data Compression Conference, pp. 383\u2013392 (2015). https:\/\/doi.org\/10.1109\/DCC.2015.70","DOI":"10.1109\/DCC.2015.70"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-33122-0_18","volume-title":"Algorithms in Bioinformatics","author":"A Bowe","year":"2012","unstructured":"Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de bruijn graphs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 225\u2013235. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33122-0_18"},{"key":"12_CR6","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation (1994)"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Conte, A., Cotumaccio, N., Gagie, T., Manzini, G., Prezza, N., Sciortino, M.: Computing matching statistics on Wheeler DFAs. In: 2023 Data Compression Conference (DCC), pp. 150\u2013159 (2023). https:\/\/doi.org\/10.1109\/DCC55655.2023.00023","DOI":"10.1109\/DCC55655.2023.00023"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N.: Graphs can be succinctly indexed for pattern matching in $$O(\\vert E\\vert ^{2}+\\vert V\\vert ^{5\/2})$$ time. In: 2022 Data Compression Conference (DCC), pp. 272\u2013281 (2022). https:\/\/doi.org\/10.1109\/DCC52660.2022.00035","DOI":"10.1109\/DCC52660.2022.00035"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N., Prezza, N.: On indexing and compressing finite automata. In: Proceedings of the 32nd Symposium on Discrete Algorithms, (SODA 2021), pp. 2585\u20132599. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.153","DOI":"10.1137\/1.9781611976465.153"},{"key":"12_CR10","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","DOI":"10.1145\/3607471"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"D\u00edaz-Dom\u00ednguez, D., Gagie, T., Navarro, G.: Simulating the DNA overlap graph in succinct space. In: Pisanti, N., Pissis, S.P. (eds.) 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 128, pp. 26:1\u201326:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.26, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/10497","DOI":"10.4230\/LIPIcs.CPM.2019.26"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 184\u2013193 (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.69","DOI":"10.1109\/SFCS.2005.69"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 390\u2013398 (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892127","DOI":"10.1109\/SFCS.2000.892127"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57(1) (2009). https:\/\/doi.org\/10.1145\/1613676.1613680","DOI":"10.1145\/1613676.1613680"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12200-2_16","volume-title":"LATIN 2010: Theoretical Informatics","author":"J Fischer","year":"2010","unstructured":"Fischer, J.: Optimal succinctness for range minimum queries. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158\u2013169. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_16"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011). https:\/\/doi.org\/10.1137\/090779759","DOI":"10.1137\/090779759"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Gagie, T., Manzini, G., Sir\u00e9n, J.: Wheeler graphs: a framework for BWT-based data structures. Theor. Comput. Sci. 698, 67\u201378 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.06.016, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397517305285, algorithms, Strings and Theoretical Approaches in the Big Data Era (In Honor of the 60th Birthday of Professor Raffaele Giancarlo)","DOI":"10.1016\/j.tcs.2017.06.016"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1089\/cmb.1995.2.291","volume":"2","author":"RM Idury","year":"1995","unstructured":"Idury, R.M., Waterman, M.S.: A new algorithm for DNA sequence assembly. J. Comput. Biol. 2(2), 291\u2013306 (1995)","journal-title":"J. Comput. Biol."},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Li, R., et al.: De novo assembly of human genomes with massively parallel short read sequencing. Genome Res. 20, 265\u201372 (2009). https:\/\/doi.org\/10.1101\/gr.097261.109","DOI":"10.1101\/gr.097261.109"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Liu, M., Yu, H.: Lower bound for succinct range minimum query. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1402\u20131415. STOC 2020, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3357713.3384260","DOI":"10.1145\/3357713.3384260"},{"issue":"5","key":"12_CR21","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993). https:\/\/doi.org\/10.1137\/0222058","journal-title":"SIAM J. Comput."},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences. ACM Comput. Surv. 46(4) (2014). https:\/\/doi.org\/10.1145\/2535933","DOI":"10.1145\/2535933"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Compact Data Structures - A Practical Approach. Cambridge University Press (2016). http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/algorithmics-complexity-computer-algebra-and-computational-g\/compact-data-structures-practical-approach?format=HB","DOI":"10.1017\/CBO9781316588284"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-12683-3_28","volume-title":"Research in Computational Molecular Biology","author":"Yu Peng","year":"2010","unstructured":"Peng, Yu., Leung, H.C.M., Yiu, S.M., Chin, F.Y.L.: IDBA \u2013 a practical iterative de bruijn graph de novo assembler. In: Berger, B. (ed.) RECOMB 2010. LNCS, vol. 6044, pp. 426\u2013440. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12683-3_28"},{"issue":"17","key":"12_CR25","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Nat. Acad. Sci. 98(17), 9748\u20139753 (2001). https:\/\/doi.org\/10.1073\/pnas.171285098","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"4","key":"12_CR26","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comp. Sys. 41(4), 589\u2013607 (2007). https:\/\/doi.org\/10.1007\/s00224-006-1198-x","journal-title":"Theor. Comp. Sys."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1101\/gr.089532.108","volume":"19","author":"J Simpson","year":"2009","unstructured":"Simpson, J., Wong, K., Jackman, S., Schein, J., Jones, S., Birol, I.: ABySS: a parallel assembler for short read sequence data. Genome Res. 19, 1117\u20131123 (2009). https:\/\/doi.org\/10.1101\/gr.089532.108","journal-title":"Genome Res."},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th IEEE Annual Symposium on Switching and Automata Theory, pp. 1\u201311 (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.13","DOI":"10.1109\/SWAT.1973.13"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:03:19Z","timestamp":1695124999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_12","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)"}}]}}