{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:09Z","timestamp":1725542049543},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_16","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"142-152","source":"Crossref","is-referenced-by-count":3,"title":["Reconstructing Numbers from Pairwise Function Values"],"prefix":"10.1007","author":[{"given":"Shiteng","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhiyi","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Abrams, Z., Chen, H.L.: The Simplified Partial Digest Problem: Hardness and a Probabilistic Analysis. In: RECOMB Satellite Meeting on DNA Sequencing Technologies and Computation (2004)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Formanowicz, P., Kasprzak, M., Jaroszewski, M., Markiewicz, W.T.: Construction of DNA restriction maps based on a simplified experiment (2001)","DOI":"10.1093\/bioinformatics\/17.5.398"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/978-3-540-24698-5_42","volume-title":"LATIN 2004: Theoretical Informatics","author":"M. Cieliebak","year":"2004","unstructured":"Cieliebak, M., Eidenbenz, S.: Measurement errors make the partial digest problem NP-hard. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 379\u2013390. Springer, Heidelberg (2004)"},{"key":"16_CR4","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-39763-2_9","volume-title":"Algorithms in Bioinformatics","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Eidenbenz, S., Penna, P.: Noisy data make the partial digest problem NP-hard. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"16_CR5","unstructured":"Dakic, T.: On the turnpike problem. PhD thesis, Simon Fraser University (2000)"},{"key":"16_CR6","unstructured":"Das, H., Orlitsky, A., Santhanam, N.: Order from disorder. In: Information Theory and Applications Workshop (2009)"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0196-8858(87)90013-3","volume":"8","author":"L. Goldstein","year":"1987","unstructured":"Goldstein, L., Waterman, M.S.: Mapping DNA by stochastic relaxation. Advances in Applied Mathematics\u00a08(2), 194\u2013207 (1987)","journal-title":"Advances in Applied Mathematics"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Lemke, P., Skiena, S.S., Smith, W.D.: Reconstructing sets from interpoint distances. Discrete and computational geometry: The Goodman-Pollack Festschrift\u00a025, 597\u2013631","DOI":"10.1007\/978-3-642-55566-4_27"},{"key":"16_CR9","unstructured":"O\u2019Bryant, K., Weisstein, E.: Lehmer\u2019s Mahler measure problem. MathWorld\u2013A Wolfram Web Resource"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/S0022-0000(02)00008-9","volume":"65","author":"G. Pandurangan","year":"2002","unstructured":"Pandurangan, G., Ramesh, H.: The restriction mapping problem revisited. Journal of Computer and System Sciences\u00a065(3), 526\u2013544 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR11","first-page":"517","volume":"90","author":"A.L. Patterson","year":"1935","unstructured":"Patterson, A.L.: A direct method for the determination of the components of interatomic distances in crystals. Zeitschr. Krist.\u00a090, 517\u2013542 (1935)","journal-title":"Zeitschr. Krist."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1103\/PhysRev.65.195","volume":"65","author":"A.L. Patterson","year":"1944","unstructured":"Patterson, A.L.: Ambiguities in the X-ray analysis of crystal structures. Phys. Review\u00a065, 195\u2013201 (1944)","journal-title":"Phys. Review"},{"key":"16_CR13","unstructured":"Piccard, S.: Sur les Ensembles de Distances des Ensembles de Point d\u2019un Espace Euclidean. Mem. Univ. Neuchatel\u00a013 (1939)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1137\/0603035","volume":"3","author":"J. Rosenblatt","year":"1982","unstructured":"Rosenblatt, J., Seymour, P.D.: The structure of homometric sets. SIAM Journal on Algebraic and Discrete Methods\u00a03, 343 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"16_CR15","unstructured":"Shamos, M.I.: Problems in computational geometry. Unpublished manuscript, Carnegie Mellon University, Pittsburgh, PA (1977)"},{"issue":"2","key":"16_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02460643","volume":"56","author":"S.S. Skiena","year":"1994","unstructured":"Skiena, S.S., Sundaram, G.: A partial digest approach to restriction site mapping. Bulletin of Mathematical Biology\u00a056(2), 275\u2013294 (1994)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1112\/blms\/3.2.169","volume":"3","author":"C.J. Smyth","year":"1971","unstructured":"Smyth, C.J.: On the product of the conjugates outside the unit circle of an algebraic integer. Bulletin of the London Mathematical Society\u00a03(2), 169 (1971)","journal-title":"Bulletin of the London Mathematical Society"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Smyth, C.J.: The Mahler measure of algebraic numbers: a survey. Number Theory and Polynomials, 322 (2008)","DOI":"10.1017\/CBO9780511721274.021"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1089\/cmb.1994.1.235","volume":"1","author":"Z. Zhang","year":"1994","unstructured":"Zhang, Z.: An exponential example for a partial digest mapping algorithm. Journal of Computational Biology\u00a01(3), 235\u2013239 (1994)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:32:11Z","timestamp":1606185131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}