{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:10Z","timestamp":1742913130951,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031453670"},{"type":"electronic","value":"9783031453687"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45368-7_12","type":"book-chapter","created":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T20:37:45Z","timestamp":1697056665000},"page":"178-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Custom Bio-Inspired Algorithm for\u00a0the\u00a0Molecular Distance Geometry Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6877-5205","authenticated-orcid":false,"given":"Sarah Ribeiro Lisboa","family":"Carneiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6751-2877","authenticated-orcid":false,"given":"Michael Ferreira","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1932-334X","authenticated-orcid":false,"given":"Douglas O.","family":"Cardoso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9359-5143","authenticated-orcid":false,"given":"Lu\u00eds","family":"Tarrataca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3081-9722","authenticated-orcid":false,"given":"Laura S.","family":"Assis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,12]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman, H.M., et al.: The protein data bank. Nucleic Acids Res. 28(1), 235\u2013242 (2000)","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"12_CR2","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."},{"key":"12_CR3","unstructured":"Carneiro, S., Souza, M., Filho, N., Tarrataca, L., Rosa, J., Assis, L.: Algoritmo gen\u00e9tico aplicado ao problema da geometria de dist\u00e2ncias moleculares. In: Anais do LII Simp\u00f3sio Brasileiro de Pesquisa Operacional (2020)"},{"key":"12_CR4","unstructured":"Creighton, T.E.: Proteins: Structures and Molecular Properties. Macmillan (1993)"},{"issue":"1","key":"12_CR5","first-page":"21","volume":"1","author":"M Cucuringu","year":"2012","unstructured":"Cucuringu, M., Singer, A., Cowburn, D.: Eigenvector synchronization, graph rigidity and the molecule problem. Inf. Infer. J. IMA 1(1), 21\u201367 (2012)","journal-title":"Inf. Infer. J. IMA"},{"issue":"1","key":"12_CR6","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. Global Optim. 22(1), 365\u2013375 (2002)","journal-title":"J. Global Optim."},{"key":"12_CR7","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search. Optimization, and Machine Learning (1989)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Goncalves, D.S., Lavor, C., Liberti, L., Souza, M.: A new algorithm for the $$^k$$dmdgp subclass of distance geometry problems (2020)","DOI":"10.1007\/s00453-021-00835-6"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.asoc.2015.04.061","volume":"34","author":"YJ Gong","year":"2015","unstructured":"Gong, Y.J., et al.: Distributed evolutionary algorithms and their models: a survey of the state-of-the-art. Appl. Soft Comput. 34, 286\u2013300 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson, B.: The molecule problem: exploiting structure in global optimization. SIAM J. Optim. 5(4), 835\u2013857 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"12_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.: The discretizable molecular distance geometry problem. Comput. Optim. Appl. 52(1), 115\u2013146 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"12_CR12","doi-asserted-by":"publisher","first-page":"4351","DOI":"10.1137\/080733103","volume":"31","author":"NHZ Leung","year":"2010","unstructured":"Leung, N.H.Z., Toh, K.C.: An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization. SIAM J. Sci. Comput. 31(6), 4351\u20134372 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2\u20133","key":"12_CR13","doi-asserted-by":"publisher","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. Global Optim. 43(2\u20133), 207\u2013218 (2009)","journal-title":"J. Global Optim."},{"key":"12_CR14","doi-asserted-by":"publisher","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, pp. 47\u201360. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5128-0_3","DOI":"10.1007\/978-1-4614-5128-0_3"},{"issue":"1","key":"12_CR15","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":"12_CR16","unstructured":"Maculan Filho, N., Lavor, C.C., de Souza, M.F., Alves, R.: \u00c1lgebra e Geometria no C\u00e1lculo de Estrutura Molecular. Col\u00f3quio Brasileiro de Matem\u00e1tica, IMPA (2017)"},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"7","author":"JJ Mor\u00e9","year":"1997","unstructured":"Mor\u00e9, J.J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7(3), 814\u2013836 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1008380219900","volume":"15","author":"JJ Mor\u00e9","year":"1999","unstructured":"Mor\u00e9, J.J., Wu, Z.: Distance geometry optimization for protein structures. J. Global Optim. 15(3), 219\u2013234 (1999)","journal-title":"J. Global Optim."},{"issue":"8","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1007\/s11590-011-0358-3","volume":"6","author":"A Mucherino","year":"2012","unstructured":"Mucherino, A., Lavor, C., Liberti, L.: The discretizable distance geometry problem. Optim. Lett. 6(8), 1671\u20131686 (2012)","journal-title":"Optim. Lett."},{"issue":"03","key":"12_CR20","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.: Exploiting symmetry properties of the discretizable molecular distance geometry problem. J. Bioinform. Comput. Biol. 10(03), 1242009 (2012)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-15582-6_34","volume-title":"Mathematical Software \u2013 ICMS 2010","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., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 186\u2013197. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15582-6_34"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Mulati, M.H., Constantino, A.A., da Silva, A.F.: Otimiza\u00e7\u00e3o por col\u00f4nia de formigas. In: Lopes, H.S., de Abreu Rodrigues, L.C., Steiner, M.T.A. (eds.) Meta-Heur\u00edsticas em Pesquisa Operacional, 1 edn., Chap. 4, pp. 53\u201368. Omnipax, Curitiba, PR (2013)","DOI":"10.7436\/2013.mhpo.04"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Nobile, M.S., Citrolo, A.G., Cazzaniga, P., Besozzi, D., Mauri, G.: A memetic hybrid method for the molecular distance geometry problem with incomplete information. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 1014\u20131021. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900386"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Schlick, T.: Molecular Modeling and Simulation: An Interdisciplinary Guide: An Interdisciplinary Guide, vol. 21. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6351-2","DOI":"10.1007\/978-1-4419-6351-2"},{"issue":"12","key":"12_CR25","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1007\/s11538-011-9644-6","volume":"73","author":"A Sit","year":"2011","unstructured":"Sit, A., Wu, Z.: Solving a generalized distance geometry problem for protein structure determination. Bull. Math. Biol. 73(12), 2809\u20132836 (2011)","journal-title":"Bull. Math. Biol."},{"key":"12_CR26","unstructured":"Souza, M., Gon\u00e7alves, D.S., Carvalho, L.M., Lavor, C., Liberti, L.: A new algorithm for a class of distance geometry problems. In: 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (2020)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Engineering Optimization: An Introduction with Metaheuristic Applications. Wiley (2010)","DOI":"10.1002\/9780470640425"}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45368-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:28:47Z","timestamp":1709828927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45368-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453670","9783031453687"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45368-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belo Horizonte","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.bracis.dcc.ufmg.br","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"242","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}