{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:42:50Z","timestamp":1725540170104},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642052576"},{"type":"electronic","value":"9783642052583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05258-3_51","type":"book-chapter","created":{"date-parts":[[2009,10,31]],"date-time":"2009-10-31T11:14:41Z","timestamp":1256987681000},"page":"578-589","source":"Crossref","is-referenced-by-count":3,"title":["MultiQuenching Annealing Algorithm for Protein Folding Problem"],"prefix":"10.1007","author":[{"given":"Juan","family":"Frausto-Solis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Soberon-Mainero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernesto","family":"Li\u00f1\u00e1n-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1126\/science.181.4096.223","volume":"181","author":"C. Anfinsen","year":"1973","unstructured":"Anfinsen, C.: Principles that govern the folding of protein chains. Science\u00a0181, 223\u2013230 (1973)","journal-title":"Science"},{"key":"51_CR2","first-page":"44","volume":"65","author":"C. Levinthal","year":"1968","unstructured":"Levinthal, C.: Are there pathways for protein folding? J. Chem. Phys.\u00a065, 44\u201345 (1968)","journal-title":"J. Chem. Phys."},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"4598","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science\u00a04598, 220, 4598, 671\u2013680 (1983)","journal-title":"Science"},{"issue":"1","key":"51_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"Cerny, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications\u00a045(1), 41\u201351 (1985)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"51_CR5","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1080\/07391102.1991.10507841","volume":"8","author":"L. Morales","year":"1991","unstructured":"Morales, L., Gardu\u00f1o, R., Romero, D.: Application for simulated annealing to the multiple \u2013 minima problem in small peptides. J. Biomol. Str. And Dyn.\u00a08, 1721\u20131735 (1991)","journal-title":"J. Biomol. Str. And Dyn."},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Morales, L., Gardu\u00f1o, R., Romero, D.: The multiple \u2013 minima problem in small peptide revisited. The threshold accepting approach. J. Biomol. Str. And Dyn.\u00a09 (1992)","DOI":"10.1080\/07391102.1992.10507969"},{"key":"51_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-1280(94)80097-9","volume":"308","author":"R. Gardu\u00f1o","year":"1994","unstructured":"Gardu\u00f1o, R., Romero, D.: Heuristic Methods in conformational space search of peptides. J. Mol. Str.\u00a0308, 115\u2013123 (1994)","journal-title":"J. Mol. Str."},{"key":"51_CR8","unstructured":"Chen, W., Li, K., Liu, J.: The simulated annealing method applied to protein structure prediction. In: Third international conference on machine learning and cybernetics, Shanghai (2004)"},{"key":"51_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-72586-2_53","volume-title":"Computational Science \u2013 ICCS 2007","author":"J. Frausto-Solis","year":"2007","unstructured":"Frausto-Solis, J., Rom\u00e1n, E.F., Romero, D., Soberon, X., Li\u00f1an-Garc\u00eda, E.: Analytically Tuned Simulated Annealing applied to the Protein Folding Problem. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04488, pp. 370\u2013377. Springer, Heidelberg (2007)"},{"key":"51_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/978-3-540-24767-8_80","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"H. Sanvicente","year":"2004","unstructured":"Sanvicente, H., Frausto-Sol\u00eds, J.: A Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 755\u2013763. Springer, Heidelberg (2004)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Eisenmenger, F., Hansmann, U., Hayryan, S., Hu, C.: An Enhanced Version of SMMP \u2013 Open source software package for simulation of proteins. Comp. Phys. Comm., 174\u2013422 (2006)","DOI":"10.1016\/j.cpc.2005.10.013"},{"key":"51_CR12","unstructured":"Sanvicente-Sanchez, H.: Metodolog\u00eda de paralelizaci\u00f3n del ciclo de temperatura en algoritmos tipo recocido simulado. Tesis doctoral, ITESM Campus Cuernavaca, M\u00e9xico (2003)"},{"key":"51_CR13","unstructured":"Sanvicente-Sanchez, H., Frausto-Solis, J.: Optimizaci\u00f3n de los di\u00e1metros de las tuber\u00edas de una red de distribuci\u00f3n de agua mediante algoritmos de recocido simulado. Ingenier\u00eda hidr\u00e1ulica en M\u00e9xico XVIII(1), 105\u2013118 (2003)"},{"key":"51_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/11496199_31","volume-title":"Algorithmic Applications in Management","author":"H. Sanvicente-Sanchez","year":"2005","unstructured":"Sanvicente-Sanchez, H., Frausto-Solis, J., Imperial, F.: Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol.\u00a03521, pp. 281\u2013290. Springer, Heidelberg (2005)"},{"key":"51_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"ANDYMARK: An analytical method to establish dynamically the length of the Markov chain in simulated annealing for the satisfability problem","author":"J. Frausto-Solis","year":"2006","unstructured":"Frausto-Solis, J., Sanvicente-Sanchez, H., Imperial, F.: ANDYMARK: An analytical method to establish dynamically the length of the Markov chain in simulated annealing for the satisfability problem. LNCS. Springer, Heidelberg (2006)"},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0010-4655(01)00197-7","volume":"138","author":"F. Eisenmenger","year":"2001","unstructured":"Eisenmenger, F., Hansmann, U., Hayryan, S., Hu, C.: SMMP: A modern Package for Protein Simulation. Comp. Phys. Comm.\u00a0138, 192 (2001)","journal-title":"Comp. Phys. Comm."},{"key":"51_CR17","unstructured":"Protein Data Bank web page, http:\/\/www.rcsb.org"}],"container-title":["Lecture Notes in Computer Science","MICAI 2009: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05258-3_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:50:14Z","timestamp":1606168214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05258-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642052576","9783642052583"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05258-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}