{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T00:47:38Z","timestamp":1774572458775,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,23]],"date-time":"2011-03-23T00:00:00Z","timestamp":1300838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10589-011-9402-6","type":"journal-article","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T19:33:48Z","timestamp":1300822428000},"page":"115-146","source":"Crossref","is-referenced-by-count":89,"title":["The discretizable molecular distance geometry problem"],"prefix":"10.1007","volume":"52","author":[{"given":"Carlile","family":"Lavor","sequence":"first","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Mucherino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,23]]},"reference":[{"key":"9402_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1026016804633","volume":"27","author":"L.T.H. An","year":"2003","unstructured":"An, L.T.H.: Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and d.c. programming. J. Glob. Optim. 27, 375\u2013397 (2003)","journal-title":"J. Glob. Optim."},{"key":"9402_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"L.T.H. An","year":"2003","unstructured":"An, L.T.H., Tao, P.D.: Large-scale molecular optimization from distance matrices by a d.c. optimization approach. SIAM J. Optim. 14, 77\u2013114 (2003)","journal-title":"SIAM J. Optim."},{"key":"9402_CR3","first-page":"3627","volume-title":"Handbook of Sensor Networks","author":"J. Bachrach","year":"2005","unstructured":"Bachrach, J., Taylor, C.: Localization in sensor networks. In: Stojmenovi\u0107, I. (ed.) Handbook of Sensor Networks, pp. 3627\u20133643. Wiley, New York (2005)"},{"issue":"1","key":"9402_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0024-3795(73)90038-4","volume":"7","author":"G. Barker","year":"1973","unstructured":"Barker, G.: The lattice of faces of a finite dimensional cone. Linear Algebra Appl. 7(1), 71\u201382 (1973)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"9402_CR5","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/301970.301972","volume":"46","author":"B. Berger","year":"1999","unstructured":"Berger, B., Kleinberg, J., Leighton, T.: Reconstructing a three-dimensional model with arbitrary errors. J. ACM 46(2), 212\u2013235 (1999)","journal-title":"J. ACM"},{"key":"9402_CR6","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":"9402_CR7","unstructured":"Biswas, P.: Semidefinite programming approaches to distance geometry problems. Ph.D. thesis, Stanford University (2007)"},{"key":"9402_CR8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/984622.984630","volume-title":"Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN04)","author":"P. Biswas","year":"2004","unstructured":"Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN04), New York, NY, USA, pp. 46\u201354. ACM, New York (2004)"},{"key":"9402_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/0-387-29550-X_2","volume-title":"Multiscale Optimization Methods and Applications","author":"P. Biswas","year":"2006","unstructured":"Biswas, P., Ye, Y.: A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. In: Multiscale Optimization Methods and Applications, vol. 82, pp.\u00a069\u201384. Springer, Berlin (2006)"},{"key":"9402_CR10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/1149283.1149286","volume":"2","author":"P. Biswas","year":"2006","unstructured":"Biswas, P., Lian, T., Wang, T., Ye, Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sens. Networks 2, 188\u2013220 (2006)","journal-title":"ACM Trans. Sens. Networks"},{"key":"9402_CR11","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TASE.2006.877401","volume":"3","author":"P. Biswas","year":"2006","unstructured":"Biswas, P., Liang, T.-C., Toh, K.-C., Wang, T.-C., Ye, Y.: Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Autom. Sci. Eng. 3, 360\u2013371 (2006)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"3","key":"9402_CR12","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1137\/05062754X","volume":"30","author":"P. Biswas","year":"2008","unstructured":"Biswas, P., Toh, K.C., Ye, Y.: A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation. SIAM J. Sci. Comput. 30(3), 1251\u20131277 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"9402_CR13","volume-title":"Theory and Applications of Distance Geometry","author":"L. Blumenthal","year":"1953","unstructured":"Blumenthal, L.: Theory and Applications of Distance Geometry. Oxford University Press, London (1953)"},{"key":"9402_CR14","volume-title":"Structural Bioinformatics: An Algorithmic Approach","author":"F. Burkowski","year":"2009","unstructured":"Burkowski, F.: Structural Bioinformatics: An Algorithmic Approach. CRC Press, Boca Raton (2009)"},{"key":"9402_CR15","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.ipl.2008.05.009","volume":"108","author":"R.S. Carvalho","year":"2008","unstructured":"Carvalho, R.S., Lavor, C., Protti, F.: Extending the geometric build-up algorithm for the molecular distance geometry problem. Inf. Process. Lett. 108, 234\u2013237 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9402_CR16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00454-004-1124-4","volume":"33","author":"R. Connelly","year":"2005","unstructured":"Connelly, R.: Generic global rigidity. Discrete Comput. Geom. 33, 549\u2013563 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"9402_CR17","volume-title":"Proteins: Structures and Molecular Properties","author":"T. Creighton","year":"1993","unstructured":"Creighton, T.: Proteins: Structures and Molecular Properties. Freeman, New York (1993)"},{"key":"9402_CR18","volume-title":"Distance Geometry and Molecular Conformation","author":"G.M. Crippen","year":"1988","unstructured":"Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)"},{"key":"9402_CR19","volume-title":"Convex Optimization and Euclidean Distance Geometry","author":"J. Dattorro","year":"2005","unstructured":"Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. Annual Reviews, Palo Alto (2005)"},{"key":"9402_CR20","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 inter-atomic distances. J. Glob. Optim. 22, 365\u2013375 (2002)","journal-title":"J. Glob. Optim."},{"key":"9402_CR21","doi-asserted-by":"crossref","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. Glob. Optim. 26, 321\u2013333 (2003)","journal-title":"J. Glob. Optim."},{"key":"9402_CR22","first-page":"2673","volume-title":"IEEE Infocom Proceedings","author":"T. Eren","year":"2004","unstructured":"Eren, T., Goldenberg, D.K., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B.D.O., Belhumeur, P.N.: Rigidity, computation, and randomization in network localization. In: IEEE Infocom Proceedings, pp. 2673\u20132684 (2004)"},{"issue":"6","key":"9402_CR23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"4","key":"9402_CR24","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/0611042","volume":"11","author":"W. Glunt","year":"1990","unstructured":"Glunt, W., Hayden, T.H., Hong, S., Wells, J.: An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl. 11(4), 589\u2013600 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9402_CR25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10589-007-9127-8","volume":"43","author":"A. Grosso","year":"2009","unstructured":"Grosso, A., Locatelli, M., Schoen, F.: Solving molecular distance geometry problems by global optimization algorithms. Comput. Optim. Appl. 43, 23\u201327 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9402_CR26","first-page":"1701","volume-title":"Encyclopedia of Nuclear Magnetic Resonance","author":"T. Havel","year":"1995","unstructured":"Havel, T.: Distance geometry. In: Grant, D., Harris, R. (eds.) Encyclopedia of Nuclear Magnetic Resonance, pp. 1701\u20131710. Wiley, New York (1995)"},{"key":"9402_CR27","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B.A. Hendrickson","year":"1995","unstructured":"Hendrickson, B.A.: The molecule problem: exploiting structure in global optimization. SIAM J. Optim. 5, 835\u2013857 (1995)","journal-title":"SIAM J. Optim."},{"key":"9402_CR28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1021336413386","volume":"25","author":"H.-X. Huang","year":"2003","unstructured":"Huang, H.-X., Liang, Z.-A., Pardalos, P.: Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems. J. Glob. Optim. 25, 3\u201321 (2003)","journal-title":"J. Glob. Optim."},{"key":"9402_CR29","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1018363021404","volume":"9","author":"C. Johnson","year":"1998","unstructured":"Johnson, C., Kroschel, B., Wolkowicz, H.: An interior-point method for approximate positive semidefinite completions. Comput. Optim. Appl. 9, 175\u2013190 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"9402_CR30","first-page":"369","volume":"13","author":"A. Kearsley","year":"1998","unstructured":"Kearsley, A., Tapia, R., Trosset, M.: The solution of the metric stress and stress problems in multidimensional scaling by newton\u2019s method. Comput. Stat. 13, 369\u2013396 (1998)","journal-title":"Comput. Stat."},{"key":"9402_CR31","unstructured":"Krislock, N.: Semidefinite facial reduction for low-rank Euclidean distance matrix completion. Ph.D. thesis, University of Waterloo (2010)"},{"key":"9402_CR32","doi-asserted-by":"crossref","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":"9402_CR33","doi-asserted-by":"crossref","first-page":"1967","DOI":"10.1007\/978-0-387-74759-0_355","volume-title":"Encyclopedia of Optimization","author":"M. Laurent","year":"2009","unstructured":"Laurent, M.: Matrix completion problems. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 1967\u20131975. Springer, New York (2009)","edition":"2"},{"key":"9402_CR34","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/0-387-30528-9_14","volume-title":"Global Optimization: From Theory to Implementation","author":"C. Lavor","year":"2006","unstructured":"Lavor, C.: On generating instances for the molecular distance geometry problem. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, pp. 405\u2013414. Springer, Berlin (2006)"},{"key":"9402_CR35","volume-title":"Proc. of VII Brazilian Congress of Neural Networks, Natal, Brazil","author":"C. Lavor","year":"2005","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Grover\u2019s algorithm applied to the molecular distance geometry problem. In: Proc. of VII Brazilian Congress of Neural Networks, Natal, Brazil (2005)"},{"key":"9402_CR36","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/0-387-30927-6_9","volume-title":"Global Optimization: Scientific and Engineering Case Studies","author":"C. Lavor","year":"2006","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Computational experience with the molecular distance geometry problem. In: Pint\u00e9r, J. (ed.) Global Optimization: Scientific and Engineering Case Studies, pp. 213\u2013225. Springer, Berlin (2006)"},{"key":"9402_CR37","unstructured":"Lavor, C., Liberti, L., Maculan, N.: The discretizable molecular distance geometry problem. Technical Report, arXiv: q-bio\/0608012 (2006)"},{"key":"9402_CR38","first-page":"2305","volume-title":"Encyclopedia of Optimization","author":"C. Lavor","year":"2009","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Molecular distance geometry problem. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 2305\u20132311. Springer, New York (2009)","edition":"2"},{"key":"9402_CR39","first-page":"804","volume-title":"Proceedings of the 24th Annual ACM Symposium on Applied Computing","author":"C. Lavor","year":"2009","unstructured":"Lavor, C., Liberti, L., Mucherino, A., Maculan, N.: On a discretizable subclass of instances of the molecular distance geometry problem. In: Shin, D. (ed.) Proceedings of the 24th Annual ACM Symposium on Applied Computing, pp. 804\u2013805. ACM, New York (2009)"},{"key":"9402_CR40","first-page":"751","volume-title":"Proceedings of the International Multiconference on Computer Science and Information Technology","author":"C. Lavor","year":"2009","unstructured":"Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: Computing artificial backbones of hydrogen atoms in order to discover protein backbones. In: Proceedings of the International Multiconference on Computer Science and Information Technology, Mragowo, Poland, pp. 751\u2013756. IEEE Press, New York (2009)"},{"key":"9402_CR41","volume-title":"Proceedings of the International Workshop on Computational Proteomics","author":"C. Lavor","year":"2010","unstructured":"Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: On the solution of molecular distance geometry problems with interval data. In: Proceedings of the International Workshop on Computational Proteomics, Hong Kong. IEEE Press, New York (2010)"},{"key":"9402_CR42","unstructured":"Lavor, C., Lee, J., Lee-St. John, A., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optim. Lett. (accepted for publication)"},{"key":"9402_CR43","doi-asserted-by":"crossref","unstructured":"Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: On the computation of protein backbones by using artificial backbones of hydrogens. J. Glob. Optim. (accepted). doi: 10.1007\/s10898-010-9584-y","DOI":"10.1007\/s10898-010-9584-y"},{"key":"9402_CR44","volume-title":"Proc. of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain","author":"L. Liberti","year":"2005","unstructured":"Liberti, L., Lavor, C., Maculan, N.: Double VNS for the molecular distance geometry problem. In: Proc. of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)"},{"key":"9402_CR45","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":"9402_CR46","doi-asserted-by":"crossref","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. Glob. Optim. 43, 207\u2013218 (2009)","journal-title":"J. Glob. Optim."},{"key":"9402_CR47","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":"9402_CR48","unstructured":"Liberti, L., Masson, B., Lavor, C., Lee, J., Mucherino, A.: On the number of solutions of the discretizable molecular distance geometry problem. Technical Report, arXiv: 1010.1834v1 [cs.DM] (2010)"},{"issue":"3","key":"9402_CR49","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"7","author":"J.J. Mor\u00e9","year":"1997","unstructured":"Mor\u00e9, J.J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7(3), 814\u2013846 (1997)","journal-title":"SIAM J. Optim."},{"key":"9402_CR50","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1008380219900","volume":"15","author":"J.J. Mor\u00e9","year":"1999","unstructured":"Mor\u00e9, J.J., Wu, Z.: Distance geometry optimization for protein structures. J. Glob. Optim. 15, 219\u2013234 (1999)","journal-title":"J. Glob. Optim."},{"key":"9402_CR51","series-title":"World Academy of Science, Engineering and Technology","first-page":"349","volume-title":"Proceedings of the International Conference on Computational Biology","author":"A. Mucherino","year":"2009","unstructured":"Mucherino, A., Lavor, C.: The branch and prune algorithm for the molecular distance geometry problem with inexact distances. In: Proceedings of the International Conference on Computational Biology. World Academy of Science, Engineering and Technology, vol. 58, pp. 349\u2013353 (2009)"},{"key":"9402_CR52","first-page":"337","volume-title":"Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization","author":"A. Mucherino","year":"2009","unstructured":"Mucherino, A., Lavor, C., Maculan, N.: The molecular distance geometry problem applied to protein conformations. In: Cafieri, S., Mucherino, A., Nannicini, G., Tarissan, F., Liberti, L. (eds.) Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp.\u00a0337\u2013340. \u00c9cole Polytechnique, Paris (2009)"},{"key":"9402_CR53","volume-title":"ACS\/IEEE International Conference on Computer Systems and Applications (AICCSA10)","author":"A. Mucherino","year":"2010","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), Hammamet, Tunisia. IEEE Press, New York (2010)"},{"key":"9402_CR54","first-page":"333","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference, Montreal","author":"A. Mucherino","year":"2009","unstructured":"Mucherino, A., Liberti, L., Lavor, C., Maculan, N.: Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. In: Rothlauf, F. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, Montreal, pp. 333\u2013340. ACM, New York (2009)"},{"key":"9402_CR55","series-title":"LNCS","first-page":"186","volume-title":"Mathematical Software","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., van\u00a0der Hoeven, J., Joswig, M., Takayama, N. (eds.) Mathematical Software. LNCS, vol. 6327, pp. 186\u2013197. Springer, New York (2010)"},{"key":"9402_CR56","first-page":"181","volume-title":"Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding","author":"A.T. Phillips","year":"1996","unstructured":"Phillips, A.T., Rosen, J.B., Walke, V.H.: Molecular structure determination by convex underestimation of local energy minima. In: Pardalos, P.M., Shalloway, D., Xue, G. (eds.) Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, vol. 23, pp. 181\u2013198. American Mathematical Society, Providence (1996)"},{"key":"9402_CR57","volume-title":"Geometry","author":"A. Pogorelov","year":"1987","unstructured":"Pogorelov, A.: Geometry. Mir, Moscow (1987)"},{"issue":"1","key":"9402_CR58","doi-asserted-by":"crossref","first-page":"6","DOI":"10.2307\/2320705","volume":"88","author":"B. Roth","year":"1981","unstructured":"Roth, B.: Rigid and flexible frameworks. Am. Math. Mon. 88(1), 6\u201321 (1981)","journal-title":"Am. Math. Mon."},{"key":"9402_CR59","volume-title":"Proc. of Mini Euro Conference on Variable Neighbourhood Search","author":"R. Santana","year":"2005","unstructured":"Santana, R., Larra\u00f1aga, P., Lozano, J.A.: Combining variable neighbourhood search and estimation of distribution algorithms in the protein side chain placement problem. In: Proc. of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)"},{"key":"9402_CR60","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.artmed.2006.04.004","volume":"39","author":"R. Santana","year":"2007","unstructured":"Santana, R., Larra\u00a0naga, P., Lozano, J.A.: Side chain placement using estimation of distribution algorithms. Artif. Intell. Med. 39, 49\u201363 (2007)","journal-title":"Artif. Intell. Med."},{"key":"9402_CR61","first-page":"480","volume-title":"Proceedings of 17th Allerton Conference in Communications, Control and Computing","author":"J.B. Saxe","year":"1979","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 (1979)"},{"key":"9402_CR62","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-22464-0","volume-title":"Molecular Modelling and Simulation: An Interdisciplinary Guide","author":"T. Schlick","year":"2002","unstructured":"Schlick, T.: Molecular Modelling and Simulation: An Interdisciplinary Guide. Springer, New York (2002)"},{"issue":"3","key":"9402_CR63","doi-asserted-by":"crossref","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"I.J. Schoenberg","year":"1935","unstructured":"Schoenberg, I.J.: Remarks to Maurice Fr\u00e9chet\u2019s article \u201csur la d\u00e9finition axiomatique d\u2019une classe d\u2019espaces distanci\u00e9s vectoriellement applicable sur l\u2019espace de Hilbert\u201d. Ann. Math. 36(3), 724\u2013732 (1935)","journal-title":"Ann. Math."},{"key":"9402_CR64","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"M.-C. So","year":"2007","unstructured":"So, M.-C., Ye, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109, 367\u2013384 (2007)","journal-title":"Math. Program."},{"key":"9402_CR65","first-page":"148","volume":"29","author":"M. Trosset","year":"1998","unstructured":"Trosset, M.: Applications of multidimensional scaling to molecular conformation. Comput. Sci. Stat. 29, 148\u2013152 (1998)","journal-title":"Comput. Sci. Stat."},{"key":"9402_CR66","volume-title":"Proceedings of the Computational Systems Bioinformatics Conference","author":"L. Wang","year":"2005","unstructured":"Wang, L., Mettu, R., Donald, B.R.: An algebraic geometry approach to protein structure determination from nmr data. In: Proceedings of the Computational Systems Bioinformatics Conference. IEEE Press, New York (2005)"},{"key":"9402_CR67","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s10898-006-9080-6","volume":"37","author":"D. Wu","year":"2007","unstructured":"Wu, D., Wu, Z.: An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Glob. Optim. 37, 661\u2013673 (2007)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9402_CR68","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s11590-007-0060-7","volume":"2","author":"D. Wu","year":"2008","unstructured":"Wu, D., Wu, Z., Yuan, Y.: Rigid versus unique determination of protein structures with geometric buildup. Optim. Lett. 2(3), 319\u2013331 (2008)","journal-title":"Optim. Lett."},{"key":"9402_CR69","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1008244930007","volume":"11","author":"Z. Zou","year":"1997","unstructured":"Zou, Z., Bird, R., Schnabel, R.: A stochastic\/perturbation global optimization algorithm for distance geometry problems. J. Glob. Optim. 11, 91\u2013105 (1997)","journal-title":"J. Glob. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9402-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9402-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9402-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:40Z","timestamp":1559302600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9402-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,23]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9402"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9402-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,23]]}}}