Output details

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

<28>The paper proposes a hybrid approach to protein folding simulations that combines constraint programming and local search paradigms. 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 get 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 research on adopting hybrid techniques to solve other hard optimization problems.