{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:26:14Z","timestamp":1773271574439,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319075655","type":"print"},{"value":"9783319075662","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_10","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"89-99","source":"Crossref","is-referenced-by-count":15,"title":["From Indexing Data Structures to de Bruijn Graphs"],"prefix":"10.1007","author":[{"given":"Bastien","family":"Cazaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Rivals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Apostolico, A.: The myriad virtues of suffix trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO Advanced Science Institutes, Series F, vol.\u00a012, pp. 85\u201396. Springer (1985)","DOI":"10.1007\/978-3-642-82456-2_6"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1089\/cmb.2012.0021","volume":"19","author":"A. Bankevich","year":"2012","unstructured":"Bankevich, A., Nurk, S., Antipov, D., Gurevich, A.A., et al.: SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. Journal of Computational Biology\u00a019(5), 455\u2013477 (2012)","journal-title":"Journal of Computational Biology"},{"key":"10_CR3","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":"10_CR4","doi-asserted-by":"crossref","unstructured":"Cazaux, B., Lecroq, T., Rivals, E.: From Indexing Data Structures to de Bruijn Graphs. Technical report, lirmm-00950983 (February 2014)","DOI":"10.1007\/978-3-319-07566-2_10"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chikhi, R., Limasset, A., Jackman, S., Simpson, J., Medvedev, P.: On the representation of de Bruijn graphs. ArXiv e-prints (January 2014)","DOI":"10.1007\/978-3-319-05269-4_4"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"22","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 for Molecular Biology\u00a08, 22 (2013)","journal-title":"Algorithms for Molecular Biology"},{"issue":"4","key":"10_CR7","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"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.5486\/PMD.1950.1.2-4.31","volume":"1","author":"N. Bruijn de","year":"1950","unstructured":"de Bruijn, N.: On bases for the set of integers. Publ. Math. Debrecen\u00a01, 232\u2013242 (1950)","journal-title":"Publ. Math. Debrecen"},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-40453-5_26","volume-title":"Algorithms in Bioinformatics","author":"T. Onodera","year":"2013","unstructured":"Onodera, T., Sadakane, K., Shibuya, T.: Detecting superbubbles in assembly graphs. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol.\u00a08126, pp. 338\u2013348. Springer, Heidelberg (2013)"},{"issue":"33","key":"10_CR12","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., Brown, C.: Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc. Natl Acad. Sci. USA\u00a0109(33), 13272\u201313277 (2012)","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-12683-3_28","volume-title":"Research in Computational Molecular Biology","author":"Y. Peng","year":"2010","unstructured":"Peng, Y., Leung, H.C.M., Yiu, S.M., Chin, F.Y.L.: IDBA \u2013 A Practical Iterative de Bruijn Graph De Novo Assembler. In: Berger, B. (ed.) RECOMB 2010. LNCS, vol.\u00a06044, pp. 426\u2013440. Springer, Heidelberg (2010)"},{"issue":"17","key":"10_CR14","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"P. Pevzner","year":"2001","unstructured":"Pevzner, P., Tang, H., Waterman, M.: An Eulerian path approach to DNA fragment assembly. Proc. Natl Acad. Sci. USA\u00a098(17), 9748\u20139753 (2001)","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1186\/1471-2105-14-313","volume":"14","author":"E.A. R\u00f8dland","year":"2013","unstructured":"R\u00f8dland, E.A.: Compact representation of k-mer de Bruijn graphs for genome read assembly. BMC Bioinformatics\u00a014, 313 (2013)","journal-title":"BMC Bioinformatics"},{"issue":"10","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1093\/bioinformatics\/btq151","volume":"26","author":"L. Salmela","year":"2010","unstructured":"Salmela, L.: Correction of sequencing errors in a mixed set of reads. Bioinformatics\u00a026(10), 1284\u20131290 (2010)","journal-title":"Bioinformatics"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Simpson, J.T., Durbin, R.: Efficient construction of an assembly string graph using the FM-index. Bioinformatics 26(12), i367\u2013i373 (2010)","DOI":"10.1093\/bioinformatics\/btq217"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T06:26:31Z","timestamp":1689315991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}