{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:01:35Z","timestamp":1748923295345,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319319568"},{"type":"electronic","value":"9783319319575"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-31957-5_10","type":"book-chapter","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T17:26:45Z","timestamp":1460050005000},"page":"137-151","source":"Crossref","is-referenced-by-count":1,"title":["Improving Bloom Filter Performance on Sequence Data Using $$k$$ -mer Bloom Filters"],"prefix":"10.1007","author":[{"given":"David","family":"Pellow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darya","family":"Filippova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Kingsford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,8]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","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(1), 288 (2015)","journal-title":"BMC Bioinform."},{"issue":"7","key":"10_CR2","doi-asserted-by":"publisher","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. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2004)","journal-title":"Internet Math."},{"issue":"22","key":"10_CR4","first-page":"1","volume":"8","author":"R Chikhi","year":"2013","unstructured":"Chikhi, R., Rizk, G.: Space-efficient and exact de Bruijn graph representation based on a Bloom filter. Algorithms Mol. Biol. 8(22), 1 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1093\/bioinformatics\/btu030","volume":"30","author":"Y Heo","year":"2014","unstructured":"Heo, Y., Wu, X.L., Chen, D., Ma, J., Hwu, W.M.: BLESS: Bloom filter-based error correction solution for high-throughput sequencing reads. Bioinformatics 30, 1354\u20131362 (2014)","journal-title":"Bioinformatics"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-662-48221-6_16","volume-title":"Algorithms in Bioinformatics","author":"G Holley","year":"2015","unstructured":"Holley, G., Wittler, R., Stoye, J.: Bloom filter trie \u2013 a data structure for pan-genome storage. In: Pop, M., Touzet, H. (eds.) WABI 2015. LNCS, vol. 9289, pp. 217\u2013230. Springer, Heidelberg (2015)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-92995-6_13","volume-title":"Practical Aspects of Declarative Languages","author":"K Malde","year":"2008","unstructured":"Malde, K., O\u2019Sullivan, B.: Using Bloom filters for large scale gene sequence analysis in Haskell. In: Gill, A., Swift, T. (eds.) PADL 2009. LNCS, vol. 5418, pp. 183\u2013194. Springer, Heidelberg (2008)"},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/bioinformatics\/btr011","volume":"27","author":"G Mar\u00e7ais","year":"2011","unstructured":"Mar\u00e7ais, G., Kingsford, C.: A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 27(6), 764\u2013770 (2011)","journal-title":"Bioinformatics"},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1038\/nbt.2862","volume":"32","author":"R Patro","year":"2014","unstructured":"Patro, R., Mount, S.M., Kingsford, C.: Sailfish enables alignment-free isoform quantification from RNA-seq reads using lightweight algorithms. Nat. Biotechnol. 32(5), 462\u2013464 (2014)","journal-title":"Nat. Biotechnol."},{"issue":"33","key":"10_CR10","doi-asserted-by":"publisher","first-page":"13272","DOI":"10.1073\/pnas.1121464109","volume":"109","author":"J Pell","year":"2012","unstructured":"Pell, J., Hintze, A., Canino-Koning, R., Howe, A., Tiedje, J.M., Brown, C.T.: Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc. Nat. Acad. Sci. 109(33), 13272\u201313277 (2012)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"Suppl 9","key":"10_CR11","doi-asserted-by":"publisher","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(Suppl 9), S7 (2014)","journal-title":"BMC Bioinform."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-40453-5_28","volume-title":"Algorithms in Bioinformatics","author":"K Salikhov","year":"2013","unstructured":"Salikhov, K., Sacomoto, G., Kucherov, G.: Using cascading Bloom filters to improve the memory usage for de Brujin graphs. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 364\u2013376. Springer, Heidelberg (2013)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Shi, H., Schmidt, B., Liu, W., M\u00fcller-Wittig, W.: Accelerating error correction in high-throughput short-read DNA sequencing data with CUDA. In: IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2009), pp. 1\u20138. IEEE (2009)","DOI":"10.1109\/IPDPS.2009.5160924"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Solomon, B., Kingsford, C.: Large-scale search of transcriptomic read sets with sequence bloom trees. bioRxiv, p. 017087 (2015)","DOI":"10.1101\/017087"},{"issue":"11","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-014-0509-9","volume":"15","author":"L Song","year":"2014","unstructured":"Song, L., Florea, L., Langmead, B.: Lighter: fast and memory-efficient sequencing error correction without counting. Genome Biol. 15(11), 1\u201313 (2014)","journal-title":"Genome Biol."},{"issue":"13","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1093\/bioinformatics\/btq230","volume":"26","author":"H Stranneheim","year":"2010","unstructured":"Stranneheim, H., K\u00e4ller, M., Allander, T., Andersson, B., Arvestad, L., Lundeberg, J.: Classification of DNA sequences using Bloom filters. Bioinformatics 26(13), 1595\u20131600 (2010)","journal-title":"Bioinformatics"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"R46","DOI":"10.1186\/gb-2014-15-3-r46","volume":"15","author":"DE Wood","year":"2014","unstructured":"Wood, D.E., Salzberg, S.L.: Kraken: ultrafast metagenomic sequence classification using exact alignments. Genome Biol. 15(3), R46 (2014)","journal-title":"Genome Biol."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-05269-4_31","volume-title":"Research in Computational Molecular Biology","author":"YW Yu","year":"2014","unstructured":"Yu, Y.W., Yorukoglu, D., Berger, B.: Traversing the k-mer landscape of NGS read datasets for quality score sparsification. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 385\u2013399. Springer, Heidelberg (2014)"},{"issue":"5","key":"10_CR19","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"DR Zerbino","year":"2008","unstructured":"Zerbino, D.R., Birney, E.: Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18(5), 821\u2013829 (2008)","journal-title":"Genome Res."}],"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-31957-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T07:31:22Z","timestamp":1748849482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31957-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319319568","9783319319575"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31957-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}