{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:34:23Z","timestamp":1773275663949,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642331213","type":"print"},{"value":"9783642331220","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_19","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"236-248","source":"Crossref","is-referenced-by-count":47,"title":["Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter"],"prefix":"10.1007","author":[{"given":"Rayan","family":"Chikhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Rizk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: an efficient data structure for static support lookup tables. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 30\u201339. SIAM (2004)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-23038-7_4","volume-title":"Algorithms in Bioinformatics","author":"R. Chikhi","year":"2011","unstructured":"Chikhi, R., Lavenier, D.: Localized Genome Assembly from Reads to Scaffolds: Practical Traversal of the Paired String Graph. In: Przytycka, T.M., Sagot, M.-F. (eds.) WABI 2011. LNCS, vol.\u00a06833, pp. 39\u201348. Springer, Heidelberg (2011)"},{"issue":"4","key":"19_CR3","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 (2011)","journal-title":"Bioinformatics"},{"issue":"7","key":"19_CR4","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1038\/nbt.1883","volume":"29","author":"M.G. Grabherr","year":"2011","unstructured":"Grabherr, M.G.: 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":"19_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1089\/cmb.1995.2.291","volume":"2","author":"R.M. Idury","year":"1995","unstructured":"Idury, R.M., Waterman, M.S.: A new algorithm for DNA sequence assembly. Journal of Computational Biology\u00a02(2), 291\u2013306 (1995)","journal-title":"Journal of Computational Biology"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de bruijn graphs. Nature Genetics (2012)","DOI":"10.1038\/ng.1028"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1471-2105-11-21","volume":"11","author":"C. Kingsford","year":"2010","unstructured":"Kingsford, C., Schatz, M.C., Pop, M.: Assembly complexity of prokaryotic genomes using short reads. BMC Bioinformatics\u00a011(1), 21 (2010)","journal-title":"BMC Bioinformatics"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006","author":"A. Kirsch","year":"2006","unstructured":"Kirsch, A., Mitzenmacher, M.: Less Hashing, Same Performance: Building a Better Bloom Filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 456\u2013467. Springer, Heidelberg (2006)"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1101\/gr.097261.109","volume":"20","author":"R. Li","year":"2010","unstructured":"Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K.: De novo assembly of human genomes with massively parallel short read sequencing. Genome Research\u00a020(2), 265 (2010)","journal-title":"Genome Research"},{"issue":"6","key":"19_CR10","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/bioinformatics\/btr011","volume":"27","author":"G. Marais","year":"2011","unstructured":"Marais, G., Kingsford, C.: A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics\u00a027(6), 764\u2013770 (2011)","journal-title":"Bioinformatics"},{"issue":"6","key":"19_CR11","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"},{"key":"19_CR12","first-page":"1112","volume":"arXiv","author":"J. Pell","year":"2011","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. Arxiv preprint arXiv:1112.4193 (2011)","journal-title":"Arxiv preprint"},{"issue":"13","key":"19_CR13","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\u00a027(13), i94\u2013i101 (2011)","journal-title":"Bioinformatics"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-16321-0_14","volume-title":"String Processing and Information Retrieval","author":"P. Peterlongo","year":"2010","unstructured":"Peterlongo, P., Schnel, N., Pisanti, N., Sagot, M.-F., Lacroix, V.: Identifying SNPs without a Reference Genome by Comparing Raw Reads. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 147\u2013158. Springer, Heidelberg (2010)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Peterlongo, P., Chikhi, R.: Mapsembler, targeted and micro assembly of large NGS datasets on a desktop computer. BMC Bioinformatics\u00a0(1), 48 (2012)","DOI":"10.1186\/1471-2105-13-48"},{"issue":"20","key":"19_CR16","doi-asserted-by":"publisher","first-page":"2534","DOI":"10.1093\/bioinformatics\/btq485","volume":"26","author":"G. Rizk","year":"2010","unstructured":"Rizk, G., Lavenier, D.: GASSST: global alignment short sequence search tool. Bioinformatics\u00a026(20), 2534 (2010)","journal-title":"Bioinformatics"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Sacomoto, G., Kielbassa, J., Chikhi, R., Uricaru, R., Antoniou, P., Sagot, M., Peterlongo, P., Lacroix, V.: 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"},{"issue":"6","key":"19_CR18","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1101\/gr.089532.108","volume":"19","author":"J.T. Simpson","year":"2009","unstructured":"Simpson, J.T., Wong, K., Jackman, S.D., Schein, J.E., Jones, S.J.M., Birol, N.: ABySS: a parallel assembler for short read sequence data. Genome Research\u00a019(6), 1117\u20131123 (2009)","journal-title":"Genome Research"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Warren, R.L., Holt, R.A.: Targeted assembly of short sequence reads. PloS One\u00a06(5), e19816 (2011)","DOI":"10.1371\/journal.pone.0019816"},{"key":"19_CR20","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:57Z","timestamp":1620129357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}