{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:13:58Z","timestamp":1725884038546},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319569697"},{"type":"electronic","value":"9783319569703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56970-3_4","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T04:43:49Z","timestamp":1491885829000},"page":"50-65","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic Alignment-Free and Reference-Free Read Compression"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Holley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Wittler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faraz","family":"Hach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1186\/s12859-015-0709-7","volume":"16","author":"G Benoit","year":"2015","unstructured":"Benoit, G., Lemaitre, C., Lavenier, D., Drezen, E., Dayris, T., Uricaru, R., Rizk, G.: Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph. BMC Bioinform. 16, 288 (2015)","journal-title":"BMC Bioinform."},{"issue":"7","key":"4_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Comm. ACM 13(7), 422\u2013426 (1970)","journal-title":"Comm. ACM"},{"issue":"3","key":"4_CR3","doi-asserted-by":"crossref","first-page":"e59190","DOI":"10.1371\/journal.pone.0059190","volume":"8","author":"JK Bonfield","year":"2013","unstructured":"Bonfield, J.K., Mahoney, M.V.: Compression of FASTQ and SAM format sequencing data. PloS One 8(3), e59190 (2013)","journal-title":"PloS One"},{"key":"4_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Digital SRC Research Report 124 (1994)"},{"key":"4_CR5","unstructured":"Collet, Y.: ZSTD. https:\/\/github.com\/facebook\/zstd , 20 December 2016"},{"issue":"11","key":"4_CR6","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1038\/nbt.2023","volume":"29","author":"PEC Compeau","year":"2011","unstructured":"Compeau, P.E.C., Pevzner, P.A., Tesler, G.: How to apply de Bruijn graphs to genome assembly. Nat. Biotechnol. 29(11), 987\u2013991 (2011)","journal-title":"Nat. Biotechnol."},{"issue":"7571","key":"4_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1038\/nature15393","volume":"526","author":"1000 Genomes Project Consortium","year":"2015","unstructured":"1000 Genomes Project Consortium: A global reference for human genetic variation. Nature 526(7571), 68\u201374 (2015)","journal-title":"Nature"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1186\/1748-7188-8-25","volume":"8","author":"S Deorowicz","year":"2013","unstructured":"Deorowicz, S., Grabowski, S.: Data compression for sequencing data. Algorithms Mol. Biol. 8, 25 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"4_CR9","unstructured":"Duda, J.: Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding (2013). arXiv:1311.2540"},{"issue":"3","key":"4_CR10","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1093\/bib\/bbt088","volume":"15","author":"R Giancarlo","year":"2014","unstructured":"Giancarlo, R., Rombo, S.E., Utro, F.: Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies. Brief. Bioinform. 15(3), 390\u2013406 (2014)","journal-title":"Brief. Bioinform."},{"issue":"9","key":"4_CR11","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1093\/bioinformatics\/btu844","volume":"31","author":"S Grabowski","year":"2014","unstructured":"Grabowski, S., Deorowicz, S., Roguski, L.: Disk-based compression of data from genome sequencing. Bioinformatics 31(9), 1389\u20131395 (2014)","journal-title":"Bioinformatics"},{"issue":"23","key":"4_CR12","doi-asserted-by":"crossref","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)","journal-title":"Bioinformatics"},{"issue":"1","key":"4_CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/2047-217X-2-5","volume":"2","author":"RCG Holland","year":"2013","unstructured":"Holland, R.C.G., Nick, L.: Sequence squeeze: an open contest for sequence compression. GigaScience 2(1), 5 (2013)","journal-title":"GigaScience"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/s13015-016-0066-8","volume":"11","author":"G Holley","year":"2016","unstructured":"Holley, G., Roland, W., Stoye, J.: Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage. Algorithms Mol. Biol. 11, 3 (2016)","journal-title":"Algorithms Mol. Biol."},{"issue":"4","key":"4_CR15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.3390\/info7040056","volume":"7","author":"M Hosseini","year":"2016","unstructured":"Hosseini, M., Pratas, D., Pinho, A.J.: A survey on data compression methods for biological sequences. Information 7(4), 56 (2016)","journal-title":"Information"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. In: Proceedings of the IRE, vol. 40, no. 9, pp. 1098\u20131101 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"issue":"22","key":"4_CR17","doi-asserted-by":"crossref","first-page":"e171","DOI":"10.1093\/nar\/gks754","volume":"40","author":"DC Jones","year":"2012","unstructured":"Jones, D.C., Ruzzo, W.L., Peng, X., Katze, M.G.: Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res. 40(22), e171 (2012)","journal-title":"Nucleic Acids Res."},{"issue":"12","key":"4_CR18","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.1093\/bioinformatics\/btv071","volume":"31","author":"C Kingsford","year":"2015","unstructured":"Kingsford, C., Patro, R.: Reference-based compression of short-read sequences using path encoding. Bioinformatics 31(12), 1920\u20131928 (2015)","journal-title":"Bioinformatics"},{"issue":"2","key":"4_CR19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10142-015-0433-4","volume":"15","author":"M Land","year":"2015","unstructured":"Land, M., Hauser, L., Jun, S.-R., Nookaew, I., Leuze, M.R., Ahn, T.-H., Karpinets, T., Lund, O., Kora, G., Wassenaar, T., et al.: Insights from 20 years of bacterial genome sequencing. Funct. Integr. Genomics 15(2), 141\u2013161 (2015)","journal-title":"Funct. Integr. Genomics"},{"key":"4_CR20","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1038\/nbt.2241","volume":"30","author":"P-R Loh","year":"2012","unstructured":"Loh, P.-R., Baym, M., Berger, B.: Compressive genomics. Nat. Biotechnol. 30, 627\u2013630 (2012)","journal-title":"Nat. Biotechnol."},{"issue":"12","key":"4_CR21","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1038\/nmeth.4037","volume":"13","author":"I Numanagi\u0107","year":"2016","unstructured":"Numanagi\u0107, I., Bonfield, J.K., Hach, F., Voges, J., Ostermann, J., Alberti, C., Mattavelli, M., Sahinalp, S.C.: Comparison of high-throughput sequencing data compression tools. Nat. Methods 13(12), 1005\u20131008 (2016)","journal-title":"Nat. Methods"},{"issue":"17","key":"4_CR22","doi-asserted-by":"crossref","first-page":"2770","DOI":"10.1093\/bioinformatics\/btv248","volume":"31","author":"R Patro","year":"2015","unstructured":"Patro, R., Kingsford, C.: Data-dependent bucketing improves reference-free compression of sequencing reads. Bioinformatics 31(17), 2770\u20132777 (2015)","journal-title":"Bioinformatics"},{"key":"4_CR23","unstructured":"Pavlov, I.: LZMA. http:\/\/www.7-zip.org , 20 December 2016"},{"issue":"18","key":"4_CR24","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","volume":"20","author":"M Roberts","year":"2004","unstructured":"Roberts, M., Hayes, W., Hunt, B.R., Mount, S.M., Yorke, J.A.: Reducing storage requirements for biological sequence comparison. Bioinformatics 20(18), 3363\u20133369 (2004)","journal-title":"Bioinformatics"},{"issue":"15","key":"4_CR25","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1093\/bioinformatics\/btu208","volume":"30","author":"L Roguski","year":"2014","unstructured":"Roguski, L., Deorowicz, S.: DSRC 2-Industry-oriented compression of FASTQ files. Bioinformatics 30(15), 2213\u20132215 (2014)","journal-title":"Bioinformatics"},{"issue":"9","key":"4_CR26","doi-asserted-by":"crossref","first-page":"S7","DOI":"10.1186\/1471-2105-15-S9-S7","volume":"15","author":"R Rozov","year":"2014","unstructured":"Rozov, R., Shamir, R., Halperin, E.: Fast lossless compression via cascading Bloom filters. BMC Bioinform. 15(9), S7 (2014)","journal-title":"BMC Bioinform."},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Saha, S., Rajasekaran, S.: Efficient algorithms for the compression of FASTQ files. In: Proceedings of the International Conference on Bioinformatics and Biomedicine (BIBM 2014), pp. 82\u201385 (2014)","DOI":"10.1109\/BIBM.2014.6999132"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: FOCS, pp. 320\u2013328 (1996)","DOI":"10.1109\/SFCS.1996.548491"},{"issue":"1","key":"4_CR29","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/1748-7188-9-2","volume":"9","author":"K Salikhov","year":"2014","unstructured":"Salikhov, K., Sacomoto, G., Kucherov, G.: Using cascading Bloom filters to improve the memory usage for de Brujin graphs. Algorithm. Mol. Biol. 9(1), 2 (2014)","journal-title":"Algorithm. Mol. Biol."},{"issue":"3","key":"4_CR30","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1186\/gb-2011-12-3-402","volume":"12","author":"Genome Biology Editorial Team","year":"2011","unstructured":"Genome Biology Editorial Team: Closure of the NCBI SRA and implications for the long-term future of genomics data storage. Genome Biol. 12(3), 402 (2011)","journal-title":"Genome Biol."},{"issue":"39","key":"4_CR31","doi-asserted-by":"crossref","first-page":"13950","DOI":"10.1073\/pnas.0506758102","volume":"102","author":"H Tettelin","year":"2005","unstructured":"Tettelin, H., Masignani, V., Cieslewicz, M.J., Donati, C., Medini, D., Ward, N.L., Angiuoli, S.V., Crabtree, J., Jones, A.L., Durkin, A.S., et al.: Genome analysis of multiple pathogenic isolates of Streptococcus agalactiae: implications for the microbial pan-genome. Proc. Natl. Acad. Sci. USA 102(39), 13950\u201313955 (2005)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"3","key":"4_CR32","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/comjnl\/42.3.193","volume":"42","author":"HE Williams","year":"1999","unstructured":"Williams, H.E., Zobel, J.: Compressing integers for fast file access. Comput. J. 42(3), 193\u2013201 (1999)","journal-title":"Comput. J."},{"issue":"6","key":"4_CR33","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"IH Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520\u2013540 (1987)","journal-title":"Commun. ACM"},{"issue":"2","key":"4_CR34","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.cels.2015.08.004","volume":"1","author":"YW Yu","year":"2015","unstructured":"Yu, Y.W., Daniels, N.M., Danko, D.C., Berger, B.: Entropy-scaling search of massive biological data. Cell Syst. 1(2), 130\u2013140 (2015)","journal-title":"Cell Syst."},{"issue":"21","key":"4_CR35","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1093\/bioinformatics\/btt476","volume":"29","author":"AV Zimin","year":"2013","unstructured":"Zimin, A.V., Mar\u00e7ais, G., Puiu, D., Roberts, M., Salzberg, S.L., Yorke, J.A.: The MaSuRCA genome assembler. Bioinformatics 29(21), 2669\u20132677 (2013)","journal-title":"Bioinformatics"},{"issue":"3","key":"4_CR36","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56970-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T08:15:19Z","timestamp":1601885719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56970-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319569697","9783319569703"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56970-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}