{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:20:46Z","timestamp":1761488446538},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,4,24]],"date-time":"2010-04-24T00:00:00Z","timestamp":1272067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"},{"start":{"date-parts":[[2010,4,24]],"date-time":"2010-04-24T00:00:00Z","timestamp":1272067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2010,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>This work presents a master-slave parallel genetic algorithm for the protein folding problem, using the 3D-HP side-chain model (3D-HP-SC). This model is sparsely studied in the literature, although more expressive than other lattice models. The fitness function proposed includes information not only about the free-energy of the conformation, but also compactness of the side-chains. Since there is no benchmark available to date for this model, a set of 15 sequences was used, based on a simpler model. Results show that the parallel GA achieved a good level of efficiency and obtained biologically coherent results, suggesting the adequacy of the methodology. Future work will include new biologically-inspired genetic operators and more experiments to create new benchmarks.<\/jats:p>","DOI":"10.1007\/s13173-010-0002-6","type":"journal-article","created":{"date-parts":[[2010,5,24]],"date-time":"2010-05-24T23:51:11Z","timestamp":1274745071000},"page":"69-78","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Protein structure prediction with the 3D-HP side-chain model using a master\u2013slave parallel genetic algorithm"],"prefix":"10.1007","volume":"16","author":[{"given":"C\u00e9sar Manuel Vargas","family":"Ben\u00edtez","sequence":"first","affiliation":[]},{"given":"Heitor Silv\u00e9rio","family":"Lopes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Anfinsen\u00a0CB Principles that govern the folding of protein chains. Science (181)","DOI":"10.1126\/science.181.4096.223"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-71431-6_29","volume":"4419","author":"NB Armstrong Jr","year":"2007","unstructured":"Armstrong\u00a0NB\u00a0Jr, Lopes\u00a0HS, Lima\u00a0CRE (2007) Reconfigurable computing for accelerating protein folding simulations. Lect Notes Comput Sci 4419:314\u2013325","journal-title":"Lect Notes Comput Sci"},{"issue":"2\u20133","key":"2_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/PL00008278","volume":"25","author":"J Atkins","year":"1999","unstructured":"Atkins\u00a0J, Hart\u00a0WE (1999) On the intractability of protein folding with a finite alphabet. Algorithmica 25(2\u20133):279\u2013294","journal-title":"Algorithmica"},{"key":"2_CR4","unstructured":"Ben\u00edtez\u00a0CMV, Lopes\u00a0HS (2009) Algoritmo gen\u00e9tico aplicado \u00e0 predi\u00e7\u00e3o da\u00a0estrutura de\u00a0prote\u00ednas utilizando o modelo 3D-HP side chain. In: Anais do VII encontro nacional de intelig\u00eancia artificial (ENIA)"},{"key":"2_CR5","first-page":"1297","volume-title":"Proceedings of IEEE congress on evolutionary computation","author":"CMV Ben\u00edtez","year":"2009","unstructured":"Ben\u00edtez\u00a0CMV, Lopes\u00a0HS (2009) A parallel genetic algorithm for protein folding prediction using the 3DHP side-chain model. In: Proceedings of IEEE congress on evolutionary computation. IEEE Computer Society, Piscataway, pp 1297\u20131304"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1089\/cmb.1998.5.27","volume":"5","author":"B Berger","year":"1998","unstructured":"Berger\u00a0B, Leighton\u00a0FT (1998) Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J Comput Biol 5(1):27\u201340","journal-title":"J Comput Biol"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman\u00a0HM, Westbrook\u00a0J, Feng\u00a0Z, Gilliland\u00a0G, Bhat\u00a0TN, Weissig\u00a0H, Shindyalov\u00a0IN, Bourne\u00a0PE (2000) UniProt archive. Nucleic Acids Res 28(1):235\u2013242","journal-title":"Nucleic Acids Res"},{"key":"2_CR8","volume-title":"Statistics for experimenters: design, innovation, and discovery","author":"GE Box","year":"2005","unstructured":"Box\u00a0GE, Hunter\u00a0WG, Hunter\u00a0JS (2005) Statistics for experimenters: design, innovation, and discovery, 2nd edn. Wiley, New York","edition":"2"},{"key":"2_CR9","volume-title":"Efficient and accurate parallel genetic algorithms","author":"E Cant\u00fa-Paz","year":"2000","unstructured":"Cant\u00fa-Paz\u00a0E (2000) Efficient and accurate parallel genetic algorithms. Springer, New York"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1089\/cmb.1998.5.423","volume":"5","author":"P Crescenzi","year":"1998","unstructured":"Crescenzi\u00a0P, Goldman\u00a0D, Papadimitriou\u00a0C, Piccolboni\u00a0A, Yannakakis\u00a0M (1998) On the complexity of protein folding. J Comput Biol 5(3):423\u2013465","journal-title":"J Comput Biol"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1590\/S1415-47572004000400023","volume":"27","author":"FL Cust\u00f3dio","year":"2004","unstructured":"Cust\u00f3dio\u00a0FL, Barbosa\u00a0HJC, Dardenne\u00a0LE (2004) Investigation of the three-dimensional lattice HP protein folding model using a genetic algorithm. Genet Mol Biol 27(4):611\u2013615","journal-title":"Genet Mol Biol"},{"key":"2_CR12","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb\u00a0K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1002\/pro.5560040401","volume":"4","author":"KA Dill","year":"1995","unstructured":"Dill\u00a0KA, Bromberg\u00a0S, Yue\u00a0K, Fiebig\u00a0KM, Yee\u00a0DP, Thomas\u00a0PD, Chan\u00a0HS (1995) Principles of protein folding\u2014a\u00a0perspective from simple exact models. Protein Sci 4(4):561\u2013602","journal-title":"Protein Sci"},{"key":"2_CR14","volume-title":"Using MPI2: advanced features of the message-passing interface","author":"W Gropp","year":"1999","unstructured":"Gropp\u00a0W, Lusk\u00a0E, Thakur\u00a0R (1999) Using MPI2: advanced features of the message-passing interface. MIT Press, Cambridge"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-71618-1_40","volume":"4331","author":"F Hembecker","year":"2007","unstructured":"Hembecker\u00a0F, Lopes\u00a0HS, Godoy\u00a0W\u00a0Jr (2007) Particle swarm optimization for the multidimensional knapsack problem. Lect Notes Comput Sci 4331:358\u2013365","journal-title":"Lect Notes Comput Sci"},{"key":"2_CR16","unstructured":"Krasnogor\u00a0N, Hart\u00a0WE, Smith\u00a0J, Pelta\u00a0DA (1999) Protein structure prediction with evolutionary algorithms. In: Banzhaf\u00a0D, Eiben\u00a0G, Honovar\u00a0J, Smith\u00a0S (eds) Proceedings of the international genetic and evolutionary computation conference, San Mateo, CA, pp\u00a01596\u20131601"},{"issue":"17","key":"2_CR17","doi-asserted-by":"publisher","first-page":"3236","DOI":"10.1093\/bioinformatics\/bth191","volume":"20","author":"R Leinonen","year":"2004","unstructured":"Leinonen\u00a0R, Diez\u00a0FG, Binns\u00a0D, Fleischmann\u00a0W, Lopez\u00a0R, Apweiler\u00a0R (2004) UniProt archive. Bioinformatics 20(17):3236\u20133237","journal-title":"Bioinformatics"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/S0010-4655(02)00349-1","volume":"147","author":"MS Li","year":"2002","unstructured":"Li\u00a0MS, Klimov\u00a0DK, Thirumalai\u00a0D (2002) Folding in lattice models with side chains. Comput Phys Commun 147(1):625\u2013628","journal-title":"Comput Phys Commun"},{"key":"2_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69432-8","volume-title":"Parameter setting in evolutionary algorithms","author":"FG Lobo","year":"2007","unstructured":"Lobo\u00a0FG, Lima\u00a0CF, Michalewicz\u00a0Z (2007) Parameter setting in evolutionary algorithms. Springer, New York"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-70778-3_12","volume-title":"Computational intelligence in biomedicine and bioinformatics","author":"HS Lopes","year":"2008","unstructured":"Lopes\u00a0HS (2008) Evolutionary algorithms for the protein folding problem: a review and current trends. In: Computational intelligence in biomedicine and bioinformatics, vol\u00a0I. Springer, Heidelberg, pp 297\u2013315"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11740698_21","volume":"3871","author":"HS Lopes","year":"2005","unstructured":"Lopes\u00a0HS, Scapin\u00a0MP (2005) An enhanced genetic algorithm for protein structure prediction using the 2D hydrophobic-polar model. Lect Notes Comput Sci 3871:238\u2013246","journal-title":"Lect Notes Comput Sci"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-31996-2_15","volume":"3448","author":"MH Maruo","year":"2005","unstructured":"Maruo\u00a0MH, Lopes\u00a0HS, Delgado\u00a0MRB (2005) Self-adapting evolutionary parameters: encoding aspects for combinatorial optimization problems. Lect Notes Comput Sci 3448:154\u2013165","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto\u00a0M, Nishimura\u00a0T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul 8(1):3\u201330","journal-title":"ACM Trans Model Comput Simul"},{"key":"2_CR24","volume-title":"Lehninger principles of biochemistry","author":"DL Nelson","year":"2008","unstructured":"Nelson\u00a0DL, Cox\u00a0MM (2008) Lehninger principles of biochemistry, 5th edn. Freeman, New York","edition":"5"},{"key":"2_CR25","series-title":"Studies in computational intelligence","first-page":"205","volume-title":"Success in evolutionary computation","author":"MP Scapin","year":"2007","unstructured":"Scapin\u00a0MP, Lopes\u00a0HS (2007) A hybrid genetic algorithm for the protein folding problem using the 2D-HP lattice model. In: Yang\u00a0A, Shan\u00a0Y, Bui\u00a0LT (eds) Success in evolutionary computation. Studies in computational intelligence, vol\u00a092. Springer, Heidelberg, pp 205\u2013224"},{"key":"2_CR26","first-page":"935","volume-title":"Proceedings of 6th international conference on parallel and distributed computing applications and technologies","author":"J Song","year":"2005","unstructured":"Song\u00a0J, Cheng\u00a0J, Zheng\u00a0T, Mao\u00a0J (2005) A novel genetic algorithm for hp model protein folding. In: Proceedings of 6th international conference on parallel and distributed computing applications and technologies. IEEE Computer Society, Washington, pp 935\u2013937"},{"key":"2_CR27","unstructured":"Unger\u00a0R, Moult\u00a0J (1993) A genetic algorithm for 3D protein folding simulations. In: Proceedings of the 5th annual international conference on genetic algorithms, pp\u00a0581\u2013588"},{"issue":"3","key":"2_CR28","first-page":"2267","volume":"48","author":"K Yue","year":"1993","unstructured":"Yue\u00a0K, Dill\u00a0KA (1993) Sequence-structure relationships in proteins and copolymers. Phys Rev\u00a0E 48(3):2267\u20132278","journal-title":"Phys Rev\u00a0E"}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13173-010-0002-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13173-010-0002-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13173-010-0002-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13173-010-0002-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T21:05:50Z","timestamp":1630443950000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1007\/s13173-010-0002-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,24]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["2"],"URL":"https:\/\/doi.org\/10.1007\/s13173-010-0002-6","relation":{},"ISSN":["0104-6500","1678-4804"],"issn-type":[{"value":"0104-6500","type":"print"},{"value":"1678-4804","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,24]]},"assertion":[{"value":"29 September 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2010","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}