Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2010 Jan 18;11 Suppl 1(Suppl 1):S39.
doi: 10.1186/1471-2105-11-S1-S39.

A hybrid approach to protein folding problem integrating constraint programming with local search

Affiliations

A hybrid approach to protein folding problem integrating constraint programming with local search

Abu Dayem Ullah et al. BMC Bioinformatics. .

Abstract

Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search.

Results: Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach.

Conclusion: Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems.

PubMed Disclaimer

Figures

Figure 1
Figure 1
Conformations for 1ENH. (a) Initial conformation with energy value -0.885 (b) Conformation with energy value -19.154 after first iteration (c) Conformation with energy value -29.006 after second iteration (d) Final conformation with energy value -157.062 after 2000 iterations. The circles represent the amino acids. The red circles in (b) and (c) represent the subchain perturbed during the local search iteration.

Similar articles

Cited by

References

    1. Anfinsen CB. Principles that govern the folding of protein chains. Science. 1973;181(96):223–230. doi: 10.1126/science.181.4096.223. - DOI - PubMed
    1. Dill KA, Bromberg S, Yue K, Chan HS, Ftebig KM, Yee DP, Thomas DP. Principles of protein folding - A perspective from simple exact models. Protein Science. 1995;4(4):561–602. - PMC - PubMed
    1. Crescenzi P, Goldman D, Papadimitriou C, Piccolboni A, Yannakakis M. On the complexity of protein folding. Journal of Computational Biology. 1998;5:423–465. doi: 10.1089/cmb.1998.5.423. - DOI - PubMed
    1. Hart WE, Istrail S. Robust proofs of NP-hardness for protein folding: General lattices and energy potentials. Journal of Computational Biology. 1997;4:1–22. doi: 10.1089/cmb.1997.4.1. - DOI - PubMed
    1. Lesh N, Mitzenmacher M, Whitesides S. ICCB '03: 7th Annual International Conference on Computational Biology. NY: ACM Press; 2003. A complete and effective move set for simplified protein folding; pp. 188–195.

LinkOut - more resources