{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:05:04Z","timestamp":1773277504518,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0022-0000(02)00008-9","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T13:45:29Z","timestamp":1043156729000},"page":"526-544","source":"Crossref","is-referenced-by-count":17,"title":["The restriction mapping problem revisited"],"prefix":"10.1016","volume":"65","author":[{"given":"Gopal","family":"Pandurangan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Ramesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(02)00008-9_BIB1","first-page":"97","article-title":"Restriction site mapping is in separation theory","volume":"4","author":"Allison","year":"1988","journal-title":"Comput. Appl. Biol. Sci."},{"issue":"5","key":"10.1016\/S0022-0000(02)00008-9_BIB2","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1093\/bioinformatics\/17.5.398","article-title":"Simplified partial digest method for DNA restriction maps construction","volume":"17","author":"Blazewicz","year":"2001","journal-title":"Bioinformatics"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB3","unstructured":"T. Chen, M. Kao, M. Tepel, J. Rush, G.M. Church, A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2000, pp. 389\u2013398."},{"key":"10.1016\/S0022-0000(02)00008-9_BIB4","doi-asserted-by":"crossref","unstructured":"V. Dancik, T.A. Addona, K.R. Clauser, J.E. Vath, P.A. Pevzner, De nova peptide sequencing via tandem mass spectrometry: a graph-theoretical approach, in: Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB), Lyon, France, 1999.","DOI":"10.1145\/299432.299471"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB5","unstructured":"T. Dakic, On the Turnpike problem, Ph.D. Thesis, Simon Fraser University, August 2000."},{"key":"10.1016\/S0022-0000(02)00008-9_BIB6","first-page":"117","article-title":"Errors between sites in restriction site mapping","volume":"4","author":"Dix","year":"1988","journal-title":"Comput. Appl. Biol. Sci."},{"key":"10.1016\/S0022-0000(02)00008-9_BIB7","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0196-8858(87)90013-3","article-title":"Mapping DNA by stochastic relaxation","volume":"8","author":"Goldstein","year":"1987","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0022-0000(02)00008-9_BIB8","doi-asserted-by":"crossref","unstructured":"R.M. Karp, R. Shamir, Algorithms for optical mapping, in: Proceedings of the Second International Conference on Computational Biology (RECOMB), New York, NY, 1998, pp. 117\u2013124.","DOI":"10.1145\/279069.279104"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB9","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/aama.1993.1009","article-title":"A lower bound on the number of solutions of the probed partial digest problem","volume":"14","author":"Newberg","year":"1993","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0022-0000(02)00008-9_BIB10","series-title":"Computational Molecular Biology: An Algorithmic Approach","author":"Pevzner","year":"2000"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1137\/0603035","article-title":"The structure of homometric sets","volume":"3","author":"Rosenblatt","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB12","series-title":"Molecular Cloning, a Laboratory Manual","author":"Sambrook","year":"1989"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1126\/science.8211116","article-title":"Ordered restriction maps of Saccharomyces cerevisiac chromosomes constructed by optical mapping","volume":"262","author":"Schwartz","year":"1993","journal-title":"Science"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB14","doi-asserted-by":"crossref","unstructured":"S.S. Skiena, W.D. Smith, P. Lemke, Reconstructing sets from interpoint distances, in: Proceedings of the Sixth ACM Symposium on Computational Geometry, Berkeley, CA, 1990, pp. 332\u2013339.","DOI":"10.1145\/98524.98598"},{"issue":"2","key":"10.1016\/S0022-0000(02)00008-9_BIB15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02460643","article-title":"A partial digest approach to restriction site mapping","volume":"56","author":"Skiena","year":"1994","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0022-0000(02)00008-9_BIB16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0004-3702(78)90013-9","article-title":"Inferring DNA structures from segmentation data","volume":"11","author":"Stefik","year":"1978","journal-title":"Artif. Intell."},{"key":"10.1016\/S0022-0000(02)00008-9_BIB17","series-title":"Introduction to Computational Biology: Maps, Sequences and Genomes","author":"Waterman","year":"1995"},{"key":"10.1016\/S0022-0000(02)00008-9_BIB18","series-title":"Data Structures and Algorithm Analysis in C++","author":"Weiss","year":"1994"},{"issue":"3","key":"10.1016\/S0022-0000(02)00008-9_BIB19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1089\/cmb.1994.1.235","article-title":"An exponential example for a partial digest mapping algorithm","volume":"1","author":"Zhang","year":"1994","journal-title":"J. Comput. Biol."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T02:04:39Z","timestamp":1583978679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0022000002000089"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00008-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}