{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:00:39Z","timestamp":1761292839052},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_50","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:41:31Z","timestamp":1312879291000},"page":"595-606","source":"Crossref","is-referenced-by-count":2,"title":["Constructing Orthogonal de Bruijn Sequences"],"prefix":"10.1007","author":[{"given":"Yaw-Ling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Ward","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bharat","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0167-5060(08)70494-1","volume":"3","author":"J.-C. Bermond","year":"1978","unstructured":"Bermond, J.-C.: Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Ann. Discrete Math.\u00a03, 21\u201328 (1978); Pr\u00e9sent\u00e9au Cambridge Combinatorial Conf., Advances in Graph Theory , Trinity College, Cambridge, England (1977)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"50_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0166-218X(97)00095-4","volume":"84","author":"J.-C. Bermond","year":"1998","unstructured":"Bermond, J.-C., Darrot, E., Delmas, O., Perennes, S.: Hamilton circuits in the directed wrapped butterfly network. Discrete Applied Mathematics\u00a084(1), 21\u201342 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"50_CR3","unstructured":"Bond, J., Iv\u00e1nyi, A.: Modelling of interconnection networks using de bruijn graphs. In: Iv\u00e1nyi, A. (ed.) Third Conference of Program Designer, Budapest (1987)"},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1038\/nbt0607-627","volume":"25","author":"H. Bugl","year":"2007","unstructured":"Bugl, H., Danner, J.P., Molinari, R.J., Mulligan, J.T., Park, H.-O., Reichert, B., Roth, D.A., Wagner, R., Budowle, B., Scripp, R.M., Smith, J.A.L., Steele, S.J., Church, G., Endy, D.: DNA synthesis and biological security. Nature Biotechnology\u00a025, 627\u2013629 (2007)","journal-title":"Nature Biotechnology"},{"key":"50_CR5","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1126\/science.1155761","volume":"320","author":"J.R. Coleman","year":"2008","unstructured":"Coleman, J.R., Papamichial, D., Futcher, B., Skiena, S., Mueller, S., Wimmer, E.: Virus attenuation by genome-scale changes in codon-pair bias. Science\u00a0320, 1784\u20131787 (2008)","journal-title":"Science"},{"issue":"2","key":"50_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tibtech.2008.10.007","volume":"27","author":"M.J. Czar","year":"2009","unstructured":"Czar, M.J., Anderson, J.C., Bader, J.S., Peccoud, J.: Gene synthesis demystified. Trends in Biotechnology\u00a027(2), 63\u201372 (2009)","journal-title":"Trends in Biotechnology"},{"key":"50_CR7","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen\u00a049, 758\u2013764 (1946)","journal-title":"Koninklijke Nederlandse Akademie v. Wetenschappen"},{"key":"50_CR8","unstructured":"Gibson, D., et al.: Creation of a bacterial cell controlled by a chemically synthesized genome. Science (2010), doi:10.1125.\/science.1190719"},{"key":"50_CR9","series-title":"ATO ASI Ser. C","first-page":"95","volume-title":"Cycles and Rays, Proceeding Colloquium Montreal, 1987","author":"H. Fleischner","year":"1990","unstructured":"Fleischner, H., Jackson, B.: Compatible euler tours in eulerian digraphs. In: Cycles and Rays, Proceeding Colloquium Montreal, 1987. ATO ASI Ser. C, pp. 95\u2013100. Kluwer Academic Publishers, Dordrecht (1990)"},{"key":"50_CR10","unstructured":"Golomb, S.W.: Shift Register Sequences. Holden-Day (1967)"},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1112\/jlms\/s1-21.3.167","volume":"21","author":"I.J. Good","year":"1946","unstructured":"Good, I.J.: Normal recurring decimals. J. London Math. Soc.\u00a021, 167\u2013172 (1946)","journal-title":"J. London Math. Soc."},{"key":"50_CR12","unstructured":"K\u00e1sa, Z.: On arc-disjoint hamiltonian cycles in de Bruijn graphs. CoRR abs\/1003.1520 (2010)"},{"key":"50_CR13","unstructured":"Kautz, W.H.: Bounds on directed (d,k) graphs. In: Theory of Cellular Logic Networks and Machines, AFCKL-68-0668 Final Rep., vol. 24, pp. 20\u201328 (1968)"},{"key":"50_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0021-9800(67)80101-7","volume":"3","author":"D.E. Knuth","year":"1967","unstructured":"Knuth, D.E.: Oriented subtrees of an arc digraph. Journal of Combinatorial Theory\u00a03, 309\u2013314 (1967)","journal-title":"Journal of Combinatorial Theory"},{"key":"50_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-13509-5_29","volume-title":"Combinatorial Pattern Matching","author":"P. Montes","year":"2010","unstructured":"Montes, P., Memelli, H., Ward, C., Kim, J., Mitchell, J., Skiena, S.: Optimizing restriction site placement for synthetic genomes. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 323\u2013337. Springer, Heidelberg (2010)"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Mueller, S., Coleman, R., Papamichail, D., Ward, C., Nimnual, A., Futcher, B., Skiena, S., Wimmer, E.: Live attenuated influenza vaccines by computer-aided rational design. Nature Biotechnology\u00a028 (2010)","DOI":"10.1038\/nbt.1636"},{"key":"50_CR17","volume-title":"Feedback Shift Registers","author":"C. Ronse","year":"1984","unstructured":"Ronse, C.: Feedback Shift Registers. Springer, Berlin (1984)"},{"key":"50_CR18","first-page":"19","volume":"24","author":"V.R. Rosenfeld","year":"2002","unstructured":"Rosenfeld, V.R.: Enumerating Kautz sequences. Kragujevac Journal of Mathematics\u00a024, 19\u201341 (2002)","journal-title":"Kragujevac Journal of Mathematics"},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"Rowley, R., Bose, B.: Edge-disjoint Hamiltonian cycles in de Bruijn networks. In: Distributed Memory Computing Conference, pp. 707\u2013709 (1991)","DOI":"10.1109\/DMCC.1991.633359"},{"issue":"4","key":"50_CR20","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1142\/S0129626493000411","volume":"3","author":"R. Rowley","year":"1993","unstructured":"Rowley, R., Bose, B.: On the number of arc-disjoint Hamiltonian circuits in the de Bruijn graph. Parallel Processing Letters\u00a03(4), 375\u2013380 (1993)","journal-title":"Parallel Processing Letters"},{"key":"50_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/S030500410002449X","volume":"44","author":"W.T. Tutte","year":"1948","unstructured":"Tutte, W.T.: The dissection of equilateral triangles into equilateral triangles. Mathematical Proceedings of the Cambridge Philosophical Society\u00a044, 463\u2013482 (1948)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"50_CR22","first-page":"203","volume":"28","author":"T. Aardenne-Ehrenfest van","year":"1951","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin: Wisen Natuurkundig Tijdschrift\u00a028, 203\u2013217 (1951)","journal-title":"Simon Stevin : Wisen Natuurkundig Tijdschrift"},{"key":"50_CR23","volume-title":"Introduction to Graph Theory","author":"D. West","year":"2000","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T03:22:05Z","timestamp":1554002525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}