{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T21:10:03Z","timestamp":1749762603519,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319485317"},{"type":"electronic","value":"9783319485324"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-3-319-48532-4_18","type":"book-chapter","created":{"date-parts":[[2016,11,23]],"date-time":"2016-11-23T09:13:16Z","timestamp":1479892396000},"page":"204-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distance Geometry on the Sphere"],"prefix":"10.1007","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[]},{"given":"Grzegorz","family":"Swirszcz","sequence":"additional","affiliation":[]},{"given":"Carlile","family":"Lavor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,24]]},"reference":[{"unstructured":"Agrafiotis, D., Bandyopadhyay, D., Young, E.: Stochastic proximity embedding (SPE): a simple, fast and scalable algorithm for solving the distance geometry problem. In: Mucherino et al. (eds.) [22]","key":"18_CR1"},{"key":"18_CR2","first-page":"267","volume":"II","author":"A Cayley","year":"1841","unstructured":"Cayley, A.: A theorem in the geometry of position. Camb. Math. J. II, 267\u2013271 (1841)","journal-title":"Camb. Math. J."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1023221624213","volume":"26","author":"Q Dong","year":"2003","unstructured":"Dong, Q., Wu, Z.: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Global Optim. 26, 321\u2013333 (2003)","journal-title":"J. Global Optim."},{"doi-asserted-by":"crossref","unstructured":"Eren, T., Goldenberg, D., Whiteley, W., Yang, Y., Morse, A., Anderson, B., Belhumeur, P.: Rigidity, computation, and randomization in network localization. In: IEEE Infocom Proceedings, pp. 2673\u20132684 (2004)","key":"18_CR4","DOI":"10.1109\/INFCOM.2004.1354686"},{"volume-title":"Kurt G\u00f6del: Collected Works","year":"1986","unstructured":"Feferman, S., Dawson, J., Kleene, S., Moore, G., Solovay, R., van Heijenoort, J. (eds.): Kurt G\u00f6del: Collected Works, vol. I. Oxford University Press, Oxford (1986)","key":"18_CR5"},{"unstructured":"G\u00f6del, K.: On the isometric embeddability of quadruples of points of $$r_3$$ in the surface of a sphere (1933b). In: Feferman et al. (eds.) [6], pp. 276\u2013279","key":"18_CR6"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1137\/090759392","volume":"20","author":"N Krislock","year":"2010","unstructured":"Krislock, N., Wolkowicz, H.: Explicit sensor network localization using semidefinite representations and facial reductions. SIAM J. Optim. 20, 2679\u20132708 (2010)","journal-title":"SIAM J. Optim."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s11590-011-0302-6","volume":"6","author":"C Lavor","year":"2012","unstructured":"Lavor, C., Lee, J., Lee-St. John, A., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optim. Lett. 6, 783\u2013796 (2012)","journal-title":"Optim. Lett."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-011-9402-6","volume":"52","author":"C Lavor","year":"2012","unstructured":"Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: The discretizable molecular distance geometry problem. Comput. Optim. Appl. 52, 115\u2013146 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.ejor.2011.11.007","volume":"219","author":"C Lavor","year":"2012","unstructured":"Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: Recent advances on the discretizable molecular distance geometry problem. Eur. J. Oper. Res. 219, 698\u2013706 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-40020-9_23","volume-title":"geometric science of information","author":"L Liberti","year":"2013","unstructured":"Liberti, L., Lavor, C., Alencar, J., Abud, G.: Counting the number of solutions of $$^\\mathit{k}$$DMDGP instances. In: Nielsen, F., Barbaresco, F. (eds.) GSI 2013. LNCS, vol. 8085, pp. 224\u2013230. Springer, Heidelberg (2013)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2007.00622.x","volume":"15","author":"L Liberti","year":"2008","unstructured":"Liberti, L., Lavor, C., Maculan, N.: A branch-and-prune algorithm for the molecular distance geometry problem. Int. Trans. Oper. Res. 15, 1\u201317 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10898-007-9218-1","volume":"43","author":"L Liberti","year":"2009","unstructured":"Liberti, L., Lavor, C., Maculan, N., Marinelli, F.: Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Global Optim. 43, 207\u2013218 (2009)","journal-title":"J. Global Optim."},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/120875909","volume":"56","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56(1), 3\u201369 (2014)","journal-title":"SIAM Rev."},{"unstructured":"Liberti, L., Lavor, C., Mucherino, A.: The discretizable molecular distance geometry problem seems easier on proteins. In: Mucherino et al. [22]","key":"18_CR15"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1111\/j.1475-3995.2009.00757.x","volume":"18","author":"L Liberti","year":"2010","unstructured":"Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18, 33\u201351 (2010)","journal-title":"Int. Trans. Oper. Res."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.dam.2013.01.020","volume":"165","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Masson, B., Lavor, C., Lee, J., Mucherino, A.: On the number of realizations of certain Henneberg graphs arising in protein conformation. Discrete Appl. Math. 165, 213\u2013232 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.2307\/2371222","volume":"53","author":"K Menger","year":"1931","unstructured":"Menger, K.: New foundation of Euclidean geometry. Am. J. Math. 53(4), 721\u2013745 (1931)","journal-title":"Am. J. Math."},{"volume-title":"Ergebnisse eines Mathematischen Kolloquiums","year":"1998","unstructured":"Menger, K. (ed.): Ergebnisse eines Mathematischen Kolloquiums. Springer, Wien (1998)","key":"18_CR19"},{"issue":"3","key":"18_CR20","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"7","author":"J Mor\u00e9","year":"1997","unstructured":"Mor\u00e9, J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7(3), 814\u2013846 (1997)","journal-title":"SIAM J. Optim."},{"issue":"03","key":"18_CR21","doi-asserted-by":"crossref","first-page":"1242009","DOI":"10.1142\/S0219720012420097","volume":"10","author":"ANTONIO MUCHERINO","year":"2012","unstructured":"Mucherino, A., Lavor, C., Liberti, L.: Exploiting symmetry properties of the discretizable molecular distance geometry problem. J. Bioinf. Comput. Biol. 10, 1242009(1\u201315) (2012)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"volume-title":"Distance Geometry: Theory, Methods, and Applications","year":"2013","unstructured":"Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.): Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)","key":"18_CR22"},{"doi-asserted-by":"crossref","unstructured":"Mucherino, A., Lavor, C., Liberti, L., Talbi, E.G.: A parallel version of the Branch & Prune algorithm for the molecular distance geometry problem. In: ACS\/IEEE International Conference on Computer Systems and Applications (AICCSA10), pp. 1\u20136. IEEE, Hammamet (2010)","key":"18_CR23","DOI":"10.1109\/AICCSA.2010.5586983"},{"unstructured":"Saxe, J.: Embeddability of weighted graphs in $$k$$-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480\u2013489 (1979)","key":"18_CR24"},{"doi-asserted-by":"crossref","unstructured":"van der Schans, M., Boer, A.: A heuristic for completing covariance and correlation matrices. Technical report 2013\u201301, ORTEC Finance (2013)","key":"18_CR25","DOI":"10.2139\/ssrn.3748416"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"J Tenenbaum","year":"2000","unstructured":"Tenenbaum, J., de Silva, V., Langford, J.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319\u20132322 (2000)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry and Graphs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48532-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T20:36:51Z","timestamp":1749760611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-48532-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319485317","9783319485324"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48532-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry and Graphs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}