{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:28:06Z","timestamp":1773271686300,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642404528","type":"print"},{"value":"9783642404535","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40453-5_28","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:09:49Z","timestamp":1376622589000},"page":"364-376","source":"Crossref","is-referenced-by-count":28,"title":["Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Salikhov","sequence":"first","affiliation":[]},{"given":"Gustavo","family":"Sacomoto","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5331","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1126\/science.277.5331.1453","volume":"277","author":"F.R. Blattner","year":"1997","unstructured":"Blattner, F.R., Plunkett, G., Bloch, C.A., et al.: The complete genome sequence of Escherichia coli k-12. Science\u00a0277(5331), 1453\u20131462 (1997)","journal-title":"Science"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-33122-0_18","volume-title":"Algorithms in Bioinformatics","author":"A. Bowe","year":"2012","unstructured":"Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol.\u00a07534, pp. 225\u2013235. Springer, Heidelberg (2012)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-33122-0_19","volume-title":"Algorithms in Bioinformatics","author":"R. Chikhi","year":"2012","unstructured":"Chikhi, R., Rizk, G.: Space-efficient and exact de bruijn graph representation based on a bloom filter. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol.\u00a07534, pp. 236\u2013248. Springer, Heidelberg (2012)"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1093\/bioinformatics\/btq697","volume":"27","author":"T.C. Conway","year":"2011","unstructured":"Conway, T.C., Bromage, A.J.: Succinct data structures for assembling large genomes. Bioinformatics\u00a027(4), 479\u2013486 (2011)","journal-title":"Bioinformatics"},{"issue":"7","key":"28_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1038\/nbt.1883","volume":"29","author":"M.G. Grabherr","year":"2011","unstructured":"Grabherr, M.G., Haas, B.J., Yassour, M., Levin, J.Z., et al.: Full-length transcriptome assembly from RNA-Seq data without a reference genome. Nat. Biotech.\u00a029(7), 644\u2013652 (2011)","journal-title":"Nat. Biotech."},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1038\/ng.1028","volume":"44","author":"Z. Iqbal","year":"2012","unstructured":"Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat. Genet.\u00a044(2), 226\u2013232 (2012)","journal-title":"Nat. Genet."},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/rsa.20208","volume":"33","author":"A. Kirsch","year":"2008","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: Building a better bloom filter. Random Struct. Algorithms\u00a033(2), 187\u2013218 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"6","key":"28_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","volume":"95","author":"J.R. Miller","year":"2010","unstructured":"Miller, J.R., Koren, S., Sutton, G.: Assembly algorithms for next-generation sequencing data. Genomics\u00a095(6), 315\u2013327 (2010)","journal-title":"Genomics"},{"issue":"33","key":"28_CR9","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. Natl. Acad. Sci. U.S.A.\u00a0109(33), 13272\u201313277 (2012)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"13","key":"28_CR10","doi-asserted-by":"crossref","first-page":"i94","DOI":"10.1093\/bioinformatics\/btr216","volume":"27","author":"Y. Peng","year":"2011","unstructured":"Peng, Y., Leung, H.C.M., Yiu, S.M., Chin, F.Y.L.: Meta-IDBA: a de novo assembler for metagenomic data. Bioinformatics 27(13), i94\u2013i101 (2011)","journal-title":"Bioinformatics"},{"issue":"17","key":"28_CR11","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"P.A. Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. U.S.A.\u00a098(17), 9748\u20139753 (2001)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-03351-3_25","volume-title":"Computer Science - Theory and Applications","author":"E. Porat","year":"2009","unstructured":"Porat, E.: An optimal Bloom filter replacement based on matrix solving. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol.\u00a05675, pp. 263\u2013273. Springer, Heidelberg (2009)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Rizk, G., Lavenier, D., Chikhi, R.: DSK: k-mer counting with very low memory usage. Bioinformatics (2013)","DOI":"10.1093\/bioinformatics\/btt020"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Sacomoto, G., Kielbassa, J., Chikhi, R., Uricaru, R., et al.: KISSPLICE: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinformatics\u00a013(suppl. 6), S5 (2012)","DOI":"10.1186\/1471-2105-13-S6-S5"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Ye, C., Ma, Z., Cannon, C., Pop, M., Yu, D.: Exploiting sparseness in de novo genome assembly. BMC Bioinformatics\u00a013(suppl. 6), S1 (2012)","DOI":"10.1186\/1471-2105-13-S6-S1"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40453-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T01:17:29Z","timestamp":1596331049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40453-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404528","9783642404535"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40453-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}