{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:23:09Z","timestamp":1783099389044,"version":"3.54.6"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030866914","type":"print"},{"value":"9783030866921","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86692-1_11","type":"book-chapter","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:24:41Z","timestamp":1632777881000},"page":"129-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Computing the Original eBWT Faster, Simpler, and with Less Memory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9509-9725","authenticated-orcid":false,"given":"Christina","family":"Boucher","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-3233-0691","authenticated-orcid":false,"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3012-1394","authenticated-orcid":false,"given":"Massimiliano","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6928-0168","authenticated-orcid":false,"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"issue":"5","key":"11_CR1","doi-asserted-by":"publisher","first-page":"S2","DOI":"10.1186\/1471-2105-14-S5-S2","volume":"14","author":"C Ander","year":"2013","unstructured":"Ander, C., Schulz-Trieglaff, O., Stoye, J., Cox, A.: metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences. BMC Bioinf. 14(5), S2 (2013)","journal-title":"BMC Bioinf."},{"key":"11_CR2","unstructured":"Bannai, H., K\u00e4rkk\u00e4inen, J., K\u00f6ppl, D., Piatkowski, M.: Constructing the bijective and the extended Burrows-Wheeler Transform in linear time. In: Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021. LIPIcs, vol. 191, pp. 7:1\u20137:16 (2021)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2012.02.002","volume":"483","author":"M Bauer","year":"2013","unstructured":"Bauer, M., Cox, A., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theor. Comput. Sci. 483, 134\u2013148 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2020.11.041","volume":"862","author":"P Bonizzoni","year":"2021","unstructured":"Bonizzoni, P., Vedova, G.D., Pirola, Y., Previtali, M., Rizzi, R.: Computing the multi-string BWT and LCP array in external memory. Theor. Comput. Sci. 862, 42\u201358 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Boucher, C., et al.: PFP compressed suffix trees. In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, pp. 60\u201372. SIAM (2021)","DOI":"10.1137\/1.9781611976472.5"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Boucher, C., Gagie, T., Kuhnle, A., Langmead, B., Manzini, G., Mun, T.: Prefix-free parsing for building big BWTs. Algorithms Mol. Biol. 14(1), 13:1\u201313:15 (2019)","DOI":"10.1186\/s13015-019-0148-5"},{"key":"11_CR7","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation (1994)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cenzato, D., Lipt\u00e1k, Zs.: On different variants of the extended Burrows-Wheeler-Transform. Unpublished manuscript (2021)","DOI":"10.1109\/DCC52660.2022.00059"},{"issue":"11","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1093\/bioinformatics\/bts173","volume":"28","author":"A Cox","year":"2012","unstructured":"Cox, A., Bauer, M., Jakobi, T., Rosone, G.: Large-scale compression of genomic sequence databases with the Burrows-Wheeler Transform. Bioinformatics 28(11), 1415\u20131419 (2012)","journal-title":"Bioinformatics"},{"key":"11_CR10","unstructured":"D\u00edaz-Dom\u00ednguez, D., Navarro, G.: Efficient construction of the extended BWT from grammar-compressed DNA sequencing reads. CoRR, arXiv:2102.03961 (2021)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-019-0140-0","volume":"14","author":"L Egidi","year":"2019","unstructured":"Egidi, L., Louza, F., Manzini, G., Telles, G.: External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol. 14(1), 1\u201315 (2019)","journal-title":"Algorithms Mol. Biol."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-32686-9_3","volume-title":"String Processing and Information Retrieval","author":"T Gagie","year":"2019","unstructured":"Gagie, T., Tomohiro, I., Manzini, G., Navarro, G., Sakamoto, H., Takabatake, Y.: Rpair: rescaling RePair with Rsync. In: Brisaboa, N.R., Puglisi, S.J. (eds.) SPIRE 2019. LNCS, vol. 11811, pp. 35\u201344. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32686-9_3"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","volume":"64","author":"IM Gessel","year":"1993","unstructured":"Gessel, I.M., Reutenauer, C.: Counting permutations with given cycle structure and descent set. J. Combin. Theory Ser. A 64(2), 189\u2013215 (1993)","journal-title":"J. Combin. Theory Ser. A"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2007.07.019","volume":"387","author":"R Giancarlo","year":"2007","unstructured":"Giancarlo, R., Restivo, A., Sciortino, M.: From first principles to the Burrows and Wheeler Transform and beyond, via combinatorial optimization. Theor. Comput. Sci. 387, 236\u2013248 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Guerrini, V., Louza, F., Rosone, G.: Metagenomic analysis through the extended Burrows-Wheeler Transform. BMC Bioinf. 21(299) (2020)","DOI":"10.1186\/s12859-020-03628-w"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-18174-1_8","volume-title":"Algorithms for Computational Biology","author":"V Guerrini","year":"2019","unstructured":"Guerrini, V., Rosone, G.: Lightweight metagenomic classification via eBWT. In: Holmes, I., Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2019. LNCS, vol. 11488, pp. 112\u2013124. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18174-1_8"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-31265-6_21","volume-title":"Combinatorial Pattern Matching","author":"W-K Hon","year":"2012","unstructured":"Hon, W.-K., Ku, T.-H., Lu, C.-H., Shah, R., Thankachan, S.V.: Efficient algorithm for circular Burrows-Wheeler Transform. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 257\u2013268. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31265-6_21"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P Ko","year":"2005","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. J. Discret. Algorithms 3(2), 143\u2013156 (2005)","journal-title":"J. Discret. Algorithms"},{"issue":"22\u201324","key":"11_CR19","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.ipl.2013.09.009","volume":"113","author":"G Kucherov","year":"2013","unstructured":"Kucherov, G., T\u00f3thm\u00e9r\u00e9sz, L., Vialette, S.: On the combinatorics of suffix arrays. Inf. Process. Lett. 113(22\u201324), 915\u2013920 (2013)","journal-title":"Inf. Process. Lett."},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-030-17083-7_10","volume-title":"Research in Computational Molecular Biology","author":"A Kuhnle","year":"2019","unstructured":"Kuhnle, A., Mun, T., Boucher, C., Gagie, T., Langmead, B., Manzini, G.: Efficient construction of a complete index for pan-genomics read alignment. In: Cowen, L.J. (ed.) RECOMB 2019. LNCS, vol. 11467, pp. 158\u2013173. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17083-7_10"},{"issue":"22","key":"11_CR21","doi-asserted-by":"publisher","first-page":"3274","DOI":"10.1093\/bioinformatics\/btu541","volume":"30","author":"H Li","year":"2014","unstructured":"Li, H.: Fast construction of FM-index for long sequence reads. Bioinformatics 30(22), 3274\u20133275 (2014)","journal-title":"Bioinformatics"},{"key":"11_CR22","series-title":"SpringerBriefs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55108-7","volume-title":"Construction of Fundamental Data Structures for Strings","author":"FA Louza","year":"2020","unstructured":"Louza, F.A., Gog, S., Telles, G.P.: Construction of Fundamental Data Structures for Strings. SCS, Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55108-7"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-020-00177-y","volume":"15","author":"F Louza","year":"2020","unstructured":"Louza, F., Telles, G., Gog, S., Prezza, N., Rosone, G.: gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15(1), 1\u20135 (2020)","journal-title":"Algorithms Mol. Biol."},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Louza, F.A., Telles, G.P., Hoffmann, S., de Aguiar Ciferri, C.D.: Generalized enhanced suffix array construction in external memory. Algorithms Mol. Biol. 12(1), 26:1\u201326:16 (2017)","DOI":"10.1186\/s13015-017-0117-9"},{"issue":"5","key":"11_CR25","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler Transform. Theor. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"11_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0020-0190(02)00512-4","volume":"86","author":"S Mantaci","year":"2003","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler Transform and Sturmian words. Inf. Process. Lett. 86(5), 241\u2013246 (2003)","journal-title":"Inf. Process. Lett."},{"key":"11_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284","volume-title":"Compact Data Structures: A Practical Approach","author":"G Navarro","year":"2016","unstructured":"Navarro, G.: Compact Data Structures: A Practical Approach. Cambridge University Press, Cambridge (2016)"},{"issue":"10","key":"11_CR29","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/TC.2010.188","volume":"60","author":"G Nong","year":"2011","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Two efficient algorithms for linear time suffix array construction. IEEE Trans. Comput. 60(10), 1471\u20131484 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"11_CR30","unstructured":"Ohlebusch, E.: Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag (2013)"},{"key":"11_CR31","unstructured":"Perrin, D., Restivo, A.: Enumerative combinatorics on words. In: Bona, M. (ed.) Handbook of Enumerative Combinatorics (2015)"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-019-0137-8","volume":"14","author":"N Prezza","year":"2019","unstructured":"Prezza, N., Pisanti, N., Sciortino, M., Rosone, G.: SNPs detection by eBWT positional clustering. Algorithms Mol. Biol. 14(1), 1\u201313 (2019)","journal-title":"Algorithms Mol. Biol."},{"issue":"8","key":"11_CR33","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1186\/s12859-020-03586-3","volume":"21\u2013S","author":"N Prezza","year":"2020","unstructured":"Prezza, N., Pisanti, N., Sciortino, M., Rosone, G.: Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. BMC Bioinform. 21\u2013S(8), 260 (2020)","journal-title":"BMC Bioinform."},{"issue":"2","key":"11_CR34","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y Shiloach","year":"1981","unstructured":"Shiloach, Y.: Fast canonization of circular strings. J. Algorithms 2(2), 107\u2013121 (1981)","journal-title":"J. Algorithms"},{"issue":"7","key":"11_CR35","doi-asserted-by":"publisher","first-page":"e1002195","DOI":"10.1371\/journal.pbio.1002195","volume":"13","author":"ZD Stephens","year":"2015","unstructured":"Stephens, Z.D., et al.: Big data: astronomical or genomical? PLoS Biol. 13(7), e1002195 (2015)","journal-title":"PLoS Biol."},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"808","DOI":"10.3389\/fmicb.2017.00808","volume":"8","author":"E Stevens","year":"2017","unstructured":"Stevens, E., et al.: The public health impact of a publically available, environmental database of microbial genomes. Front. Microbiol. 8, 808 (2017)","journal-title":"Front. Microbiol."},{"key":"11_CR37","unstructured":"The 1000 Genomes Project Consortium. A global reference for human genetic variation. Nature 526, 68\u201374 (2015)"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"The COVID-19 Data Portal. https:\/\/www.covid19dataportal.org\/. Accessed 17 May 2021","DOI":"10.5130\/pjmis.v17i1-2.7530"},{"issue":"4","key":"11_CR39","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.jtbi.2009.10.033","volume":"262","author":"L Yang","year":"2010","unstructured":"Yang, L., Zhang, X., Wang, T.: The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler Transform. J. Theor. Biol. 262(4), 742\u2013749 (2010)","journal-title":"J. Theor. Biol."}],"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-030-86692-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T10:06:17Z","timestamp":1673345177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86692-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866914","9783030866921"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86692-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 September 2021","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":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cristal.univ-lille.fr\/spire2021\/","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":"30","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":"14","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":"4","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":"47% - 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.87","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":"2.32","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":"2 invited papers are also included. The symposium was held virtually.","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)"}}]}}