{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:53:43Z","timestamp":1760709223315,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T00:00:00Z","timestamp":1483574400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["Bip:Bip"],"award-info":[{"award-number":["Bip:Bip"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00454-016-9846-7","type":"journal-article","created":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T14:38:51Z","timestamp":1483627131000},"page":"371-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["New Error Measures and Methods for Realizing Protein Graphs from Distance Data"],"prefix":"10.1007","volume":"57","author":[{"given":"Claudia","family":"D\u2019Ambrosio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ky","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlile","family":"Lavor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3139-6821","authenticated-orcid":false,"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,5]]},"reference":[{"key":"9846_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1008655427845","volume":"12","author":"A Alfakih","year":"1999","unstructured":"Alfakih, A., Khandani, A., Wolkowicz, H.: Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12, 13\u201330 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"9846_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H Alt","year":"1988","unstructured":"Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity and symmetries of geometric objects. Discrete Comput. Geom. 3, 237\u2013256 (1988)","journal-title":"Discrete Comput. Geom."},{"key":"9846_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Hazan, E., Kale, S.: Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In: Foundations of Computer Science, FOCS, vol. 46, pp. 339\u2013348. IEEE (2005)","DOI":"10.1109\/SFCS.2005.35"},{"key":"9846_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8, 121\u2013164 (2012)","journal-title":"Theory Comput."},{"key":"9846_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","volume":"8","author":"M Atkinson","year":"1987","unstructured":"Atkinson, M.: An optimal algorithm for geometrical congruence. J. Algorithms 8, 159\u2013172 (1987)","journal-title":"J. Algorithms"},{"issue":"6","key":"9846_CR6","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1177\/0278364908100561","volume":"28","author":"A Bahr","year":"2009","unstructured":"Bahr, A., Leonard, J., Fallon, M.: Cooperative localization for autonomous underwater vehicles. Int. J. Robot. Res. 28(6), 714\u2013728 (2009)","journal-title":"Int. J. Robot. Res."},{"key":"9846_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, New York (2006)"},{"key":"9846_CR8","volume-title":"Distance Geometry: Theory, Methods, and Applications","author":"N Beeker","year":"2013","unstructured":"Beeker, N., Gaubert, S., Glusa, C., Liberti, L.: Is the distance geometry problem in NP? In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)"},{"issue":"4","key":"9846_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"9846_CR10","volume-title":"Real Algebraic and Semi-algebraic Sets","author":"R Benedetti","year":"1990","unstructured":"Benedetti, R., Risler, J.-J.: Real Algebraic and Semi-algebraic Sets. Hermann, Paris (1990)"},{"key":"9846_CR11","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.N., Bourne, P.: The protein data bank. Nucleic Acid Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acid Res."},{"key":"9846_CR12","unstructured":"Biswas, P.: Semidefinite programming approaches to distance geometry problems. Ph.D. Thesis, Stanford University (2007). http:\/\/www.optimization-online.org\/DB_FILE\/2008\/12\/2170.pdf"},{"key":"9846_CR13","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. Netw. 2, 188\u2013220 (2006)","journal-title":"ACM Trans. Sens. Netw."},{"key":"9846_CR14","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":"8","key":"9846_CR15","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1002\/cpa.21432","volume":"66","author":"E Cand\u00e8s","year":"2012","unstructured":"Cand\u00e8s, E., Strohmer, T., Voroninski, V.: PhaseLift: exact and stable signal recovery from magniture measurements via convex programming. Commun. Pure Appl. Math. 66(8), 1241\u20131274 (2012)","journal-title":"Commun. Pure Appl. Math."},{"key":"9846_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1186\/s12859-015-0451-1","volume":"16","author":"A Cassioli","year":"2015","unstructured":"Cassioli, A., Bordeaux, B., Bouvier, G., Mucherino, A., Alves, R., Liberti, L., Nilges, M., Lavor, C., Malliavin, T.: An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. BMC Bioinform. 16, 23 (2015)","journal-title":"BMC Bioinform."},{"key":"9846_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.dam.2014.08.035","volume":"197","author":"A Cassioli","year":"2015","unstructured":"Cassioli, A., G\u00fcnl\u00fck, O., Lavor, C., Liberti, L.: Discretization vertex orders for distance geometry. Discrete Appl. Math. 197, 27\u201341 (2015)","journal-title":"Discrete Appl. Math."},{"key":"9846_CR18","unstructured":"COIN-OR.: Introduction to IPOPT: a tutorial for downloading, installing, and using IPOPT (2006)"},{"issue":"15","key":"9846_CR19","doi-asserted-by":"crossref","first-page":"1849","DOI":"10.1002\/jcc.20110","volume":"25","author":"E Coutsias","year":"2004","unstructured":"Coutsias, E., Seok, C., Dill, K.: Using quaternions to calculate rmsd. J. Comput. Chem. 25(15), 1849\u20131857 (2004)","journal-title":"J. Comput. Chem."},{"key":"9846_CR20","series-title":"Global Optimization Workshop","first-page":"97","volume-title":"Mathematical and Applied Global Optimization","author":"C D\u2019Ambrosio","year":"2014","unstructured":"D\u2019Ambrosio, C., Ky, V.K., Lavor, C., Liberti, L., Maculan, N.: Computational experience on distance geometry problems 2.0. In: Casado, L., Garcia, I., Hendrix, E. (eds.) Mathematical and Applied Global Optimization. Global Optimization Workshop, vol. 12, pp. 97\u2013100. University of Malaga, Malaga (2014)"},{"key":"9846_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s11081-008-9072-0","volume":"11","author":"Y Ding","year":"2010","unstructured":"Ding, Y., Krislock, N., Qian, J., Wolkowicz, H.: Sensor network localization, Euclidean distance matrix completions, and graph realization. Optim. Eng. 11, 45\u201366 (2010)","journal-title":"Optim. Eng."},{"key":"9846_CR22","series-title":"LNCS","first-page":"475","volume-title":"COSIT","author":"H Du","year":"2013","unstructured":"Du, H., Alechina, N., Stock, K., Jackson, M.: The logic of NEAR and FAR. In: Tenbrink, T., et al. (eds.) COSIT. LNCS, vol. 8116, pp. 475\u2013494. Springer, Z\u00fcrich (2013)"},{"key":"9846_CR23","volume-title":"The AMPL Book","author":"R Fourer","year":"2002","unstructured":"Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)"},{"issue":"2","key":"9846_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.2517-6161.1991.tb01825.x","volume":"53","author":"C Goodall","year":"1991","unstructured":"Goodall, C.: Procrustes methods in the statistical analysis of shape. J. R. Stat. Soc. B 53(2), 285\u2013339 (1991)","journal-title":"J. R. Stat. Soc. B"},{"key":"9846_CR25","volume-title":"Die Graphische Statik der Starren Systeme","author":"L Henneberg","year":"1911","unstructured":"Henneberg, L.: Die Graphische Statik der Starren Systeme. Teubner, Leipzig (1911)"},{"key":"9846_CR26","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":"9846_CR27","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1007\/s00006-015-0532-2","volume":"25","author":"C Lavor","year":"2015","unstructured":"Lavor, C., Alves, R., Figuereido, W., Petraglia, A., Maculan, N.: Clifford algebra and the discretizable molecular distance geometry problem. Adv. Appl. Clifford Algebr. 25, 925\u2013942 (2015)","journal-title":"Adv. Appl. Clifford Algebr."},{"key":"9846_CR28","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s11590-011-0302-6","volume":"6","author":"C Lavor","year":"2012","unstructured":"Lavor, C., Lee, J., John, A.L.S., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optim. Lett. 6, 783\u2013796 (2012)","journal-title":"Optim. Lett."},{"key":"9846_CR29","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":"9846_CR30","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1007\/s10898-011-9799-6","volume":"56","author":"C Lavor","year":"2013","unstructured":"Lavor, C., Liberti, L., Mucherino, A.: The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances. J. Glob. Optim. 56, 855\u2013871 (2013)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9846_CR31","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1051\/ro\/2009005","volume":"43","author":"L Liberti","year":"2009","unstructured":"Liberti, L.: Reformulations in mathematical programming: definitions and systematics. RAIRO-Oper. Res. 43(1), 55\u201386 (2009)","journal-title":"RAIRO-Oper. Res."},{"key":"9846_CR32","unstructured":"Liberti, L., Dra\u017eic, M.: Variable neighbourhood search for the global optimization of constrained NLPs. In: Proceedings of GO Workshop, Almeria (2005)"},{"key":"9846_CR33","unstructured":"Liberti, L., Lavor, C.: Solving large-scale distance geometry problems exactly versus approximately. In: Optimization Society, Proceedings of the Annual Conference, INFORMS, Houston (2014)"},{"key":"9846_CR34","series-title":"LNCS","doi-asserted-by":"crossref","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 $${}^k$$ k DMDGP instances. In: Nielsen, F., Barbaresco, F. (eds.) Geometric Science of Information. LNCS, vol. 8085, pp. 224\u2013230. Springer, New York (2013)"},{"key":"9846_CR35","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."},{"issue":"1","key":"9846_CR36","doi-asserted-by":"crossref","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."},{"key":"9846_CR37","volume-title":"Distance Geometry: Theory, Methods, and Applications","author":"L Liberti","year":"2013","unstructured":"Liberti, L., Lavor, C., Mucherino, A.: The discretizable molecular distance geometry problem seems easier on proteins. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)"},{"key":"9846_CR38","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":"9846_CR39","doi-asserted-by":"crossref","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."},{"key":"9846_CR40","unstructured":"Liberti, L., Mencarelli, L.: A multiplicative weights update algorithm for MINLP, Working paper, (2014)"},{"key":"9846_CR41","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s12532-011-0031-y","volume":"3","author":"L Liberti","year":"2011","unstructured":"Liberti, L., Mladenovi\u0107, N., Nannicini, G.: A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3, 349\u2013390 (2011)","journal-title":"Math. Program. Comput."},{"key":"9846_CR42","doi-asserted-by":"crossref","unstructured":"L\u00f6fberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the International Symposium of Computer-Aided Control Systems Design, CACSD, Taipei, vol. 1. IEEE (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"9846_CR43","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1006\/jmbi.1994.1017","volume":"235","author":"V Maiorov","year":"1994","unstructured":"Maiorov, V., Crippen, G.: Significance of root-mean-square deviation in comparing three-dimensional structures of globular proteins. J. Mol. Biol. 235, 625\u2013634 (1994)","journal-title":"J. Mol. Biol."},{"key":"9846_CR44","volume-title":"Distance Geometry: Theory, Methods, and Applications","author":"T Malliavin","year":"2013","unstructured":"Malliavin, T., Mucherino, A., Nilges, M.: Distance geometry in structural biology. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)"},{"key":"9846_CR45","unstructured":"MATLAB R2014a. The MathWorks, Inc., Natick (2014)"},{"key":"9846_CR46","volume-title":"Topology from the Differentiable Viewpoint","author":"J Milnor","year":"1969","unstructured":"Milnor, J.: Topology from the Differentiable Viewpoint. University Press of Virginia, Charlottesville (1969)"},{"key":"9846_CR47","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1008380219900","volume":"15","author":"J Mor\u00e9","year":"1999","unstructured":"Mor\u00e9, J., Wu, Z.: Distance geometry optimization for protein structures. J. Glob. Optim. 15, 219\u2013234 (1999)","journal-title":"J. Glob. Optim."},{"key":"9846_CR48","unstructured":"Mosek ApS.: The mosek manual, Version 7 (Revision 114), 2014. www.mosek.com"},{"volume-title":"Distance Geometry: Theory, Methods, and Applications","year":"2013","key":"9846_CR49","unstructured":"Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.): Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)"},{"key":"9846_CR50","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S Plotkin","year":"1995","unstructured":"Plotkin, S., Shmoys, D., Tardos, \u00c9.: Fast approximation algorithm for fractional packing and covering problems. Math. Oper. Res. 20, 257\u2013301 (1995)","journal-title":"Math. Oper. Res."},{"key":"9846_CR51","unstructured":"Saxe, J.: Embeddability of weighted graphs in $$k$$ k -space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480\u2013489 (1979)"},{"key":"9846_CR52","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.acha.2010.02.001","volume":"30","author":"A Singer","year":"2011","unstructured":"Singer, A.: Angular synchronization by eigenvectors and semidefinite programming. Appl. Comput. Harmonic Anal. 30, 20\u201336 (2011)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"9846_CR53","first-page":"21","volume":"11","author":"T-S Tay","year":"1985","unstructured":"Tay, T.-S., Whiteley, W.: Generating isostatic frameworks. Struct. Topol. 11, 21\u201369 (1985)","journal-title":"Struct. Topol."},{"issue":"1","key":"9846_CR54","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"9846_CR55","unstructured":"Wikipedia. Variance, Sum of correlated variables (2016). Accessed 22 Jun 2016"},{"key":"9846_CR56","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF03167449","volume":"19","author":"Y Yajima","year":"2002","unstructured":"Yajima, Y.: Positive semidefinite relaxations for distance geometry problems. Jpn. J. Ind. Appl. Math. 19, 87\u2013112 (2002)","journal-title":"Jpn. J. Ind. Appl. Math."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9846-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-016-9846-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9846-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T15:46:41Z","timestamp":1718984801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-016-9846-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,5]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9846"],"URL":"https:\/\/doi.org\/10.1007\/s00454-016-9846-7","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2017,1,5]]}}}