{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:48:14Z","timestamp":1773683294969,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4733,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0166-218x(00)00190-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:13:06Z","timestamp":1027602786000},"page":"63-96","source":"Crossref","is-referenced-by-count":21,"title":["Euler circuits and DNA sequencing by hybridization"],"prefix":"10.1016","volume":"104","author":[{"given":"Richard","family":"Arratia","sequence":"first","affiliation":[]},{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"additional","affiliation":[]},{"given":"Don","family":"Coppersmith","sequence":"additional","affiliation":[]},{"given":"Gregory B.","family":"Sorkin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00190-6_BIB1","unstructured":"R. Arratia, B. Bollob\u00e1s, G.B. Sorkin, The interlace polynomial: a new graph polynomial, Proceedings of the Eleventh Annual ACM\u2013SIAM Symposium on Discrete Algorithms, January 2000."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1214\/aop\/1176991491","article-title":"Two moments suffice for Poisson approximations: the Chen\u2013Stein method","volume":"17","author":"Arratia","year":"1989","journal-title":"Ann. Probab."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1089\/cmb.1996.3.425","article-title":"Poisson process approximation for sequence repeats, and sequencing by hybridization","volume":"3","author":"Arratia","year":"1996","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB4","series-title":"Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching","first-page":"209","article-title":"Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization","volume":"Vol. 1075","author":"Arratia","year":"1996"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB5","series-title":"Poisson Approximation","volume":"Vol. 2","author":"Barbour","year":"1992"},{"issue":"7","key":"10.1016\/S0166-218X(00)00190-6_BIB6","doi-asserted-by":"crossref","first-page":"514","DOI":"10.2307\/2323022","article-title":"Non-sexist solution of the menage problem","volume":"93","author":"Bogart","year":"1986","journal-title":"Amer. Math. Mon."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollob\u00e1s","year":"1980","journal-title":"European J. Combin."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB8","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB9","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, Modern Graph Theory, Graduate Texts in Mathematics, Vol. 184, Springer, New York, 1998.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB10","first-page":"203","article-title":"Circuits and trees in oriented graphs","volume":"28","author":"de Bruijn","year":"1951","journal-title":"Simon Stevin"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02401740","article-title":"\u00dcber kombinatorische Topologie","volume":"67","author":"Dehn","year":"1936","journal-title":"Acta Math."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0195-6698(84)80005-0","article-title":"A characterization of circle graphs","volume":"5","author":"de Fraysseix","year":"1984","journal-title":"European J. Combin."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1089\/cmb.1994.1.105","article-title":"The probability of unique solutions of sequencing by hybridization","volume":"1","author":"Dyer","year":"1994","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB14","series-title":"Theory of Machines and Computations","first-page":"71","article-title":"Queues, stacks and graphs","author":"Even","year":"1971"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB15","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/65950.65951","article-title":"Recognizing circle graphs in polynomial time","volume":"36","author":"Gabor","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB16","unstructured":"C.F. Gauss, Werke, Vol. 8, Teubner, Stuttgart, 1900, pp. 272, 282\u2013286."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB17","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0166-218X(98)00071-7","article-title":"Graph traversals, genes and matroids: an efficient case of the travelling salesman problem","volume":"88","author":"Gusfield","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB19","unstructured":"E. Hubbell, Multiplex sequencing by hybridization, J. Comput. Biol. (1999) to appear."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0166-218X(97)81456-4","article-title":"Shuffling biological sequences","volume":"71","author":"Kandel","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB21","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/andp.18471481202","article-title":"\u00dcber die Aufl\u00f6sung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Str\u00f6me gef\u00fchrt wird","volume":"72","author":"Kirchoff","year":"1847","journal-title":"Ann. Phys. Chem."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB22","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01188582","article-title":"DNA physical mapping and alternating Eulerian circuits in colored graphs","volume":"13","author":"Pevzner","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB23","first-page":"843","article-title":"On the Gauss crossing problem","volume":"18","author":"Read","year":"1976","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB24","series-title":"The Encyclopedia of Integer Sequences","author":"Sloane","year":"1995"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB25","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2307\/2302716","article-title":"On unicursal paths in a network of degree 4","volume":"48","author":"Smith","year":"1941","journal-title":"Amer. Math. Mon."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB26","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1006\/jagm.1994.1012","article-title":"Recognition of circle graphs","volume":"16","author":"Spinrad","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB27","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF01475475","article-title":"\u00dcber ein topologisches Problem von Gauss","volume":"26","author":"Sz.-Nagy","year":"1927","journal-title":"Math. Zeitschrift"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB28","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1017\/S030500410002449X","article-title":"The dissection of equilateral triangles into equilateral triangles","volume":"44","author":"Tutte","year":"1948","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB29","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","article-title":"Approximate string-matching with q-grams and maximal matches","volume":"92","author":"Ukkonen","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00190-6_BIB30","series-title":"Introduction to Computational Biology: Maps, Sequences and Genomes","author":"Waterman","year":"1995"},{"key":"10.1016\/S0166-218X(00)00190-6_BIB31","series-title":"Generatingfunctionology","author":"Wilf","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001906?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001906?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T20:15:16Z","timestamp":1578860116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0166218X00001906"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00190-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}