{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:07:57Z","timestamp":1742954877721,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319172958"},{"type":"electronic","value":"9783319172965"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17296-5_20","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T14:30:01Z","timestamp":1437748201000},"page":"195-202","source":"Crossref","is-referenced-by-count":0,"title":["Shifted de Bruijn Graphs"],"prefix":"10.1007","author":[{"given":"Ragnar","family":"Freij","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bowe, A., Onodera, T., Sakadane, K., Shibuya, T.: Succinct de Bruijn graphs. In: Algorithms in Bioinformatics. Lecture Notes in Computer Science, pp.\u00a0225\u2013235. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33122-0_18"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"9","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, 9 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1038\/nbt.2023","volume":"29","author":"P. Compeau","year":"2011","unstructured":"Compeau, P., Pevzner, P., Tesler, G.: How to apply de Bruijn graphs to genome assembly. Nat. Biotechnol. 29, 987\u2013991 (2011)","journal-title":"Nat. Biotechnol."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Cooper, J., Graham, R.: Generalized de Bruijn cycles (2004). arXiv:0402324","DOI":"10.1007\/s00026-004-0201-y"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Ehrenborg, R., Kitaev, S., Steingr\u00edmsson, E.: Number of cycles in the graph of 312-avoiding permutations (2013). arXiv:1310.1520","DOI":"10.46298\/dmtcs.2378"},{"key":"20_CR6","unstructured":"Flye Saint-Marie, C.: Solution to question\u00a048. l\u2019Interm\u00e9diaire des Math. 1, 107\u2013110 (1894)"},{"key":"20_CR7","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. In: Combinatorics, Paul Erd\u00f6s is Eighty, pp.\u00a01\u201346. J\u00e1nos Bolyai Mathematical Society, Budapest (1993)"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0304-3975(94)90185-6","volume":"131","author":"C. Picoleau","year":"1994","unstructured":"Picoleau, C.: Complexity of the Hamiltonian cycle in regular graph problem. Theor. Comput. Sci. 131(2), 463\u2013473 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1186\/1471-2105-14-313","volume":"14","author":"E. R\u00f6dland","year":"2013","unstructured":"R\u00f6dland, E.: Compact representation of k-mer de Bruijn graphs for genome read assembly. BMC Bioinform. 14, 19 (2013)","journal-title":"BMC Bioinform."},{"key":"20_CR10","first-page":"41","volume":"43","author":"V. Rosenfeld","year":"2001","unstructured":"Rosenfeld, V.: Some spectral properties of the arc-graph. Commun. Math. Comput. Chem. 43, 41\u201348 (2001)","journal-title":"Commun. Math. Comput. Chem."},{"key":"20_CR11","first-page":"71","volume":"45","author":"V. Rosenfeld","year":"2002","unstructured":"Rosenfeld, V.: Enumerating de Bruijn sequences. Commun. Math. Comput. Chem. 45, 71\u201383 (2002)","journal-title":"Commun. Math. Comput. Chem."},{"key":"20_CR12","unstructured":"Stanley, R.: Enumerative Combinatorics, Vol.\u00a02. Cambridge Studies in Advanced Mathematics, vol.\u00a062. Cambridge University Press, New York (1999)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1017\/S030500410002449X","volume":"44","author":"W. Tutte","year":"1948","unstructured":"Tutte, W.: The dissection of equilateral triangles into equilateral triangles. Proc. Camb. Philos. Soc. 44, 71\u201383 (1948)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"20_CR14","first-page":"143","volume":"28","author":"T. van Aardenne-Ehrenfest","year":"1951","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.: Circuits and trees in oriented linear graphs. Simon Stevin 28, 143\u2013173 (1951)","journal-title":"Simon Stevin"}],"container-title":["CIM Series in Mathematical Sciences","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17296-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:21:58Z","timestamp":1675272118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17296-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319172958","9783319172965"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17296-5_20","relation":{},"ISSN":["2364-950X","2364-9518"],"issn-type":[{"type":"print","value":"2364-950X"},{"type":"electronic","value":"2364-9518"}],"subject":[],"published":{"date-parts":[[2015]]}}}