{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:48:34Z","timestamp":1773276514840,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,30]],"date-time":"2009-10-30T00:00:00Z","timestamp":1256860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10479-009-0666-5","type":"journal-article","created":{"date-parts":[[2009,10,29]],"date-time":"2009-10-29T03:56:09Z","timestamp":1256788569000},"page":"389-414","source":"Crossref","is-referenced-by-count":10,"title":["A filter-and-fan approach to the 2D HP model of\u00a0the\u00a0protein folding problem"],"prefix":"10.1007","volume":"188","author":[{"given":"C\u00e9sar","family":"Rego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,30]]},"reference":[{"issue":"9","key":"666_CR1","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1073\/pnas.47.9.1309","volume":"47","author":"C. B. Anfinsen","year":"1961","unstructured":"Anfinsen, C. B., Haber, E., Sela, M., & White, F. H. (1961). The kinetics of formation of native ribonuclease during oxidation of the reduced polypeptide chain. Proceedings of the National Academy of Sciences, 47(9), 1309\u20131314.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"666_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1011485622743","volume":"6","author":"R. Backofen","year":"2001","unstructured":"Backofen, R. (2001). The protein structure prediction problem: a constraint optimization approach using a new lower bound. Constraints, 6, 223\u2013255.","journal-title":"Constraints"},{"issue":"1","key":"666_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H. M. Berman","year":"2000","unstructured":"Berman, H. M., Westbrook, J., Feng, Z. K., Gilliland, G., Bhat, T. N., Weissig, H., Shindyalov, I. N., & Bourne, P. E. (2000). The protein data bank. Nucleic Acids Research, 28(1), 235\u2013242.","journal-title":"Nucleic Acids Research"},{"key":"666_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/267521.267528","volume-title":"Proceedings of the first annual international conferences on computational molecular biology (RECOMB97)","author":"E. Bornberg-Bauer","year":"1997","unstructured":"Bornberg-Bauer, E. (1997). Chain growth algorithms for HP-type lattice proteins. In Proceedings of the first annual international conferences on computational molecular biology (RECOMB97) (pp. 47\u201355). New York: ACM Press."},{"issue":"2","key":"666_CR5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1063\/1.881371","volume":"46","author":"H. S. Chan","year":"1993","unstructured":"Chan, H. S., & Dill, K. A. (1993). The protein folding problem. Physics Today, 46(2), 24\u201332.","journal-title":"Physics Today"},{"issue":"9","key":"666_CR6","doi-asserted-by":"crossref","first-page":"1886","DOI":"10.1103\/PhysRevLett.83.1886","volume":"83","author":"G. Chikenji","year":"1999","unstructured":"Chikenji, G., Kiduchi, M., & Iba, Y. (1999). Multi-self-overlap ensemble for protein folding: ground state search and thermodynamics. Physical Review Letters, 83(9), 1886\u20131889.","journal-title":"Physical Review Letters"},{"key":"666_CR7","doi-asserted-by":"crossref","first-page":"3287","DOI":"10.1021\/bi00465a020","volume":"29","author":"D. G. Covell","year":"1990","unstructured":"Covell, D. G., & Jernigan, R. L. (1990). Conformation of folded proteins in restricted spaces. Biochemistry, 29, 3287\u20133294.","journal-title":"Biochemistry"},{"key":"666_CR8","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Goldman, D., Papadimitriou, C., Piccolboni, A., & Yanakakis, M. (1998). On the complexity of protein folding. In Proceedings of the 13th annual ACM symposium of theory of computing (STOC 98) (pp.\u00a0597\u2013603).","DOI":"10.1089\/cmb.1998.5.423"},{"key":"666_CR9","first-page":"80","volume-title":"Lecture notes in computer sciences","author":"V. Cutello","year":"2005","unstructured":"Cutello, V., Morelli, G., Nicosia, G., & Pavone, M. (2005). Immune algorithms with aging operators for the string folding problem and the protein folding problem. In Lecture notes in computer sciences (Vol.\u00a03348, pp.\u00a080\u201390). Berlin: Springer."},{"key":"666_CR10","unstructured":"Cutello, V., Nicosia, G., Pavone, M., & Timmis, J. (2006). An immune algorithm for protein structure prediction on lattice models. IEEE Transaction on Evolutionary Computation."},{"key":"666_CR11","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1006\/jmbi.1994.1193","volume":"236","author":"T. Dandekar","year":"1994","unstructured":"Dandekar, T., & Argos, P. (1994). Folding the main chain of small proteins with genetic algorithm. Journal of Molecular Biology, 236, 844\u2013861.","journal-title":"Journal of Molecular Biology"},{"issue":"6","key":"666_CR12","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1021\/bi00327a032","volume":"24","author":"K. A. Dill","year":"1985","unstructured":"Dill, K. A. (1985). Theory for the folding and stability of globular proteins. Biochemistry, 24(6), 1501\u20131509.","journal-title":"Biochemistry"},{"key":"666_CR13","unstructured":"Dongarra, J. J. (2006). Performance of various computers using standard linear equations software (Linpack Benchmark Report). University of Tennessee Computer Science Technical Report, CS-89-85."},{"issue":"1","key":"666_CR14","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156\u2013166.","journal-title":"Decision Sciences"},{"issue":"3","key":"666_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search\u2014part I. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"666_CR16","doi-asserted-by":"crossref","unstructured":"Glover, F. (1992). New ejection chain and alternating path methods for traveling salesman problems. Computer Science and Operations Research, 449\u2013509.","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"issue":"4","key":"666_CR17","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F. Glover","year":"1995","unstructured":"Glover, F. (1995). Tabu thresholding: improved search by nonmonotonic trajectories. ORSA Journal on Computing, 7(4), 426\u2013442.","journal-title":"ORSA Journal on Computing"},{"key":"666_CR18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996a). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"666_CR19","first-page":"1","volume-title":"Interfaces in computer science and operations research","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996b). Tabu search and adaptive memory programming\u2014advances, applications and challenges. In Barr, Helgason, & Kennington (Eds.), Interfaces in computer science and operations research (pp. 1\u201375). Dordrecht: Kluwer Academic."},{"key":"666_CR20","series-title":"Lecture notes in computer science","first-page":"3","volume-title":"Artificial evolution","author":"F. Glover","year":"1998","unstructured":"Glover, F. (1998). A template for scatter search and path relinking. In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, & D. Snyers (Eds.), Lecture notes in computer science : Vol. 1363. Artificial evolution (pp. 3\u201351). Berlin: Springer."},{"key":"666_CR21","first-page":"297","volume-title":"New ideas in optimization","author":"F. Glover","year":"1999","unstructured":"Glover, F. (1999). Scatter search and path relinking. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 297\u2013316). New York: McGraw\u2013Hill."},{"key":"666_CR22","first-page":"71","volume-title":"Modern heuristic techniques for combinatorial problems","author":"F. Glover","year":"1993","unstructured":"Glover, F., & Laguna, M. (1993). Tabu search. In C. Reeves (Ed.), Modern heuristic techniques for combinatorial problems (pp. 71\u2013140). Oxford: Blackwell."},{"key":"666_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic."},{"issue":"10","key":"666_CR24","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1103\/PhysRevLett.56.1015","volume":"56","author":"J. Goodman","year":"1986","unstructured":"Goodman, J., Sokal, A. D. (1986). Multigrid Monte Carlo method for lattice field theories. Physics Review Letters, 56(10), 1015\u20131018.","journal-title":"Physics Review Letters"},{"issue":"3","key":"666_CR25","first-page":"3682","volume":"56","author":"P. Grassberger","year":"1997","unstructured":"Grassberger, P. (1997). Pruned-enriched Rosenbluth method: simulations of theta polymers of chain. Physical Review, 56(3), 3682\u20133693.","journal-title":"Physical Review"},{"issue":"1","key":"666_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1089\/cmb.1996.3.53","volume":"3","author":"W. E. Hart","year":"1996","unstructured":"Hart, W. E., & Istrail, S. (1996). Fast protein folding in the hydrophobic-hydrophilic model within three-eighth of optimal. Journal of Computational Biology, 3(1), 53\u201396.","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"666_CR27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1089\/cmb.1997.4.241","volume":"4","author":"W. E. Hart","year":"1997","unstructured":"Hart, W. E., & Istrail, S. (1997). Lattice and off-lattice side chain models of protein folding: linear time structure prediction better than 86% of optimal. Journal of Computational Biology, 4(3), 241\u2013259.","journal-title":"Journal of Computational Biology"},{"key":"666_CR28","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1093\/protein\/12.9.721","volume":"12","author":"J. D. Hirst","year":"1999","unstructured":"Hirst, J. D. (1999). The evolutionary landscape of functional model proteins. Protein Engineering, 12, 721\u2013726.","journal-title":"Protein Engineering"},{"issue":"1","key":"666_CR29","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1063\/1.1522710","volume":"118","author":"H. P. Hsu","year":"2003","unstructured":"Hsu, H. P., Mehra, V., Nadler, W., & Grassberger, P. (2003a). Growth algorithms for lattice heteropolymers at low temperatures. Journal of Chemical Physics, 118(1), 444\u2013451.","journal-title":"Journal of Chemical Physics"},{"issue":"2","key":"666_CR30","doi-asserted-by":"crossref","first-page":"021113","DOI":"10.1103\/PhysRevE.68.021113","volume":"68","author":"H. P. Hsu","year":"2003","unstructured":"Hsu, H. P., Mehra, V., Nadler, W., & Grassberger, P. (2003b). Growth-based optimization algorithm for lattice heteropolymers. Physical Review E, 68(2), 021113.","journal-title":"Physical Review E"},{"issue":"8","key":"666_CR31","doi-asserted-by":"crossref","first-page":"4592","DOI":"10.1063\/1.1592796","volume":"119","author":"T. Jiang","year":"2003","unstructured":"Jiang, T., Cui, Q., Shi, G., & Ma, S. (2003). Protein folding simulations of the hydrophobic-hydrophilic model by combining tabu search with genetic algorithms. Journal of Chemical Physics, 119(8), 4592\u20134596.","journal-title":"Journal of Chemical Physics"},{"key":"666_CR32","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0303-2647(98)00090-2","volume":"50","author":"R. Konig","year":"1999","unstructured":"Konig, R., & Dandekar, T. (1999). Improving genetic algorithms for protein folding simulation by systematic crossover. BioSystems, 50, 17\u201325.","journal-title":"BioSystems"},{"key":"666_CR33","unstructured":"Krasnogor, N., Pelta, D., Lopez, P. M., Mocciola, P., & de\u00a0la Canal, E. (1998). Genetic algorithms for the protein folding problem: a critical review. In Proceedings of engineering of intelligence systems (pp.\u00a0353\u2013360). ICSC Academic Press."},{"key":"666_CR34","unstructured":"Krasnogor, N., Hart, W. E., Smith, J. E., & Pelta, D. A. (1999). Protein structure prediction with evolutionary algorithms. In Proceedings of the 1999 international genetic and evolutionary computation conference (GECCO99), San Mateo CA (pp.\u00a01596\u20131601)."},{"key":"666_CR35","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1007\/3-540-45712-7_74","volume-title":"Proceedings of parallel problem solving from nature","author":"N. Krasnogor","year":"2002","unstructured":"Krasnogor, N., Blackburnem, B., Pelta, D. A., & Burk, E. K. (2002). Multimeme algorithms for protein structure prediction. In Lecture notes in computer science : Vol. 2439. Proceedings of parallel problem solving from nature (pp. 769\u2013778). Berlin: Springer."},{"key":"666_CR36","first-page":"2986","volume":"22","author":"K. F. Lau","year":"1989","unstructured":"Lau, K. F., & Dill, K. A. (1989). A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules, 22, 2986\u20133997.","journal-title":"Macromolecules"},{"key":"666_CR37","doi-asserted-by":"crossref","unstructured":"Lengauer, T. (1993). Algorithmic research problems in molecular bioinformatics. In Proceedings of the second Israel symposium on theory of computing systems (ISTCS), Natanya, Israel (pp.\u00a0177\u2013192).","DOI":"10.1109\/ISTCS.1993.253471"},{"key":"666_CR38","first-page":"188","volume-title":"Proceedings of the 7th annual international conference on research in computational molecular biology (RECOMB)","author":"N. Lesh","year":"2003","unstructured":"Lesh, N., Mitzenmacher, M., & Whitesides, S. (2003). A complete and effective move set for simple protein folding. In Proceedings of the 7th annual international conference on research in computational molecular biology (RECOMB) (pp. 188\u2013195). New York: ACM Press."},{"issue":"7","key":"666_CR39","doi-asserted-by":"crossref","first-page":"3374","DOI":"10.1063\/1.1387478","volume":"115","author":"F. Liang","year":"2001","unstructured":"Liang, F., & Wong, W. H. (2001). Evolutionary Monte Carlo for protein folding simulations. Journal of Chemical Physics, 115(7), 3374\u20133380.","journal-title":"Journal of Chemical Physics"},{"issue":"24","key":"666_CR40","doi-asserted-by":"crossref","first-page":"10443","DOI":"10.1021\/jp9601274","volume":"100","author":"N. J. Nunes","year":"1996","unstructured":"Nunes, N. J., Chen, K., & Hutchinson (1996). Flexible lattice model to study protein folding. Journal of Physical Chemistry, 100(24), 10443\u201310449.","journal-title":"Journal of Physical Chemistry"},{"key":"666_CR41","volume-title":"Recent advances in memetic algorithms","author":"D. A. Pelta","year":"2004","unstructured":"Pelta, D. A., & Krasnogor, N. (2004). Multimeme algorithms using fuzzy logic based memes for protein structure prediction. In Recent advances in memetic algorithms. Berlin: Springer."},{"issue":"6","key":"666_CR42","doi-asserted-by":"crossref","first-page":"2418","DOI":"10.1063\/1.473791","volume":"106","author":"R. Ramakrishnan","year":"1997","unstructured":"Ramakrishnan, R., Ramachandran, B., & Pekny, J. F. (1997). A dynamic Monte Carlo algorithm for exploration of dense conformational spaces in heteropolymers. Journal of Chemical Physics, 106(6), 2418\u20132424.","journal-title":"Journal of Chemical Physics"},{"key":"666_CR43","first-page":"309","volume-title":"The travelling salesman problem and its variations","author":"C. Rego","year":"2002","unstructured":"Rego, C., & Glover, F. (2002). Local search and metaheuristics for the travelling salesman problem. In G. Gutin & A. Punnen (Eds.), The travelling salesman problem and its variations (pp. 309\u2013368). Dordrecht: Kluwer Academic."},{"issue":"1","key":"666_CR44","doi-asserted-by":"crossref","first-page":"54-7","DOI":"10.1038\/scientificamerican0191-54","volume":"264","author":"F. M. Richards","year":"1991","unstructured":"Richards, F. M. (1991). The protein folding problem. Scientific American, 264(1), 54-7, 60-3.","journal-title":"Scientific American"},{"key":"666_CR45","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/3-540-44886-1_30","volume-title":"Proceedings of advances in artificial intelligence, AI 2003","author":"A. Shmygelska","year":"2003","unstructured":"Shmygelska, A., & Hoos, H. H. (2003). An improved ant colony optimization algorithm for the 2D HP protein folding problem. In Lecture notes in computer science. Proceedings of advances in artificial intelligence, AI 2003 (pp. 400\u2013417). Berlin: Springer."},{"issue":"1","key":"666_CR46","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1186\/1471-2105-6-30","volume":"6","author":"A. Shmygelska","year":"2005","unstructured":"Shmygelska, A., & Hoos, H. H. (2005). An ant colony optimization algorithm for the 2D and 3D hydrophobic polar protein folding problem. BMC Bioinformatics, 6(1), 30.","journal-title":"BMC Bioinformatics"},{"key":"666_CR47","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-45724-0_4","volume-title":"Proceedings of the 3rd workshop on ant algorithms","author":"A. Shmygelska","year":"2002","unstructured":"Shmygelska, A., Hernandez, R., & Hoos, H. H. (2002). An ant colony algorithm for the 2D HP protein folding problem. In Lecture notes in computer science : Vol. 2463. Proceedings of the 3rd workshop on ant algorithms (pp. 40\u201352). Berlin: Springer."},{"key":"666_CR48","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/00268979200100061","volume":"75","author":"J.\u00a0I. Siepmann","year":"1992","unstructured":"Siepmann, J.\u00a0I., Frenkel, D. (1992). Configurational-bias Monte Carlo: a new sampling scheme for flexible chains. Molecular Physics, 75, 59\u201370.","journal-title":"Molecular Physics"},{"key":"666_CR49","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1126\/science.250.4984.1121","volume":"250","author":"J. Skolnick","year":"1990","unstructured":"Skolnick, J., & Kolinski, A. (1990). Simulations of the folding of globular proteins. Science, 250, 1121\u20131125.","journal-title":"Science"},{"issue":"2","key":"666_CR50","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1063\/1.467775","volume":"101","author":"N. D. Socci","year":"1994","unstructured":"Socci, N. D., & Onuchic, J. N. (1994). Folding kinetics of protein like heteropolymers. Journal of Chemical Physics, 101(2), 1519\u20131528.","journal-title":"Journal of Chemical Physics"},{"key":"666_CR51","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1006\/jmbi.1993.1258","volume":"231","author":"R. Unger","year":"1993","unstructured":"Unger, R., & Moult, J. (1993). Genetic algorithms for protein folding simulations. Journal of Molecular Biology, 231, 75\u201381.","journal-title":"Journal of Molecular Biology"},{"key":"666_CR52","first-page":"225101(1)","volume":"126","author":"J. Zhang","year":"2007","unstructured":"Zhang, J., Kou, S. C., & Liu, J. S. (2007). Biopolymer structure simulation and optimization via fragment regrowth Monte Carlo. Journal of Chemical Physics, 126, 225101(1)\u2013225101(7).","journal-title":"Journal of Chemical Physics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0666-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0666-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0666-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:58Z","timestamp":1559138878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0666-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,30]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["666"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0666-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,30]]}}}