{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:52:26Z","timestamp":1762339946590},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1007\/bf01188581","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:03:45Z","timestamp":1108674225000},"page":"52-76","source":"Crossref","is-referenced-by-count":45,"title":["Physical mapping of chromosomes: A combinatorial problem in molecular biology"],"prefix":"10.1007","volume":"13","author":[{"given":"F.","family":"Alizadeh","sequence":"first","affiliation":[]},{"given":"R. M.","family":"Karp","sequence":"additional","affiliation":[]},{"given":"L. A.","family":"Newberg","sequence":"additional","affiliation":[]},{"given":"D. K.","family":"Weisser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01188581_CR1","first-page":"328","volume-title":"Linear approximation of shortest superstrings","author":"A. Blum","year":"1991","unstructured":"A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings.Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 328\u2013336, New Orleans, LA, May 1991. ACM Press, New York."},{"issue":"2","key":"BF01188581_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0888-7543(90)90293-4","volume":"8","author":"E. Branscomb","year":"1990","unstructured":"E. Branscomb, T. Slezak, R. Pae, D. Galas, A. V. Carrano, and M. Waterman. Optimizing restriction fragment fingerprinting methods for ordering large genomic libraries.Genomics,8(2), 351\u2013366, October 1990.","journal-title":"Genomics"},{"issue":"2","key":"BF01188581_CR3","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1139\/g89-182","volume":"31","author":"A. V. Carrano","year":"1989","unstructured":"A. V. Carrano, P. J. de Jong, E. Branscomb, T. Slezak, and B. Watkins. Constructing chromosome- and region-specific cosmid maps of the human genome.Genome,31(2), 1059\u20131065, 1989.","journal-title":"Genome"},{"issue":"9","key":"BF01188581_CR4","doi-asserted-by":"crossref","first-page":"2653","DOI":"10.1093\/nar\/18.9.2653","volume":"18","author":"A. G. Craig","year":"1990","unstructured":"A. G. Craig, D. Nizetic, J. D. Hoheisel, G. Zehetner, and H. Lehrach. Ordering of cosmid clones covering the Herpes simplex virus type-I (HSV-I) genome-a test case for fingerprinting by hybridisation.Nucleic Acids Research,18(9), 2653\u20132660, May 11, 1990.","journal-title":"Nucleic Acids Research"},{"key":"BF01188581_CR5","doi-asserted-by":"crossref","unstructured":"S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem.Operations Research,21(2), March\u2013April 1973.","DOI":"10.1287\/opre.21.2.498"},{"issue":"3","key":"BF01188581_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0888-7543(88)90007-9","volume":"2","author":"E. S. Lander","year":"1988","unstructured":"E. S. Lander and M. S. Waterman. Genomic mapping by fingerprinting random clones: a mathematical analysis.Genomics,2(3), 231\u2013239, April 1988.","journal-title":"Genomics"},{"issue":"7","key":"BF01188581_CR7","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1093\/nar\/20.7.1629","volume":"20","author":"K. Tynan","year":"1992","unstructured":"K. Tynan, A. Olsen, B. Trask, P. de Jong, J. Thompson, W. Zimmermann, A. Carrano, and H. Mohrenweiser. Assembly and analysis of cosmid contigs in the CEA-gene family region of human chromosome 19.Nucleic Acids Research,20(7), 1629\u20131636, April 11, 1992.","journal-title":"Nucleic Acids Research"},{"issue":"1","key":"BF01188581_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(89)90044-8","volume":"83","author":"J. S. Turner","year":"1989","unstructured":"J. S. Turner. Approximation algorithms for the shortest common superstring problem.Information and Computation,83(1), 1\u201320, October 1989.","journal-title":"Information and Computation"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188581.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188581\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:41:44Z","timestamp":1556728904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["BF01188581"],"URL":"https:\/\/doi.org\/10.1007\/bf01188581","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}