HP-model is one of the most successful and well-studied simplified lattice models of protein folding. It uses mathematical abstraction of proteins for hiding many aspects of the folding process and works as hypothesis generator. Due to the NP-hardness results of the protein folding problem many approximation algorithms, have been used to solve it. In the paper, the method for finding low energy conformations of proteins, based on the tabu search strategy, has been proposed. The algorithm has been extensively tested and the tests showed its very good performance.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.