{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:52Z","timestamp":1740099112041,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319951645"},{"type":"electronic","value":"9783319951652"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95165-2_29","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T10:35:04Z","timestamp":1530614104000},"page":"412-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Molecular Structure Determination in\u00a0the\u00a0Phillips\u2019 Model: A Degree of\u00a0Freedom Approach"],"prefix":"10.1007","author":[{"given":"Udayamoorthy Navaneetha","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"Md Zamilur","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Yash P.","family":"Aneja","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-319-62395-5_34","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2017","author":"MZ Rahman","year":"2017","unstructured":"Rahman, M.Z., Mukhopadhyay, A., Aneja, Y.P., Jean, C.: A distance matrix completion approach to\u00a01-round algorithms for point placement in\u00a0the plane. In: Gervasi, O., Murgante, B., Misra, S., Borruso, G., Torre, C.M., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O., Stankova, E., Cuzzocrea, A. (eds.) ICCSA 2017. LNCS, vol. 10405, pp. 494\u2013508. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-62395-5_34"},{"issue":"10","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1002\/jcc.10234","volume":"24","author":"DK Agrafiotis","year":"2003","unstructured":"Agrafiotis, D.K.: Stochastic proximity embedding. J. Comput. Chem. 24(10), 1215\u20131221 (2003)","journal-title":"J. Comput. Chem."},{"key":"29_CR3","unstructured":"Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard (1980)"},{"issue":"1\u20134","key":"29_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/A:1013857218127","volume":"22","author":"Q Dong","year":"2002","unstructured":"Dong, Q., Wu, Z.: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. J. Glob. Optim. 22(1\u20134), 365\u2013375 (2002)","journal-title":"J. Glob. Optim."},{"key":"29_CR5","volume-title":"Distance Geometry and Molecular Conformation","author":"GM Crippen","year":"1988","unstructured":"Crippen, G.M., Havel, T.F., et al.: Distance Geometry and Molecular Conformation, vol. 74. Research Studies Press, Taunton (1988)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1090\/dimacs\/023\/12","volume":"23","author":"AT Phillips","year":"1995","unstructured":"Phillips, A.T., Rosen, J.B., Walke, V.H.: Molecular structure determination by convex, global underestimation of local energy minima. Glob. Minimization Nonconvex Energy Funct. Mol. Conform. Prot. Fold. 23, 181\u2013198 (1995)","journal-title":"Glob. Minimization Nonconvex Energy Funct. Mol. Conform. Prot. Fold."},{"key":"29_CR7","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. North-Holland Publishing Co., Amsterdam (2004)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-1-4614-5128-0_14","volume-title":"Distance Geometry","author":"DK Agrafiotis","year":"2013","unstructured":"Agrafiotis, D.K., Bandyopadhyay, D., Yang, E.: Stochastic proximity embedding: a simple, fast and scalable algorithm for solving the distance geometry problem. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry, pp. 291\u2013311. Springer, New York (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-5128-0_14"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/S0895479893249757","volume":"16","author":"M Bakonyi","year":"1995","unstructured":"Bakonyi, M., Johnson, C.R.: The euclidian distance matrix completion problem. SIAM J. Matrix Anal. Appl. 16(2), 646\u2013654 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial hermitian matrices. Linear Algebr. Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebr. Appl."},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-15582-6_34","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"A Mucherino","year":"2010","unstructured":"Mucherino, A., Liberti, L., Lavor, C.: MD-jeep: an implementation of a branch and prune algorithm for distance geometry problems. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 186\u2013197. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15582-6_34"},{"issue":"8","key":"29_CR12","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1007\/s11590-011-0358-3","volume":"6","author":"A Mucherino","year":"2012","unstructured":"Mucherino, A., Lavor, C., Liberti, L.: The discretizable distance geometry problem. Optim. Lett. 6(8), 1671\u20131686 (2012)","journal-title":"Optim. Lett."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95165-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T10:51:01Z","timestamp":1530615061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95165-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319951645","9783319951652"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95165-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}