{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:08:32Z","timestamp":1758823712182,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461451273"},{"type":"electronic","value":"9781461451280"}],"license":[{"start":{"date-parts":[[2012,11,3]],"date-time":"2012-11-03T00:00:00Z","timestamp":1351900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,11,3]],"date-time":"2012-11-03T00:00:00Z","timestamp":1351900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-5128-0_9","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T20:20:20Z","timestamp":1355516420000},"page":"161-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Nucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loana Tito","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlile","family":"Lavor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,3]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H.M. Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The protein data bank. Nucleic Acids Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acids Res."},{"key":"9_CR2","unstructured":"Crippen, G., Havel, T.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)"},{"key":"9_CR3","doi-asserted-by":"crossref","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 interatomic distances. J. Global Optim. 22, 365\u2013375 (2002)","journal-title":"J. Global Optim."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Molecular distance geometry problem. Encyclopedia of Optimization, pp. 2305\u20132311, 2nd edn. Springer, New York (2009)","DOI":"10.1007\/978-0-387-74759-0_400"},{"key":"9_CR5","doi-asserted-by":"crossref","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":"9_CR6","doi-asserted-by":"crossref","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":"9_CR7","doi-asserted-by":"crossref","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":"9_CR8","doi-asserted-by":"crossref","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":"9_CR9","doi-asserted-by":"crossref","unstructured":"Mucherino, A., Lavor, C., Liberti, L., \u00a0Talbi, E.-G.: A parallel version of the branch and prune algorithm for the molecular distance geometry problem. In: IEEE Conference Proceedings, ACS\/IEEE International Conference on Computer Systems and Applications (AICCSA10), pp. 1\u20136. Hammamet, Tunisia (2010)","DOI":"10.1109\/AICCSA.2010.5586983"},{"key":"9_CR10","unstructured":"Nucci, P.: Heuristicas para o problema molecular de geometria de distancias aplicado a proteinas. Undergraduate Dissertation, Fluminense Federal University"},{"key":"9_CR11","unstructured":"Saxe, J.B.: 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. Monticello, IL (1979)"}],"container-title":["Distance Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-5128-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T08:50:11Z","timestamp":1676796611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-5128-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,3]]},"ISBN":["9781461451273","9781461451280"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-5128-0_9","relation":{},"subject":[],"published":{"date-parts":[[2012,11,3]]},"assertion":[{"value":"3 November 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}