{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T22:56:20Z","timestamp":1716936980307},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"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":[[2002,1]]},"DOI":"10.1016\/s0166-218x(00)00324-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:01:11Z","timestamp":1027602071000},"page":"161-177","source":"Crossref","is-referenced-by-count":8,"title":["Rearrangement of DNA fragments: a branch-and-cut algorithm"],"prefix":"10.1016","volume":"116","author":[{"given":"C.E.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"C.C.","family":"de Souza","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Wakabayashi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00324-3_BIB1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","article-title":"Solving large-scale symmetric traveling salesman problems to optimality","volume":"26","author":"Crowder","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(00)00324-3_BIB2","series-title":"Computer and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(00)00324-3_BIB3","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0166-218X(00)00324-3_BIB4","unstructured":"J.D. Kececioglu, Exact and approximation algorithms for DNA sequence reconstruction, Ph.D. Thesis, University of Arizona, Tucson, 1991."},{"key":"10.1016\/S0166-218X(00)00324-3_BIB5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01188580","article-title":"Combinatorial algorithms for DNA sequence assembly","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00324-3_BIB6","unstructured":"J. Meidanis, Algorithms for problems in computational genetics, Ph.D. Thesis, University of Wisconsin, Madison, 1992."},{"key":"10.1016\/S0166-218X(00)00324-3_BIB7","series-title":"Computational Molecular Biology","author":"Meidanis","year":"1997"},{"key":"10.1016\/S0166-218X(00)00324-3_BIB8","series-title":"The Travelling Salesman Problem","article-title":"Polyhedral aspects of the travelling salesman problem II: Computations","author":"Padberg","year":"1985"},{"issue":"1","key":"10.1016\/S0166-218X(00)00324-3_BIB9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1089\/cmb.1998.5.113","article-title":"Optimization of restriction fragment DNA mapping","volume":"5","author":"Siegel","year":"1998","journal-title":"J. Comput. Biol."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:27:01Z","timestamp":1556584021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0166218X00003243"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00324-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}