{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:36:20Z","timestamp":1773272180922,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319944173","type":"print"},{"value":"9783319944180","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94418-0_11","type":"book-chapter","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T16:38:26Z","timestamp":1530722306000},"page":"107-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Divide and Conquer Computation of the Multi-string BWT and LCP Array"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Della Vedova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serena","family":"Nicosia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Previtali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaella","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2012.02.002","volume":"483","author":"MJ Bauer","year":"2013","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theor. Comp. Sci. 483, 134\u2013148 (2013)","journal-title":"Theor. Comp. Sci."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-33122-0_26","volume-title":"Algorithms in Bioinformatics","author":"MJ Bauer","year":"2012","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G., Sciortino, M.: Lightweight LCP construction for next-generation sequencing datasets. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 326\u2013337. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33122-0_26"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-49529-2_13","volume-title":"LATIN 2016: Theoretical Informatics","author":"D Belazzougui","year":"2016","unstructured":"Belazzougui, D., Gagie, T., M\u00e4kinen, V., Previtali, M., Puglisi, S.J.: Bidirectional variable-order de Bruijn graphs. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 164\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_13"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-58163-7_3","volume-title":"Algorithms for Computational Biology","author":"S Beretta","year":"2017","unstructured":"Beretta, S., Bonizzoni, P., Denti, L., Previtali, M., Rizzi, R.: Mapping RNA-seq data to a transcript graph via approximate pattern matching to a hypertext. In: Figueiredo, D., Mart\u00edn-Vide, C., Pratas, D., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2017. LNCS, vol. 10252, pp. 49\u201361. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58163-7_3"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1089\/cmb.2015.0172","volume":"23","author":"P Bonizzoni","year":"2016","unstructured":"Bonizzoni, P., Della Vedova, G., Pirola, Y., Previtali, M., Rizzi, R.: LSG: an external-memory tool to compute string graphs for next-generation sequencing data assembly. J. Comput. Biol. 23(3), 137\u2013149 (2016)","journal-title":"J. Comput. Biol."},{"key":"11_CR6","unstructured":"Bonizzoni, P., Della Vedova, G., Pirola, Y., Previtali, M., Rizzi, R.: Computing the BWT and LCP array of a set of strings in external memory. CoRR abs\/1705.07756 (2017). http:\/\/arxiv.org\/abs\/1705.07756"},{"issue":"10","key":"11_CR7","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1089\/cmb.2017.0089","volume":"24","author":"P Bonizzoni","year":"2017","unstructured":"Bonizzoni, P., Della Vedova, G., Pirola, Y., Previtali, M., Rizzi, R.: FSG: fast string graph construction for de novo assembly. J. Comput. Biol. 24(10), 953\u2013968 (2017)","journal-title":"J. Comput. Biol."},{"key":"11_CR8","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report, Digital Systems Research Center (1994)"},{"issue":"C","key":"11_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jda.2016.03.003","volume":"37","author":"AJ Cox","year":"2016","unstructured":"Cox, A.J., Garofalo, F., Rosone, G., Sciortino, M.: Lightweight LCP construction for very large collections of strings. J. Discrete Algorithms 37(C), 17\u201333 (2016)","journal-title":"J. Discrete Algorithms"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-67428-5_15","volume-title":"String Processing and Information Retrieval","author":"L Egidi","year":"2017","unstructured":"Egidi, L., Manzini, G.: Lightweight BWT and LCP merging via the gap algorithm. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 176\u2013190. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_15"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1613676.1613680","volume":"57","author":"P Ferragina","year":"2009","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57(1), 4:1\u20134:33 (2009)","journal-title":"J. ACM"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"11_CR13","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. Theor. Comput. Sci. 698, 67\u201378 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"24","key":"11_CR14","doi-asserted-by":"publisher","first-page":"3524","DOI":"10.1093\/bioinformatics\/btu584","volume":"30","author":"J Holt","year":"2014","unstructured":"Holt, J., McMillan, L.: Merging of multi-string BWTs with applications. Bioinformatics 30(24), 3524\u20133531 (2014)","journal-title":"Bioinformatics"},{"issue":"22","key":"11_CR15","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"},{"issue":"3","key":"11_CR16","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":"suppl. 2","key":"11_CR17","doi-asserted-by":"crossref","first-page":"ii79","DOI":"10.1093\/bioinformatics\/bti1114","volume":"21","author":"E Myers","year":"2005","unstructured":"Myers, E.: The fragment assembly string graph. Bioinformatics 21(suppl. 2), ii79\u2013ii85 (2005)","journal-title":"Bioinformatics"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-39053-1_42","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"G Rosone","year":"2013","unstructured":"Rosone, G., Sciortino, M.: The Burrows-Wheeler transform between data compression and combinatorics on words. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 353\u2013364. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_42"},{"issue":"12","key":"11_CR19","doi-asserted-by":"publisher","first-page":"i367","DOI":"10.1093\/bioinformatics\/btq217","volume":"26","author":"J Simpson","year":"2010","unstructured":"Simpson, J., Durbin, R.: Efficient construction of an assembly string graph using the FM-index. Bioinformatics 26(12), i367\u2013i373 (2010)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Sailing Routes in the World of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94418-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T23:09:57Z","timestamp":1720393797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94418-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944173","9783319944180"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94418-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}