{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:11Z","timestamp":1725544751092},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_67","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"737-744","source":"Crossref","is-referenced-by-count":3,"title":["Minimal Eulerian Circuit in a Labeled Digraph"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"Moreno","sequence":"first","affiliation":[]},{"given":"Mart\u00edn","family":"Matamala","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Graph theory","author":"W.T. Tutte","year":"1984","unstructured":"Tutte, W.T.: Graph theory. Encyclopedia of Mathematics and its Applications, vol.\u00a021. Addison-Wesley Publishing Company Advanced Book Program, Reading (1984)"},{"key":"67_CR2","first-page":"250","volume-title":"ISLPED","author":"W.C. Cheng","year":"2000","unstructured":"Cheng, W.C., Pedram, M.: Power-optimal encoding fod DRAM address bus. In: ISLPED, pp. 250\u2013252. ACM, New York (2000)"},{"issue":"1-3","key":"67_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J. Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci.\u00a0295(1-3), 223\u2013232 (2003); Mathematical foundations of computer science (Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, 2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"67_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00109-2","volume":"98","author":"J. Blazewicz","year":"1999","unstructured":"Blazewicz, J., Hertz, A., Kobler, D., de Werra, D.: On some properties of DNA graphs. Discrete Appl. Math.\u00a098(1-2), 1\u201319 (1999)","journal-title":"Discrete Appl. Math."},{"key":"67_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"P.A. Pevzner","year":"1989","unstructured":"Pevzner, P.A.: L-tuple DNA sequencing: computer analysis. J. Biomol. Struct. Dyn.\u00a07, 63\u201373 (1989)","journal-title":"J. Biomol. Struct. Dyn."},{"issue":"17","key":"67_CR6","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"P.A. Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An eulerian path approach to DNA fragment assembly. Proceedings of the National Academy of Sciences\u00a098(17), 9748\u20139753 (2001)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"67_CR7","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Nederl. Akad. Wetensch., Proc.\u00a049, 758\u2013764 (1946)","journal-title":"Nederl. Akad. Wetensch., Proc."},{"issue":"5","key":"67_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1038\/scientificamerican0561-148","volume":"204","author":"S.K. Stein","year":"1961","unstructured":"Stein, S.K.: The mathematician as an explorer. Sci. Amer.\u00a0204(5), 148\u2013158 (1961)","journal-title":"Sci. Amer."},{"issue":"3","key":"67_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P","volume":"30","author":"J.C. Bermond","year":"1997","unstructured":"Bermond, J.C., Dawes, R.W., Ergincan, F.\u00d6.: De Bruijn and Kautz bus networks. Networks\u00a030(3), 205\u2013218 (1997)","journal-title":"Networks"},{"issue":"1-3","key":"67_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"F. Chung","year":"1992","unstructured":"Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discrete Math.\u00a0110(1-3), 43\u201359 (1992)","journal-title":"Discrete Math."},{"key":"67_CR11","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W.H. Freeman and Co., San Francisco (1979); A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences"},{"key":"67_CR12","volume-title":"Algorithmic graph theory","author":"A. Gibbons","year":"1985","unstructured":"Gibbons, A.: Algorithmic graph theory. Cambridge University Press, Cambridge (1985)"},{"key":"67_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ipl.2005.05.028","volume":"96","author":"E. Moreno","year":"2005","unstructured":"Moreno, E.: De Bruijn sequences and de Bruijn graphs for a general language. Inf. Process. Lett.\u00a096, 214\u2013219 (2005)","journal-title":"Inf. Process. Lett."},{"key":"67_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-30559-0_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Moreno","year":"2004","unstructured":"Moreno, E., Matamala, M.: Minimal de Bruijn sequence in a language with forbidden subtrings. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 168\u2013176. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:30Z","timestamp":1555445910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11682462_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}