{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T14:51:25Z","timestamp":1710255085843},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0196-6774(03)00083-x","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T09:48:27Z","timestamp":1057571307000},"page":"42-62","source":"Crossref","is-referenced-by-count":6,"title":["Fitting points on the real line and its application to RH mapping"],"prefix":"10.1016","volume":"49","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[]},{"given":"Lars","family":"Ivansson","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Lagergren","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(03)00083-X_BIB001","series-title":"Proceedings of the Seventh Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"365","article-title":"On the approximability of numerical taxonomy (fitting distances by tree metrics)","author":"Agarwala","year":"1996"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB002","first-page":"17","article-title":"On constructing radiation hybrid maps","author":"Ben-Dor","year":"1997"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB003","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1159\/000133210","article-title":"Gillian P. Crockford, Comparison of radiation hybrid mapping and linkage mapping","volume":"59","author":"Timothy Bishop","year":"1992","journal-title":"Cyt. Cell Genet."},{"issue":"1","key":"10.1016\/S0196-6774(03)00083-X_BIB004","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0020-0190(96)00190-1","article-title":"An O(n3\/14)-coloring algorithm for 3-colorable graphs","volume":"61","author":"Blum","year":"1997","journal-title":"Inform. Process. Lett"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB005","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/0404047","article-title":"Bound smoothing under chirality constraints","author":"Dress","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0196-6774(03)00083-X_BIB006","series-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","first-page":"230","article-title":"Efficient algorithms for inverting evolution","author":"Farach","year":"1996"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB007","series-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","first-page":"137","article-title":"A robust model for finding optimal evolutionary trees (extended abstract)","author":"Farach","year":"1993"},{"issue":"301","key":"10.1016\/S0196-6774(03)00083-X_BIB008","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0196-6774(03)00083-X_BIB009","series-title":"Proceedings of the 2nd Israel Symposium on Theory and Computing Systems, ISTCS","first-page":"250","article-title":"On the hardness of approximating the chromatic number","author":"Khanna","year":"1993"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB010","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1101\/gr.5.2.136","article-title":"Statistical methods for polyploid radiation hybrid mapping","volume":"5","author":"Lange","year":"1995","journal-title":"Genome Res."},{"key":"10.1016\/S0196-6774(03)00083-X_BIB011","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200757","article-title":"The geometry of graphs and some of its algorithmic applications","volume":"15","author":"Linial","year":"1995","journal-title":"Combinatorica"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB012","first-page":"480","article-title":"Embeddability of graphs in k-space is strongly NP-hard","author":"Saxe","year":"1979"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB013","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0196-6774(03)00083-X_BIB014","first-page":"277","article-title":"Building human genome maps with radiation hybrids","author":"Slonim","year":"1997"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019667740300083X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019667740300083X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T04:52:11Z","timestamp":1552884731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S019667740300083X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S019667740300083X"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00083-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}