{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:19:52Z","timestamp":1648981192607},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9050-z","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T20:59:23Z","timestamp":1175288363000},"page":"331-347","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing the reconstruction and enumerating the\u00a0patterns of DNA sequences with repeats"],"prefix":"10.1007","volume":"14","author":[{"given":"Hsun-Wen","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Fang","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"9050_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0166-218X(00)00190-6","volume":"104","author":"R Arratia","year":"2001","unstructured":"Arratia R, Bollob\u00e1s B, Coppersmith D, Sorkin GB (2001) Euler circuits and sequencing by hybridization. Discret Appl Math 104:63\u201396","journal-title":"Discret Appl Math"},{"key":"9050_CR2","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/S0304-3975(02)00063-4","volume":"290","author":"J Blazewicz","year":"2003","unstructured":"Blazewicz J, Kasprak M (2003) Complexity of DNA sequencing by hybridization. Theor Comput Sci 290:1459\u20131473","journal-title":"Theor Comput Sci"},{"key":"9050_CR3","doi-asserted-by":"crossref","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 (1999) On some properties of DNA graphs. Discret Appl Math 98:1\u201319","journal-title":"Discret Appl Math"},{"key":"9050_CR4","doi-asserted-by":"crossref","unstructured":"Blazewicz J, Formanowicz P, Kasprzak M, Schuurman P, Woeginger GJ (2002) DNA sequencing, Eulerian graphs, and the exact perfect matching problem. In: Lecture notes in computer science, vol\u00a02573, pp\u00a013\u201324","DOI":"10.1007\/3-540-36379-3_2"},{"key":"9050_CR5","series-title":"Graduate texts in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollobas","year":"1998","unstructured":"Bollobas B (1998) Modern graph theory. In: Graduate texts in mathematics, vol\u00a0184. Springer, New York"},{"key":"9050_CR6","unstructured":"Farman ML, Gilkerson JW, Jaromczyk JW, Staben C (2004) RepeatAssembler: a\u00a0package for annotation of full-length repetitive DNA sequences in fungal genomes. In: Proc. IEEE computational systems bioinformatics conference, pp 464\u2013467"},{"key":"9050_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1089\/106652701300312913","volume":"8","author":"E Hubbell","year":"2001","unstructured":"Hubbell E (2001) Multiplex sequencing by hybridization. J Comput Biol 8:141\u2013149","journal-title":"J Comput Biol"},{"key":"9050_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01192694","volume":"29","author":"T Jiang","year":"1996","unstructured":"Jiang T, Li M (1996) DNA sequencing and string learning. Math Syst Theory 29:387\u2013405","journal-title":"Math Syst Theory"},{"key":"9050_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01188580","volume":"13","author":"JD Kececioglu","year":"1995","unstructured":"Kececioglu JD, Myers EW (1995) Combinatorial algorithms for DNA sequence assembly. Algorithmica 13:7\u201351","journal-title":"Algorithmica"},{"key":"9050_CR10","first-page":"1508","volume":"303","author":"YP Lysov","year":"1988","unstructured":"Lysov YP, Florentiev VL, Khorlyn AA, Khrapko KR, Shick VV, Mirzabekov AD (1988) Determination of the nucleotide sequence of DNA using hybridization with oligonucleotides\u2014a new method. Dokl Acad Sci USSR 303:1508\u20131511","journal-title":"Dokl Acad Sci USSR"},{"key":"9050_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"PA Pevzner","year":"1989","unstructured":"Pevzner PA (1989) l-Tuple DNA sequencing: computer analysis. J Biomol Struct Dyn 7:63\u201373","journal-title":"J Biomol Struct Dyn"},{"key":"9050_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01188582","volume":"13","author":"PA Pevzner","year":"1995","unstructured":"Pevzner PA (1995) DNA physical mapping and alternating Eulerian circuits in colored graphs. Algorithmica 13:77\u2013105","journal-title":"Algorithmica"},{"key":"9050_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational molecular biology: an algorithmic approach","author":"PA Pevzner","year":"2000","unstructured":"Pevzner PA (2000) Computational molecular biology: an algorithmic approach. MIT Press, Cambridge"},{"key":"9050_CR14","unstructured":"Setubal J, Meidanis J (1997) Introduction to computational molecular Biology. PWS"},{"key":"9050_CR15","volume-title":"Applied combinatorics","author":"A Tucker","year":"2002","unstructured":"Tucker A (2002) Applied combinatorics, 4th edn. Wiley, New York"},{"key":"9050_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E Ukkonen","year":"1992","unstructured":"Ukkonen E (1992) Approximate string-matching with q-grams and maximal matches. Theor Comput Sci 92:191\u2013211","journal-title":"Theor Comput Sci"},{"key":"9050_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511987045","volume-title":"A course in combinatorics","author":"van JH Lint","year":"2001","unstructured":"van Lint JH, Wilson RM (2001) A course in combinatorics, 2nd edn. Cambridge University Press, Cambridge"},{"key":"9050_CR18","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, New York"},{"key":"9050_CR19","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1089\/106652703322756096","volume":"10","author":"Y Zhang","year":"2003","unstructured":"Zhang Y, Waterman MS (2003) An Eulerian path approach to global multiple alignment for DNA sequences. J Comput Biol 10:803\u2013819","journal-title":"J Comput Biol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9050-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9050-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9050-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9050-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9050"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9050-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}