A Filter-And-Fan Approach to the 2D HP Model of the Protein Folding Problem

Haitao Li; César Rego; Fred Glover

doi:10.1007/s10479-009-0666-5

A Filter-And-Fan Approach to the 2D HP Model of the Protein Folding Problem

Haitao Li, César Rego, Fred Glover

University of Missouri-St. Louis

Research output: Contribution to journal › Article › peer-review

Abstract

We examine a prominent and widely-studied model of the protein folding problem, the two-dimensional (2D) HP model, by means of a filter-and-fan (F&F) solution approach. Our method is designed to generate compound moves that explore the solution space in a dynamic and adaptive fashion. Computational results for standard sets of benchmark problems show that the F&F algorithm is highly competitive with the current leading algorithms, requiring only a single solution trial to obtain best known solutions to all problems tested, in contrast to a hundred or more trials required in the typical case to evaluate the performance of the best of the alternative methods.

Original language	American English
Journal	Annals of Operations Research
Volume	188
DOIs	https://doi.org/10.1007/s10479-009-0666-5
State	Published - Aug 2011

Disciplines

Business Administration, Management, and Operations

Access to Document

10.1007/s10479-009-0666-5License: Unspecified

Cite this

@article{8b2be6a988c24cccb255d789a3ecd182,

title = "A Filter-And-Fan Approach to the 2D HP Model of the Protein Folding Problem",

abstract = " We examine a prominent and widely-studied model of the protein folding problem, the two-dimensional (2D) HP model, by means of a filter-and-fan (F&F) solution approach. Our method is designed to generate compound moves that explore the solution space in a dynamic and adaptive fashion. Computational results for standard sets of benchmark problems show that the F&F algorithm is highly competitive with the current leading algorithms, requiring only a single solution trial to obtain best known solutions to all problems tested, in contrast to a hundred or more trials required in the typical case to evaluate the performance of the best of the alternative methods.",

author = "Haitao Li and C{\'e}sar Rego and Fred Glover",

note = "C{\'e}sar Rego Haitao Li Fred Glover We examine a prominent and widely-studied model of the protein folding problem, the two-dimensional (2D) HP model, by means of a filter-and-fan (F&F) solution approach. Our method is designed to generate compound moves that explore the solution space in a dynamic and adaptive fashion.",

year = "2011",

month = aug,

doi = "10.1007/s10479-009-0666-5",

language = "American English",

volume = "188",

journal = "Annals of Operations Research",

}

TY - JOUR

T1 - A Filter-And-Fan Approach to the 2D HP Model of the Protein Folding Problem

AU - Li, Haitao

AU - Rego, César

AU - Glover, Fred

N1 - César Rego Haitao Li Fred Glover We examine a prominent and widely-studied model of the protein folding problem, the two-dimensional (2D) HP model, by means of a filter-and-fan (F&F) solution approach. Our method is designed to generate compound moves that explore the solution space in a dynamic and adaptive fashion.

PY - 2011/8

Y1 - 2011/8

N2 - We examine a prominent and widely-studied model of the protein folding problem, the two-dimensional (2D) HP model, by means of a filter-and-fan (F&F) solution approach. Our method is designed to generate compound moves that explore the solution space in a dynamic and adaptive fashion. Computational results for standard sets of benchmark problems show that the F&F algorithm is highly competitive with the current leading algorithms, requiring only a single solution trial to obtain best known solutions to all problems tested, in contrast to a hundred or more trials required in the typical case to evaluate the performance of the best of the alternative methods.

AB - We examine a prominent and widely-studied model of the protein folding problem, the two-dimensional (2D) HP model, by means of a filter-and-fan (F&F) solution approach. Our method is designed to generate compound moves that explore the solution space in a dynamic and adaptive fashion. Computational results for standard sets of benchmark problems show that the F&F algorithm is highly competitive with the current leading algorithms, requiring only a single solution trial to obtain best known solutions to all problems tested, in contrast to a hundred or more trials required in the typical case to evaluate the performance of the best of the alternative methods.

UR - https://link.springer.com/article/10.1007/s10479-009-0666-5

U2 - 10.1007/s10479-009-0666-5

DO - 10.1007/s10479-009-0666-5

M3 - Article

VL - 188

JO - Annals of Operations Research

JF - Annals of Operations Research

ER -

A Filter-And-Fan Approach to the 2D HP Model of the Protein Folding Problem

Abstract

Disciplines

Access to Document

Other files and links

Cite this