{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:51Z","timestamp":1740142491842,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T00:00:00Z","timestamp":1616976000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"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\/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\/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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s40314-021-01479-6","type":"journal-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T04:02:30Z","timestamp":1616990550000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the optimality of finding DMDGP symmetries"],"prefix":"10.1007","volume":"40","author":[{"given":"Carlile","family":"Lavor","sequence":"first","affiliation":[]},{"given":"Andr\u00eas","family":"Oliveira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3894-4002","authenticated-orcid":false,"given":"Wagner","family":"Rocha","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,29]]},"reference":[{"key":"1479_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10288-016-0314-2","volume":"14","author":"S Billinge","year":"2016","unstructured":"Billinge S, Duxbury P, Gon\u00e7alves D, Lavor C, Mucherino A (2016) Assigned and unassigned distance geometry: applications to biological molecules and nanostructures. 4OR 14:337\u2013376","journal-title":"4OR"},{"key":"1479_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10479-018-2989-6","volume":"271","author":"S Billinge","year":"2018","unstructured":"Billinge S, Duxbury P, Gon\u00e7alves D, Lavor C, Mucherino A (2018) Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures. Ann Oper Res 271:161\u2013203","journal-title":"Ann Oper Res"},{"key":"1479_CR3","doi-asserted-by":"publisher","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 (2008) Extending the geometric build-up algorithm for the molecular distance geometry problem. Inf Process Lett 108:234\u2013237","journal-title":"Inf Process Lett"},{"key":"1479_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2014.08.035","volume":"197","author":"A Cassioli","year":"2015","unstructured":"Cassioli A, Gunluk O, Lavor C, Liberti L (2015) Discretization vertex orders in distance geometry. Discret Appl Math 197:27\u201341","journal-title":"Discret Appl Math"},{"key":"1479_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s12859-015-0451-1","volume":"16","author":"A Cassioli","year":"2015","unstructured":"Cassioli A, Bordiaux B, Bouvier G, Mucherino A, Alves R, Liberti L, Nilges M, Lavor C, Malliavin T (2015) An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. BMC Bioinform 16:16\u201323","journal-title":"BMC Bioinform"},{"key":"1479_CR6","volume-title":"Distance geometry and molecular conformation","author":"G Crippen","year":"1988","unstructured":"Crippen G, Havel T (1988) Distance geometry and molecular conformation. Wiley, Oxford"},{"key":"1479_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10898-018-0610-9","volume":"71","author":"F Fidalgo","year":"2018","unstructured":"Fidalgo F, Gon\u00e7alves D, Lavor C, Liberti L, Mucherino A (2018) A symmetry-based splitting strategy for discretizable distance geometry problems. J Global Optim 71:717\u2013733","journal-title":"J Global Optim"},{"key":"1479_CR8","unstructured":"Lavor C, Liberti L, Maculan N (2005) Grover\u2019s algorithm applied to the molecular distance geometry problem. In: Proceedings of the 7th Brazilian congress of neural networks"},{"key":"1479_CR9","doi-asserted-by":"publisher","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 (2006) Computational experience with the molecular distance geometry problem. In: Pint\u00e9r J (ed) Global optimization: scientific and engineering case studies. Springer, Berlin, pp 213\u2013225"},{"key":"1479_CR10","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s11590-011-0302-6","volume":"6","author":"C Lavor","year":"2012","unstructured":"Lavor C, Lee J, Lee-St JA, Liberti L, Mucherino A, Sviridenko M (2012) Discretization orders for distance geometry problems. Optim Lett 6:783\u2013796","journal-title":"Optim Lett"},{"key":"1479_CR11","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 (2012) The discretizable molecular distance geometry problem. Comput Optim Appl 52:115\u2013146","journal-title":"Comput Optim Appl"},{"key":"1479_CR12","doi-asserted-by":"publisher","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 (2012) Recent advances on the discretizable molecular distance geometry problem. Eur J Oper Res 219:698\u2013706","journal-title":"Eur J Oper Res"},{"key":"1479_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57183-6","volume-title":"An introduction to distance geometry applied to molecular geometry","author":"C Lavor","year":"2017","unstructured":"Lavor C, Liberti L, Lodwick W, da Costa TM (2017) An introduction to distance geometry applied to molecular geometry. Springer, Berlin"},{"key":"1479_CR14","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, Nilges M (2019) Minimal NMR distance information for rigidity of protein graphs. Discret Appl Math 256:91\u2013104","journal-title":"Discret Appl Math"},{"key":"1479_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.dam.2019.07.021","volume":"267","author":"C Lavor","year":"2019","unstructured":"Lavor C, Souza M, Mariano L, Liberti L (2019) On the polinomiality of finding $^{K}$DMDGP re-orders. Discret Appl Math 267:190\u2013194","journal-title":"Discret Appl Math"},{"key":"1479_CR16","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1111\/itor.12170","volume":"23","author":"L Liberti","year":"2016","unstructured":"Liberti L, Lavor C (2016) Six mathematical gems from the history of distance geometry. Int Trans Oper Res 23:897\u2013920","journal-title":"Int Trans Oper Res"},{"key":"1479_CR17","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 (2017) Euclidean distance geometry: an introduction. Springer, Berlin"},{"key":"1479_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-99142-9_11","volume-title":"Open problems in optimization and data analysis","author":"L Liberti","year":"2018","unstructured":"Liberti L, Lavor C (2018) Open research areas in distance geometry. In: Migalas A, Pardalos P (eds) Open problems in optimization and data analysis. Springer, Berlin, pp 183\u2013223"},{"key":"1479_CR19","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 (2008) A branch-and-prune algorithm for the molecular distance geometry problem. Int Trans Oper Res 15:1\u201317","journal-title":"Int Trans Oper Res"},{"key":"1479_CR20","doi-asserted-by":"publisher","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 (2010) Molecular distance geometry methods: from continuous to discrete. Int Trans Oper Res 18:33\u201351","journal-title":"Int Trans Oper Res"},{"key":"1479_CR21","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-40020-9_23","volume":"8085","author":"L Liberti","year":"2013","unstructured":"Liberti L, Lavor C, Alencar J, Resende G (2013) Counting the number of solutions of $^{K}$DMDGP instances. Lect Notes Comput Sci 8085:224\u2013230","journal-title":"Lect Notes Comput Sci"},{"key":"1479_CR22","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 (2014) Euclidean distance geometry and applications. SIAM Rev 56:3\u201369","journal-title":"SIAM Rev"},{"key":"1479_CR23","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 (2014) On the number of realizations of certain Henneberg graphs arising in protein conformation. Discret Appl Math 165:213\u2013232","journal-title":"Discret Appl Math"},{"key":"1479_CR24","doi-asserted-by":"publisher","first-page":"4486","DOI":"10.1021\/acs.jcim.9b00215","volume":"59","author":"T Malliavin","year":"2019","unstructured":"Malliavin T, Mucherino A, Lavor C, Liberti L (2019) Systematic exploration of protein conformational space using a distance geometry approach. J Chem Inf Model 59:4486\u20134503","journal-title":"J Chem Inf Model"},{"key":"1479_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19066-8","volume-title":"A primer on quantum computing","author":"F Marquezino","year":"2019","unstructured":"Marquezino F, Portugal R, Lavor C (2019) A primer on quantum computing. Springer, Berlin"},{"key":"1479_CR26","doi-asserted-by":"publisher","first-page":"1242009","DOI":"10.1142\/S0219720012420097","volume":"10","author":"A Mucherino","year":"2012","unstructured":"Mucherino A, Lavor C, Liberti L (2012) Exploiting symmetry properties of the discretizable molecular distance geometry problem. J Bioinform Comput Biol 10:1242009","journal-title":"J Bioinform Comput Biol"},{"volume-title":"Distance geometry: theory, methods, and applications","year":"2013","key":"1479_CR27","unstructured":"Mucherino A, Lavor C, Liberti L, Maculan N (eds) (2013) Distance geometry: theory, methods, and applications. Springer, Berlin"},{"key":"1479_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-1-4614-5128-0_9","volume-title":"Distance geometry: theory, methods, and applications","author":"P Nucci","year":"2013","unstructured":"Nucci P, Nogueira L, Lavor C (2013) Solving the discretizable molecular distance geometry problem by multiple realization trees. In: Mucherino A, Lavor C, Liberti L, Maculan N (eds) Distance geometry: theory, methods, and applications. Springer, New York, pp 161\u2013176"},{"key":"1479_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1126\/science.2911719","volume":"243","author":"K W\u00fcthrich","year":"1989","unstructured":"W\u00fcthrich K (1989) Protein structure determination in solution by nuclear magnetic resonance spectroscopy. Science 243:45\u201350","journal-title":"Science"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01479-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-021-01479-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01479-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T22:07:06Z","timestamp":1617919626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-021-01479-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,29]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1479"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01479-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,3,29]]},"assertion":[{"value":"21 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"98"}}