{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:37Z","timestamp":1740122677950,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007082","name":"Universidade Federal de Santa Catarina","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007082","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10589-023-00526-8","type":"journal-article","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T08:02:10Z","timestamp":1695628930000},"page":"501-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2243-8081","authenticated-orcid":false,"given":"Felipe","family":"Fidalgo","sequence":"first","affiliation":[]},{"given":"Emerson","family":"Castelani","sequence":"additional","affiliation":[]},{"given":"Guilherme","family":"Philippi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,25]]},"reference":[{"key":"526_CR1","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1111\/itor.12170","volume":"23","author":"L Liberti","year":"2016","unstructured":"Liberti, L., Lavor, C.: Six mathematical gems from the history of distance geometry. Int. Trans. Oper. Res. 23, 897\u2013920 (2016)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"526_CR2","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."},{"issue":"3","key":"526_CR3","first-page":"814","volume":"7","author":"J Mor\u00e9","year":"1997","unstructured":"Mor\u00e9, J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Comput. 7(3), 814\u2013836 (1997)","journal-title":"SIAM J. Comput."},{"key":"526_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/A:1026016804633","volume":"27","author":"LT Hoai An","year":"2003","unstructured":"Hoai An, L.T.: Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and dc programming. J. Glob. Optim. 27, 375\u2013397 (2003)","journal-title":"J. Glob. Optim."},{"key":"526_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"LT Hoai An","year":"2003","unstructured":"Hoai An, L.T., Tao, P.D.: Large scale molecular optimization from distance matrices by a DC optimization approach. SIAM J. Optim. 14, 77\u2013114 (2003)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"526_CR6","doi-asserted-by":"publisher","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."},{"issue":"5","key":"526_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(5), 2679\u20132708 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"526_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1111\/j.1475-3995.2009.00757.x","volume":"18","author":"L Liberti","year":"2011","unstructured":"Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18(1), 33\u201351 (2011)","journal-title":"Int. Trans. Oper. Res."},{"key":"526_CR9","series-title":"Springer Undergraduate Texts in Mathematics and Technology","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60792-4","volume-title":"Euclidean Distance Geometry: An Introduction","author":"L Liberti","year":"2017","unstructured":"Liberti, L., Lavor, C.: Euclidean Distance Geometry: An Introduction. Springer Undergraduate Texts in Mathematics and Technology, Springer, New York (2017)"},{"key":"526_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11750-020-00563-0","volume":"28","author":"L Liberti","year":"2020","unstructured":"Liberti, L.: Distance geometry and data science. TOP 28, 271\u2013339 (2020)","journal-title":"TOP"},{"key":"526_CR11","volume-title":"Distance Geometry and Molecular Conformation","author":"G Crippen","year":"1988","unstructured":"Crippen, G., Havel, T.: Distance Geometry and Molecular Conformation. Research Studies Press, Taunton (1988)"},{"key":"526_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.dam.2018.03.071","volume":"256","author":"C Lavor","year":"2019","unstructured":"Lavor, C., Liberti, L., Donald, B., Worley, B., Bardiaux, B., Malliavin, T.E., Nilges, M.: Minimal NMR distance information for rigidity protein graphs. Discrete Appl. Math. 256, 91\u2013104 (2019)","journal-title":"Discrete Appl. Math."},{"key":"526_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s11590-017-1225-7","volume":"14","author":"DS Gon\u00e7alves","year":"2019","unstructured":"Gon\u00e7alves, D.S.: A least-squares approach for discretizable distance geometry problems with inexact distances. Optim. Lett. 14, 423\u2013437 (2019)","journal-title":"Optim. Lett."},{"key":"526_CR14","doi-asserted-by":"publisher","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."},{"key":"526_CR15","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":"526_CR16","volume-title":"Die Graphische Statik Der Starren Systeme","author":"L Henneberg","year":"1886","unstructured":"Henneberg, L.: Die Graphische Statik Der Starren Systeme. Nabu Press, Charleston (1886)"},{"key":"526_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., Lee, J., Lavor, C., 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":"3","key":"526_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0219720012420097","volume":"10","author":"A Mucherino","year":"2012","unstructured":"Mucherino, A., Lavor, C., Liberti, L.: Exploiting symmetry properties of the discretizable molecular distance geometry problem. J. Bioinform. Comput. Biol. 10(3), 1\u201315 (2012)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"526_CR19","volume-title":"Geometry","author":"A Pogorelov","year":"1987","unstructured":"Pogorelov, A.: Geometry. MIR Publishers, Moscow (1987)"},{"key":"526_CR20","volume-title":"Matrix Computations","author":"G Golub","year":"1996","unstructured":"Golub, G., Van Loan, C.F.: Matrix Computations. The Johns Hopkins University Press, Baltimore (1996)"},{"key":"526_CR21","volume-title":"Projective Geometry: From Foundations to Applications","author":"A Beutelspacher","year":"1998","unstructured":"Beutelspacher, A., Rosenbaum, U.: Projective Geometry: From Foundations to Applications. Cambridge University Press, Cambridge (1998)"},{"key":"526_CR22","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1112\/plms\/s1-4.1.381","volume":"1","author":"WK Clifford","year":"1871","unstructured":"Clifford, W.K.: Preliminary sketch of biquaternions. Proc. Lond. Math. Soc. 1, 381\u2013395 (1871)","journal-title":"Proc. Lond. Math. Soc."},{"key":"526_CR23","volume-title":"Quaternions and Rotation Sequences: A Primer with Applications to Orbits, Aerospace, and Virtual Reality","author":"JB Kuipers","year":"2002","unstructured":"Kuipers, J.B.: Quaternions and Rotation Sequences: A Primer with Applications to Orbits, Aerospace, and Virtual Reality. Princeton University Press, Princeton (2002)"},{"key":"526_CR24","volume-title":"Elements of Quaternions","author":"WR Hamilton","year":"1899","unstructured":"Hamilton, W.R.: Elements of Quaternions, vol. 1. Green and Co., Longmans (1899)"},{"key":"526_CR25","unstructured":"Fog, A.: Instruction tables: lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs. https:\/\/www.agner.org\/optimize\/instruction_tables.pdf. Accessed 15 Aug 2019"},{"key":"526_CR26","doi-asserted-by":"publisher","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."},{"issue":"1","key":"526_CR27","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"key":"526_CR28","doi-asserted-by":"crossref","unstructured":"Mucherino, A., Liberti, L., Lavor, C.: Md-jeep: an implementation of a branch and prune algorithm for distance geometry problems. In: International Congress on Mathematical Software, ICMS. Lecture Notes on Computer Science, vol. 6327, pp. 186\u2013197. Springer, Kobe (2010)","DOI":"10.1007\/978-3-642-15582-6_34"},{"key":"526_CR29","doi-asserted-by":"publisher","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, New York (2006)"},{"key":"526_CR30","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1038\/nsb1203-980","volume":"10","author":"HM Berman","year":"2003","unstructured":"Berman, H.M., Hendrick, K., Nakamura, H.: Announcing the worldwide protein data bank. Nat. Struct. Mol. Biol. 10, 980 (2003)","journal-title":"Nat. Struct. Mol. Biol."},{"key":"526_CR31","volume-title":"Proteins: Structures and Molecular Properties","author":"T Creighton","year":"1993","unstructured":"Creighton, T.: Proteins: Structures and Molecular Properties, 2nd edn. W. H. Freeman, New York (1993)","edition":"2"},{"key":"526_CR32","volume-title":"Lehninger Principles of Biochemistry","author":"DL Nelson","year":"2004","unstructured":"Nelson, D.L., Cox, M.M.: Lehninger Principles of Biochemistry, 6th edn. W. H. Freeman, New York (2004)","edition":"6"},{"issue":"1","key":"526_CR33","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), 1\u201317 (2008)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"526_CR34","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375977.375978","volume":"6","author":"PR Panda","year":"2001","unstructured":"Panda, P.R., Catthoor, F., Dutt, N.D., Danckaert, K., Brockmeyer, E., Kulkarni, C., Vandercappelle, A., Kjeldsberg, P.G.: Data and memory optimization techniques for embedded systems. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 6(2), 149\u2013206 (2001)","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"key":"526_CR35","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"Benchmarking optimization software with performance profiles","year":"2002","unstructured":"Benchmarking optimization software with performance profiles: Dolan, E., Mor\u00e8. J. Math. Program. 91, 201\u2013213 (2002)","journal-title":"J. Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00526-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00526-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00526-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T19:08:48Z","timestamp":1707764928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00526-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,25]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["526"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00526-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,9,25]]},"assertion":[{"value":"15 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors would like to declare that there are no conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}