{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:40:34Z","timestamp":1772908834215,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031388538","type":"print"},{"value":"9783031388545","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-38854-5_6","type":"book-chapter","created":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T21:01:44Z","timestamp":1690059704000},"page":"97-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Lossy Compression for\u00a0Large FASTQ Files"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8888-9243","authenticated-orcid":false,"given":"Veronica","family":"Guerrini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2931-1470","authenticated-orcid":false,"given":"Felipe A.","family":"Louza","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5075-1214","authenticated-orcid":false,"given":"Giovanna","family":"Rosone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,23]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Sensitivity of string compressors and repetitiveness measures (2023). https:\/\/doi.org\/10.1016\/j.ic.2022.104999","DOI":"10.1016\/j.ic.2022.104999"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53\u201386 (2004). https:\/\/doi.org\/10.1016\/S1570-8667(03)00065-0","journal-title":"J. Discrete Algorithms"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78909-5","volume-title":"The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching","author":"D Adjeroh","year":"2008","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-78909-5"},{"key":"6_CR4","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). https:\/\/doi.org\/10.1016\/j.tcs.2012.02.002","journal-title":"Theor. Comput. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-015-0709-7","volume":"16","author":"G Benoit","year":"2015","unstructured":"Benoit, G., et al.: Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph. BMC Bioinform. 16, 1\u201314 (2015). https:\/\/doi.org\/10.1186\/s12859-015-0709-7","journal-title":"BMC Bioinform."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bentley, J.W., Gibney, D., Thankachan, S.V.: On the complexity of BWT-runs minimization via alphabet reordering. In: ESA. LIPIcs, vol. 173, pp. 15:1\u201315:13. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.15","DOI":"10.4230\/LIPIcs.ESA.2020.15"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1089\/cmb.2018.0230","volume":"26","author":"P Bonizzoni","year":"2019","unstructured":"Bonizzoni, P., Della Vedova, G., Pirola, Y., Previtali, M., Rizzi, R.: Multithread multistring Burrows-Wheeler transform and longest common prefix array. J. Comput. Biol. 26(9), 948\u2013961 (2019). https:\/\/doi.org\/10.1089\/cmb.2018.0230","journal-title":"J. Comput. Biol."},{"issue":"08","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1142\/S0129054114400309","volume":"25","author":"S Bonomo","year":"2014","unstructured":"Bonomo, S., Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: Sorting conjugates and suffixes of words in a multiset. Int. J. Found. Comput. Sci. 25(08), 1161\u20131175 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-86692-1_11","volume-title":"String Processing and Information Retrieval","author":"C Boucher","year":"2021","unstructured":"Boucher, C., Cenzato, D., Lipt\u00e1k, Z., Rossi, M., Sciortino, M.: Computing the original eBWT faster, simpler, and with less memory. In: Lecroq, T., Touzet, H. (eds.) SPIRE 2021. LNCS, vol. 12944, pp. 129\u2013142. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86692-1_11"},{"key":"6_CR10","unstructured":"Burrows, M., Wheeler, D.: A Block Sorting data Compression Algorithm. Technical report DIGITAL System Research Center (1994)"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Cazaux, B., Rivals, E.: Linking BWT and XBW via Aho-Corasick automaton: applications to run-length encoding. In: CPM. LIPIcs, vol. 128, pp. 24:1\u201324:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.24","DOI":"10.4230\/LIPIcs.CPM.2019.24"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Cenzato, D., Lipt\u00e1k, Z.: A theoretical and experimental analysis of BWT variants for string collections. In: Bannai, H., Holub, J. (eds.) 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 223, pp. 25:1\u201325:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2022.25","DOI":"10.4230\/LIPIcs.CPM.2022.25"},{"issue":"15","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1093\/bioinformatics\/bty1015","volume":"35","author":"S Chandak","year":"2018","unstructured":"Chandak, S., Tatwawadi, K., Ochoa, I., Hernaez, M., Weissman, T.: SPRING: a next-generation compressor for FASTQ data. Bioinformatics 35(15), 2674\u20132676 (2018)","journal-title":"Bioinformatics"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1093\/bioinformatics\/btx639","volume":"34","author":"S Chandak","year":"2017","unstructured":"Chandak, S., Tatwawadi, K., Weissman, T.: Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis. Bioinformatics 34(4), 558\u2013567 (2017). https:\/\/doi.org\/10.1093\/bioinformatics\/btx639","journal-title":"Bioinformatics"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J Cleary","year":"1984","unstructured":"Cleary, J., Witten, I.: Data compression using adaptive coding and partial string matching. IEEE Trans. Commun. 32(4), 396\u2013402 (1984). https:\/\/doi.org\/10.1109\/TCOM.1984.1096090","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"6_CR16","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). https:\/\/doi.org\/10.1093\/bioinformatics\/bts173","journal-title":"Bioinformatics"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-33122-0_17","volume-title":"Algorithms in Bioinformatics","author":"AJ Cox","year":"2012","unstructured":"Cox, A.J., Jakobi, T., Rosone, G., Schulz-Trieglaff, O.B.: Comparing DNA sequence collections by direct comparison of compressed text indexes. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 214\u2013224. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33122-0_17"},{"issue":"1","key":"6_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-56847-4","volume":"10","author":"S Deorowicz","year":"2020","unstructured":"Deorowicz, S.: Fqsqueezer: k-mer-based compression of sequencing data. Sci. Rep. 10(1), 1\u20139 (2020)","journal-title":"Sci. Rep."},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1038\/ng.806","volume":"43","author":"MA DePristo","year":"2011","unstructured":"DePristo, M.A., et al.: A framework for variation discovery and genotyping using next-generation DNA sequencing data. Nat. Genet. 43(5), 491\u2013498 (2011). https:\/\/doi.org\/10.1038\/ng.806","journal-title":"Nat. Genet."},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Egidi, L., Louza, F.A., Manzini, G., Telles, G.P.: External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol. 14(1), 6:1\u20136:15 (2019). https:\/\/doi.org\/10.1186\/s13015-019-0140-0","DOI":"10.1186\/s13015-019-0140-0"},{"key":"6_CR21","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"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390\u2013398. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892127","DOI":"10.1109\/SFCS.2000.892127"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-67731-2_18","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"S Giuliani","year":"2021","unstructured":"Giuliani, S., Inenaga, S., Lipt\u00e1k, Z., Prezza, N., Sciortino, M., Toffanello, A.: Novel results on the number of runs of the Burrows-Wheeler-transform. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 249\u2013262. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_18"},{"issue":"20","key":"6_CR24","doi-asserted-by":"publisher","first-page":"3124","DOI":"10.1093\/bioinformatics\/btw385","volume":"32","author":"DL Greenfield","year":"2016","unstructured":"Greenfield, D.L., Stegle, O., Rrustemi, A.: GeneCodeq: quality score compression and improved genotyping using a Bayesian framework. Bioinformatics 32(20), 3124\u20133132 (2016). https:\/\/doi.org\/10.1093\/bioinformatics\/btw385","journal-title":"Bioinformatics"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/s12859-020-03628-w","volume":"21","author":"V Guerrini","year":"2020","unstructured":"Guerrini, V., Louza, F., Rosone, G.: Metagenomic analysis through the extended Burrows-Wheeler transform. BMC Bioinform. 21, 21\u201325 (2020). https:\/\/doi.org\/10.1186\/s12859-020-03628-w","journal-title":"BMC Bioinform."},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Guerrini., V., Louza., F., Rosone., G.: Lossy compressor preserving variant calling through extended BWT. In: Proceedings of the 15th International Joint Conference on Biomedical Engineering Systems and Technologies - BIOINFORMATICS, pp. 38\u201348. INSTICC, SciTePress (2022). https:\/\/doi.org\/10.5220\/0010834100003123","DOI":"10.5220\/0010834100003123"},{"issue":"23","key":"6_CR27","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1093\/bioinformatics\/bts593","volume":"28","author":"F Hach","year":"2012","unstructured":"Hach, F., Numanagi\u0107, I., Alkan, C., Sahinalp, S.C.: SCALCE: boosting sequence compression algorithms using locally consistent encoding. Bioinformatics 28(23), 3051\u20133057 (2012). https:\/\/doi.org\/10.1093\/bioinformatics\/bts593","journal-title":"Bioinformatics"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1186\/2047-217X-2-5","volume":"2","author":"RC Holland","year":"2013","unstructured":"Holland, R.C., Lynch, N.: Sequence squeeze: an open contest for sequence compression. GigaScience 2(1), 2047\u2013217X (2013). https:\/\/doi.org\/10.1186\/2047-217X-2-5","journal-title":"GigaScience"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1093\/bioinformatics\/btt257","volume":"30","author":"L Janin","year":"2014","unstructured":"Janin, L., Rosone, G., Cox, A.J.: Adaptive reference-free compression of sequence quality scores. Bioinformatics 30(1), 24\u201330 (2014). https:\/\/doi.org\/10.1093\/bioinformatics\/btt257","journal-title":"Bioinformatics"},{"key":"6_CR30","unstructured":"Li, H.: Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM. arXiv:1303.3997 (2013)"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Li, H.: Fast construction of FM-index for long sequence reads. Bioinformatics 30(22), 3274\u20133275 (2014). https:\/\/doi.org\/10.1093\/bioinformatics\/btu541, source code: https:\/\/github.com\/lh3\/ropebwt2","DOI":"10.1093\/bioinformatics\/btu541"},{"issue":"14","key":"6_CR32","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinform. 25(14), 1754\u20131760 (2009). https:\/\/doi.org\/10.1093\/bioinformatics\/btp324","journal-title":"Bioinform."},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-020-00177-y","volume":"15","author":"FA Louza","year":"2020","unstructured":"Louza, F.A., Telles, G.P., Gog, S., Prezza, N., Rosone, G.: gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15, 1\u20135 (2020)","journal-title":"Algorithms Mol. Biol."},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2017.03.039","volume":"678","author":"FA Louza","year":"2017","unstructured":"Louza, F.A., Gog, S., Telles, G.P.: Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678, 22\u201339 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.03.039","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"6_CR35","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol. 17(3), 281\u2013308 (2010)","journal-title":"J. Comput. Biol."},{"key":"6_CR36","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: ACM-SIAM SODA, pp. 319\u2013327 (1990)"},{"issue":"3","key":"6_CR37","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. Theoret. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2017.07.015","volume":"698","author":"S Mantaci","year":"2017","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M., Versari, L.: Measuring the clustering effect of BWT via RLE. Theor. Comput. Sci. 698, 79\u201387 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.07.015","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"6_CR39","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/26.61469","volume":"38","author":"A Moffat","year":"1990","unstructured":"Moffat, A.: Implementing the PPM data compression scheme. IEEE Trans. Commun. 38(11), 1917\u20131921 (1990). https:\/\/doi.org\/10.1109\/26.61469","journal-title":"IEEE Trans. Commun."},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2017.02.020","volume":"710","author":"JC Na","year":"2018","unstructured":"Na, J.C., et al.: FM-index of alignment with gaps. Theor. Comput. Sci. 710, 148\u2013157 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part I: repetitiveness measures. ACM Comput. Surv. 54(2), 29:1\u201329:31 (2021)","DOI":"10.1145\/3434399"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part II: compressed indexes. ACM Comput. Surv. 54(2), 26:1\u201326:32 (2021)","DOI":"10.1145\/3432999"},{"issue":"2","key":"6_CR43","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/bib\/bbw011","volume":"18","author":"I Ochoa","year":"2016","unstructured":"Ochoa, I., Hernaez, M., Goldfeder, R., Weissman, T., Ashley, E.: Effect of lossy compression of quality scores on variant calling. Brief. Bioinform. 18(2), 183\u2013194 (2016). https:\/\/doi.org\/10.1093\/bib\/bbw011","journal-title":"Brief. Bioinform."},{"key":"6_CR44","doi-asserted-by":"publisher","unstructured":"Prezza, N., Pisanti, N., Sciortino, M., Rosone, G.: Variable-order reference-free variant discovery with the Burrows-Wheeler transform. BMC Bioinform. 21, 1\u201320 (2020). https:\/\/doi.org\/10.1186\/s12859-020-03586-3","DOI":"10.1186\/s12859-020-03586-3"},{"key":"6_CR45","doi-asserted-by":"publisher","unstructured":"Prezza, N., Rosone, G.: Space-efficient computation of the LCP array from the Burrows-Wheeler transform. In: Annual Symposium on Combinatorial Pattern Matching (CPM). vol. 128. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.7","DOI":"10.4230\/LIPIcs.CPM.2019.7"},{"issue":"1","key":"6_CR46","doi-asserted-by":"publisher","first-page":"3","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), 3 (2019). https:\/\/doi.org\/10.1186\/s13015-019-0137-8","journal-title":"Algorithms Mol. Biol."},{"key":"6_CR47","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.tcs.2020.11.024","volume":"852","author":"N Prezza","year":"2021","unstructured":"Prezza, N., Rosone, G.: Space-efficient construction of compressed suffix trees. Theoret. Comput. Sci. 852, 138\u2013156 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.11.024","journal-title":"Theoret. Comput. Sci."},{"issue":"27","key":"6_CR48","doi-asserted-by":"publisher","first-page":"3019","DOI":"10.1016\/j.tcs.2010.11.040","volume":"412","author":"A Restivo","year":"2011","unstructured":"Restivo, A., Rosone, G.: Balancing and clustering of words in the Burrows-Wheeler transform. Theor. Comput. Sci. 412(27), 3019\u20133032 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.11.040","journal-title":"Theor. Comput. Sci."},{"issue":"16","key":"6_CR49","doi-asserted-by":"publisher","first-page":"2748","DOI":"10.1093\/bioinformatics\/bty205","volume":"34","author":"L Roguski","year":"2018","unstructured":"Roguski, L., Ochoa, I., Hernaez, M., Deorowicz, S.: FaStore: a space-saving solution for raw sequencing data. Bioinformatics 34(16), 2748\u20132756 (2018)","journal-title":"Bioinformatics"},{"key":"6_CR50","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"},{"key":"6_CR51","doi-asserted-by":"publisher","unstructured":"Shibuya, Y., Comin, M.: Better quality score compression through sequence-based quality smoothing. BMC Bioinform. 20-S(9), 302:1\u2013302:11 (2019). https:\/\/doi.org\/10.1186\/s12859-019-2883-5","DOI":"10.1186\/s12859-019-2883-5"},{"issue":"12","key":"6_CR52","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1093\/bioinformatics\/btq217","volume":"26","author":"JT Simpson","year":"2010","unstructured":"Simpson, J.T., Durbin, R.: Efficient construction of an assembly string graph using the FM-index. Bioinformatics 26(12), 367\u2013373 (2010)","journal-title":"Bioinformatics"},{"issue":"3","key":"6_CR53","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1038\/nbt.3170","volume":"33","author":"YW Yu","year":"2015","unstructured":"Yu, Y.W., Yorukoglu, D., Peng, J., Berger, B.: Quality score compression improves genotyping accuracy. Nat. Biotechnol. 33(3), 240\u2013243 (2015). https:\/\/doi.org\/10.1038\/nbt.3170","journal-title":"Nat. Biotechnol."}],"container-title":["Communications in Computer and Information Science","Biomedical Engineering Systems and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38854-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T21:04:30Z","timestamp":1690059870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38854-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031388538","9783031388545"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38854-5_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIOSTEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Biomedical Engineering Systems and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"biostec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/biostec.scitevents.org\/?y=2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"262","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":"21","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":"8% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}