{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:21:48Z","timestamp":1710328908955},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"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":[[2003,4]]},"DOI":"10.1016\/s0166-218x(02)00284-6","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T14:55:35Z","timestamp":1048604135000},"page":"53-62","source":"Crossref","is-referenced-by-count":9,"title":["Point placement on the line by distance data"],"prefix":"10.1016","volume":"127","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00284-6_BIB1","doi-asserted-by":"crossref","unstructured":"P. Damaschke, Adaptive versus nonadaptive attribute-efficient learning, Mach. Learn. 41 (2000) 197\u2013215; preliminary version in 30th ACM STOC\u201998, pp. 590\u2013596.","DOI":"10.1023\/A:1007616604496"},{"key":"10.1016\/S0166-218X(02)00284-6_BIB2","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(02)00284-6_BIB3","doi-asserted-by":"crossref","unstructured":"M.Y. Kao, J. Samet, W.K. Sung, The enhanced double digest problem for DNA physical mapping, in: Seventh SWAT\u20192000, Lecture Notes in Computer Science, Vol. 1851, pp. 383\u2013392.","DOI":"10.1007\/3-540-44985-X_33"},{"key":"10.1016\/S0166-218X(02)00284-6_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0166-218X(00)00189-X","article-title":"Probe location in the presence of errors: a problem from DNA mapping","volume":"104","author":"Mumey","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00284-6_BIB5","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1137\/S0895480196306373","article-title":"Realizing interval graphs with size and distance constraints","volume":"10","author":"Pe'er","year":"1997","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00284-6_BIB6","doi-asserted-by":"crossref","unstructured":"J. Redstone, W.L. Ruzzo, Algorithms for a simple point placement problem, in: Fourth CIAC\u20192000, Lecture Notes in Computer Science, Vol. 1767, pp. 32\u201343.","DOI":"10.1007\/3-540-46521-9_3"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002846?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002846?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T19:27:35Z","timestamp":1555183655000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0166218X02002846"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00284-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}