{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:30:10Z","timestamp":1773275410182,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56970-3_16","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T00:43:49Z","timestamp":1491871429000},"page":"257-271","source":"Crossref","is-referenced-by-count":20,"title":["Improved Search of Large Transcriptomic Sequencing Databases Using Split Sequence Bloom Trees"],"prefix":"10.1007","author":[{"given":"Brad","family":"Solomon","sequence":"first","affiliation":[]},{"given":"Carl","family":"Kingsford","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","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, 300\u2013302 (2016)","journal-title":"Nat. Biotechnol."},{"issue":"Database issue","key":"16_CR2","doi-asserted-by":"crossref","first-page":"D19","DOI":"10.1093\/nar\/gkq1019","volume":"39","author":"R Leinonen","year":"2011","unstructured":"Leinonen, R., Sugawara, H., Shumway, M., The International Nucleotide Sequence Database Collaboration: The sequence read archive. Nucleic Acids Res. 39(Database issue), D19\u2013D21 (2011)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"16_CR3","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1186\/1471-2105-10-421","volume":"10","author":"C Camacho","year":"2009","unstructured":"Camacho, C., Coulouris, G., Avagyan, V., Ma, N., Papadopoulos, J., Bealer, K., Madden, T.L.: BLAST+: architecture and applications. BMC Bioinform. 10(1), 421 (2009)","journal-title":"BMC Bioinform."},{"key":"16_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation (1994)"},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"issue":"2","key":"16_CR6","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R Grossi","year":"2005","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35(2), 378\u2013407 (2005)","journal-title":"SIAM J. Comput."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S., Xu, B.: Wavelet trees: from theory to practice. In: 2011 First International Conference on Data Compression, Communications and Processing (CCP), pp. 210\u2013221. IEEE (2011)","DOI":"10.1109\/CCP.2011.16"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39, 2 (2007)","journal-title":"ACM Comput. Surv."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/2.881693","volume":"33","author":"N Ziviani","year":"2000","unstructured":"Ziviani, N., Moura, E., Navarro, G., Baeza-Yates, R.: Compression: a key for next-generation text retrieval systems. IEEE Comput. 33, 37\u201344 (2000)","journal-title":"IEEE Comput."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1009934302807","volume":"3","author":"G Navarro","year":"2000","unstructured":"Navarro, G., Moura, E., Neubert, M., Ziviani, N., Baeza-Yates, R.: Adding compression to block addressing inverted indexes. Inf. Retrieval 3, 49\u201377 (2000)","journal-title":"Inf. Retrieval"},{"issue":"7","key":"16_CR11","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(7), 627\u2013630 (2012)","journal-title":"Nat. Biotechnol."},{"issue":"13","key":"16_CR12","doi-asserted-by":"crossref","first-page":"i283","DOI":"10.1093\/bioinformatics\/btt214","volume":"29","author":"NM Daniels","year":"2013","unstructured":"Daniels, N.M., Gallant, A., Peng, J., Cowen, L.J., Baym, M., Berger, B.: Compressive genomics for protein databases. Bioinformatics 29(13), i283\u2013i290 (2013)","journal-title":"Bioinformatics"},{"issue":"2","key":"16_CR13","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":"1","key":"16_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13015-016-0066-8","volume":"11","author":"G Holley","year":"2016","unstructured":"Holley, G., Wittler, R., Stoye, J.: Bloom filter trie: an alignment-free and reference-free data structure for pan-genome storage. Algorithms Mol. Biol. 11(1), 1 (2016)","journal-title":"Algorithms Mol. Biol."},{"issue":"7","key":"16_CR15","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. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"16_CR16","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2005","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2005)","journal-title":"Internet Math."},{"key":"16_CR17","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, SODA 2002, Philadelphia, PA, USA, pp. 233\u2013242. Society for Industrial and Applied Mathematics (2002)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-68552-4_12","volume-title":"Experimental Algorithms","author":"S Vigna","year":"2008","unstructured":"Vigna, S.: Broadword implementation of rank\/select queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 154\u2013168. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68552-4_12"},{"key":"16_CR19","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: 10.1007\/978-3-319-07959-2_28"},{"issue":"2","key":"16_CR20","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1089\/cmb.2006.13.296","volume":"13","author":"K Rasmussen","year":"2006","unstructured":"Rasmussen, K., Stoye, J., Myers, E.: Efficient q-gram filters for finding all $$\\epsilon $$ -matches over a given length. J. Comput. Biol. 13(2), 296\u2013308 (2006)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"16_CR21","doi-asserted-by":"crossref","first-page":"R30","DOI":"10.1186\/gb-2013-14-3-r30","volume":"14","author":"N Philippe","year":"2013","unstructured":"Philippe, N., Salson, M., Commes, T., Rivals, E.: CRAC: an integrated approach to the analysis of RNA-seq reads. Genome Biol. 14(3), R30 (2013)","journal-title":"Genome Biol."},{"issue":"7","key":"16_CR22","doi-asserted-by":"crossref","first-page":"e101271","DOI":"10.1371\/journal.pone.0101271","volume":"9","author":"Q Zhang","year":"2014","unstructured":"Zhang, Q., Pell, J., Canino-Koning, R., Howe, A.C., Brown, C.T.: These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure. PLoS ONE 9(7), e101271 (2014)","journal-title":"PLoS ONE"},{"key":"16_CR23","unstructured":"Brown, T., Howe, A., Zhang, Q., Pyrkosz, A., Brom, T.: A reference-free algorithm for computational normalization of shotgun sequencing data. arXiv:1203.4802 [q-bio.GN]"},{"key":"16_CR24","doi-asserted-by":"crossref","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, 462\u2013464 (2014)","journal-title":"Nat. Biotechnol."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:37:10Z","timestamp":1498387030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56970-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319569697","9783319569703"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56970-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}