{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:34:29Z","timestamp":1773275669159,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319569697","type":"print"},{"value":"9783319569703","type":"electronic"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56970-3_17","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T00:43:49Z","timestamp":1491871429000},"page":"272-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["AllSome Sequence Bloom Trees"],"prefix":"10.1007","author":[{"given":"Chen","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert S.","family":"Harris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rayan","family":"Chikhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Medvedev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"key":"17_CR1","unstructured":"SBT-SK software and data. \n                    http:\/\/www.cs.cmu.edu\/%7Eckingsf\/software\/bloomtree\/\n                    \n                  . Accessed 01 July 2016"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/bioinformatics\/btv603","volume":"32","author":"U Baier","year":"2015","unstructured":"Baier, U., Beller, T., Ohlebusch, E.: Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform. Bioinformatics 32, 497\u2013504 (2015)","journal-title":"Bioinformatics"},{"issue":"7","key":"17_CR3","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":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1038\/nbt.3519","volume":"34","author":"NL Bray","year":"2016","unstructured":"Bray, N.L., Pimentel, H., Melsted, P., Pachter, L.: Near-optimal probabilistic RNA-seq quantification. Nat. Biotechnol. 34(5), 525\u2013527 (2016)","journal-title":"Nat. Biotechnol."},{"issue":"5","key":"17_CR5","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1002\/spe.2325","volume":"46","author":"S Chambi","year":"2015","unstructured":"Chambi, S., Lemire, D., Kaser, O., Godin, R.: Better bitmap performance with roaring bitmaps. Softw. Pract. Exp. 46(5), 709\u2013719 (2015)","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1748-7188-8-22","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(1), 1 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Consortium, C.P.G., et al: Computational pan-genomics: status, promises and challenges. Brief. Bioinform. bbw089 (2016)","DOI":"10.1093\/bib\/bbw089"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.is.2015.01.002","volume":"54","author":"A Crainiceanu","year":"2015","unstructured":"Crainiceanu, A., Lemire, D.: Bloofi: multidimensional bloom filters. Inf. Syst. 54, 311\u2013324 (2015)","journal-title":"Inf. Syst."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1101\/gr.211748.116","volume":"27","author":"DD Dolle","year":"2016","unstructured":"Dolle, D.D., Liu, Z., Cotten, M.L., Simpson, J.T., Iqbal, Z., Durbin, R., McCarthy, S., Keane, T.: Using reference-free compressed data structures to analyse sequencing reads from thousands of human genomes. Genome Res. 27, 300\u2013309 (2016)","journal-title":"Genome Res."},{"key":"17_CR10","first-page":"35","volume":"34","author":"C Ernst","year":"2013","unstructured":"Ernst, C., Rahmann, S.: PanCake: a data structure for pangenomes. Ger. Conf. Bioinform. 34, 35\u201345 (2013)","journal-title":"Ger. Conf. Bioinform."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Cham (2014). doi:\n                    10.1007\/978-3-319-07959-2_28"},{"key":"17_CR12","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":"17_CR13","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). doi:\n                    10.1007\/978-3-662-48221-6_16"},{"issue":"9","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1093\/bioinformatics\/bth078","volume":"20","author":"MJ Hoon de","year":"2004","unstructured":"de Hoon, M.J., Imoto, S., Nolan, J., Miyano, S.: Open source clustering software. Bioinformatics 20(9), 1453\u20131454 (2004)","journal-title":"Bioinformatics"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"D19","DOI":"10.1093\/nar\/gkq1019","volume":"39","author":"R Leinonen","year":"2010","unstructured":"Leinonen, R., Sugawara, H., Shumway, M.: The sequence read archive. Nucleic Acids Res. 39, D19\u2013D21 (2010)","journal-title":"Nucleic Acids Res."},{"issue":"12","key":"17_CR16","doi-asserted-by":"publisher","first-page":"i174","DOI":"10.1093\/bioinformatics\/btw266","volume":"32","author":"B Liu","year":"2016","unstructured":"Liu, B., Zhu, D., Wang, Y.: deBWT: parallel construction of Burrows-Wheeler Transform for large collection of genomes with de Bruijn-branch encoding. Bioinformatics 32(12), i174\u2013i182 (2016)","journal-title":"Bioinformatics"},{"issue":"7","key":"17_CR17","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1038\/nbt.2241","volume":"30","author":"PR Loh","year":"2012","unstructured":"Loh, P.R., Baym, M., Berger, B.: Compressive genomics. Nat. Biotechnol. 30(7), 627\u2013630 (2012)","journal-title":"Nat. Biotechnol."},{"key":"17_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139940023","volume-title":"Genome-Scale Algorithm Design","author":"V M\u00e4kinen","year":"2015","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design. Cambridge University Press, Cambridge (2015)"},{"issue":"6","key":"17_CR19","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"},{"key":"17_CR20","unstructured":"Marchet, C., Limasset, A., Bittner, L., Peterlongo, P.: A resource-frugal probabilistic dictionary and applications in (meta) genomics (2016). arXiv preprint: \n                    arXiv:1605.08319"},{"issue":"24","key":"17_CR21","doi-asserted-by":"publisher","first-page":"3476","DOI":"10.1093\/bioinformatics\/btu756","volume":"30","author":"S Marcus","year":"2014","unstructured":"Marcus, S., Lee, H., Schatz, M.C.: SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips. Bioinformatics 30(24), 3476\u20133483 (2014)","journal-title":"Bioinformatics"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1186\/1471-2105-12-333","volume":"12","author":"P Melsted","year":"2011","unstructured":"Melsted, P., Pritchard, J.K.: Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinform. 12(1), 333 (2011)","journal-title":"BMC Bioinform."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Minkin, I., Pham, S., Medvedev, P.: TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes. Bioinformatics btw609 (2016)","DOI":"10.1093\/bioinformatics\/btw609"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Murray, K.D., Webers, C., Ong, C.S., Borevitz, J.O., Warthmann, N.: kWIP: the k-mer weighted inner product, a de novo estimator of genetic similarity (2016). bioRxiv: 075481","DOI":"10.1101\/075481"},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1009934302807","volume":"3","author":"G Navarro","year":"2000","unstructured":"Navarro, G., De Moura, E.S., Neubert, M., Ziviani, N., Baeza-Yates, R.: Adding compression to block addressing inverted indexes. Inf. Retr. 3(1), 49\u201377 (2000)","journal-title":"Inf. Retr."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Nellore, A., Collado-Torres, L., Jaffe, A.E., Alquicira-Hern\u00e1ndez, J., Wilks, C., Pritt, J., Morton, J., Leek, J.T., Langmead, B.: Rail-RNA: scalable analysis of RNA-seq splicing and coverage. Bioinformatics btw575 (2016)","DOI":"10.1093\/bioinformatics\/btw575"},{"issue":"5","key":"17_CR27","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."},{"key":"17_CR28","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 233\u2013242. Society for Industrial and Applied Mathematics (2002)"},{"issue":"9","key":"17_CR29","first-page":"1","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), 1 (2014)","journal-title":"BMC Bioinform."},{"key":"17_CR30","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). doi:\n                    10.1007\/978-3-642-40453-5_28"},{"issue":"3","key":"17_CR31","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1038\/nbt.3442","volume":"34","author":"B Solomon","year":"2016","unstructured":"Solomon, B., Kingsford, C.: Fast search of thousands of short-read sequencing experiments. Nat. Biotechnol. 34(3), 300\u2013302 (2016)","journal-title":"Nat. Biotechnol."},{"issue":"13","key":"17_CR32","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"},{"key":"17_CR33","unstructured":"Sun, C., Harris, R.S., Chikhi, R., Medvedev, P.: Allsome sequence bloom trees. bioRxiv (2016). \n                    http:\/\/biorxiv.org\/content\/early\/2016\/12\/02\/090464"},{"issue":"3","key":"17_CR34","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1038\/nprot.2012.016","volume":"7","author":"C Trapnell","year":"2012","unstructured":"Trapnell, C., Roberts, A., Goff, L., Pertea, G., Kim, D., Kelley, D.R., Pimentel, H., Salzberg, S.L., Rinn, J.L., Pachter, L.: Differential gene and transcript expression analysis of RNA-seq experiments with TopHat and Cufflinks. Nat. Protoc. 7(3), 562\u2013578 (2012)","journal-title":"Nat. Protoc."},{"issue":"2","key":"17_CR35","doi-asserted-by":"publisher","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":"11","key":"17_CR36","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/2.881693","volume":"33","author":"N Ziviani","year":"2000","unstructured":"Ziviani, N., de Moura, E.S., Navarro, G., Baeza-Yates, R.: Compression: a key for next-generation text retrieval systems. IEEE Comput. 33(11), 37\u201344 (2000)","journal-title":"IEEE Comput."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56970-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:55:00Z","timestamp":1558317300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56970-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319569697","9783319569703"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56970-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/groups.csail.mit.edu\/cb\/recomb2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}