{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T16:37:33Z","timestamp":1770827853208,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T00:00:00Z","timestamp":1301011200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11590-011-0302-6","type":"journal-article","created":{"date-parts":[[2011,3,24]],"date-time":"2011-03-24T06:19:10Z","timestamp":1300947550000},"page":"783-796","source":"Crossref","is-referenced-by-count":50,"title":["Discretization orders for distance geometry problems"],"prefix":"10.1007","volume":"6","author":[{"given":"Carlile","family":"Lavor","sequence":"first","affiliation":[]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Audrey","family":"Lee-St. John","sequence":"additional","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Mucherino","sequence":"additional","affiliation":[]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,25]]},"reference":[{"key":"302_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H. Berman","year":"2000","unstructured":"Berman H., Westbrook J., Feng Z., Gilliland G., Bhat T., Weissig H., Shindyalov I., Bourne P.: The protein data bank. Nucleic Acid Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acid Res."},{"key":"302_CR2","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, Oxford (1953)"},{"key":"302_CR3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.ipl.2008.05.009","volume":"108","author":"R. Carvalho","year":"2008","unstructured":"Carvalho R., 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."},{"issue":"11","key":"302_CR4","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"C. Cook","year":"1980","unstructured":"Cook C., Kim D.: Best sorting algorithm for nearly sorted lists. Commun. ACM 23(11), 620\u2013624 (1980)","journal-title":"Commun. ACM"},{"key":"302_CR5","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. Global Optim. 26, 321\u2013333 (2003)","journal-title":"J. Global Optim."},{"key":"302_CR6","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. IEEE Infocom Proceedings pp. 2673\u20132684 (2004)","DOI":"10.1109\/INFCOM.2004.1354686"},{"key":"302_CR7","volume-title":"The AMPL book","author":"R. Fourer","year":"2002","unstructured":"Fourer R., Gay D.: The AMPL book. Duxbury Press, Pacific Grove (2002)"},{"key":"302_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-1-4612-0693-4_3","volume-title":"Large-scale optimization with applications, Part III: molecular structure and optimization","author":"J. Gu","year":"1997","unstructured":"Gu J., Du B., Pardalos P.: Multispace search for protein folding. In: Biegler, L., Coleman, T., Conn, A., Santosa, F. (eds) Large-scale optimization with applications, Part III: molecular structure and optimization, pp. 47\u201368. Springer, Berlin (1997)"},{"key":"302_CR9","volume-title":"Die graphische Statik der starren Systeme","author":"L. Henneberg","year":"1911","unstructured":"Henneberg L.: Die graphische Statik der starren Systeme. B.G. Teubner, Leipzig (1911)"},{"key":"302_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1016351614255","volume":"38","author":"H. Huang","year":"2002","unstructured":"Huang H., Pardalos P.: A multivariate partition approach to optimization problems. Cyber. Syst. Anal. 38, 265\u2013275 (2002)","journal-title":"Cyber. Syst. Anal."},{"key":"302_CR11","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. Global Optim. 25, 3\u201321 (2003)","journal-title":"J. Global Optim."},{"key":"302_CR12","unstructured":"ILOG: ILOG CPLEX 11.0 User\u2019s Manual. ILOG S.A., Gentilly, France (2008)"},{"key":"302_CR13","doi-asserted-by":"crossref","unstructured":"Jiao, Y., Stillinger, F., Torquato, S.: Geometrical ambiguity of pair statistics I. point configurations. Tech. Rep. 0908.1366v1, arXiv (2009)","DOI":"10.1103\/PhysRevE.81.011105"},{"key":"302_CR14","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. (eds) Global optimization: scientific and engineering case studies., pp. 213\u2013225. Springer, Berlin (2006)"},{"key":"302_CR15","unstructured":"Lavor, C., Liberti, L., Maculan, N.: The discretizable molecular distance geometry problem. Tech. Rep. q-bio\/0608012, arXiv (2006)"},{"key":"302_CR16","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, second edn., pp. 2305\u20132311. Springer, New York (2009)","edition":"2"},{"key":"302_CR17","unstructured":"Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: The discretizable molecular distance geometry problem. Comput. Optim. Appl. (accepted)"},{"key":"302_CR18","doi-asserted-by":"crossref","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 (2009)","DOI":"10.1145\/1529282.1529451"},{"key":"302_CR19","doi-asserted-by":"crossref","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, pp. 751\u2013756. IEEE, Mragowo, Poland (2009)","DOI":"10.1109\/IMCSIT.2009.5352754"},{"key":"302_CR20","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. Global Optim. (accepted). doi: 10.1007\/s10898-010-9584-y","DOI":"10.1007\/s10898-010-9584-y"},{"key":"302_CR21","doi-asserted-by":"crossref","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. IEEE, Hong Kong (2010)","DOI":"10.1109\/BIBMW.2010.5703777"},{"key":"302_CR22","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":"302_CR23","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":"302_CR24","unstructured":"Liberti, L., Masson, B., Lavor, C., Lee, J., Mucherino, A.: On the number of solutions of the discretizable molecular distance geometry problem. Tech. Rep. 1010.1834v1[cs.DM], arXiv (2010)"},{"issue":"3","key":"302_CR25","doi-asserted-by":"crossref","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."},{"key":"302_CR26","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, vol. 58, pp. 349\u2013353. World Academy of Science, Engineering and Technology (2009)"},{"key":"302_CR27","unstructured":"Mucherino, A., Lavor, C., Liberti, L.: The discretizable distance geometry problem. Optim. Lett. (in revision)"},{"key":"302_CR28","first-page":"289","volume":"23","author":"A. Mucherino","year":"2009","unstructured":"Mucherino A., Lavor C., Liberti L., Maculan N.: On the definition of artificial backbones for the discretizable molecular distance geometry problem. Mathematica Balkanica 23, 289\u2013302 (2009)","journal-title":"Mathematica Balkanica"},{"key":"302_CR29","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. 337\u2013340. \u00c9cole Polytechnique, Paris (2009)"},{"key":"302_CR30","doi-asserted-by":"crossref","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, pp. 333\u2013340. ACM, Montreal (2009)","DOI":"10.1145\/1569901.1569948"},{"key":"302_CR31","volume-title":"New trends in mathematical programming","author":"P. Pardalos","year":"1998","unstructured":"Pardalos P., Liu X.: A tabu based pattern search method for the distance geometry problem. In: Giannessi, F., Rapcs\u00e1k, T., Koml\u00f3si, S. (eds) (eds.) New trends in mathematical programming, Kluwer, Dordrecht (1998)"},{"key":"302_CR32","doi-asserted-by":"crossref","unstructured":"Pardalos, P., Shalloway, D., Xue, G. (eds.) (1996) Global minimization of nonconvex energy functions: molecular conformation and protein folding, vol. 23. Am. Math. Soc.","DOI":"10.1090\/dimacs\/023"},{"key":"302_CR33","first-page":"606","volume-title":"Workshop on Experimental Algorithms, LNCS, vol. 3503","author":"T. Schank","year":"2005","unstructured":"Schank T., Wagner D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S. (eds) Workshop on Experimental Algorithms, LNCS, vol. 3503, pp. 606\u2013609. Springer, Berlin (2005)"},{"key":"302_CR34","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":"302_CR35","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. Global Optim. 37, 661\u2013673 (2007)","journal-title":"J. Global Optim."},{"issue":"3","key":"302_CR36","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."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0302-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0302-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0302-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T17:22:25Z","timestamp":1741108945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0302-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,25]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0302-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,25]]}}}