Intelligent path planning for construction the Barnase protein

Protein is a fundamental, perplexing structure of living creatures, produced by sequential amino acids folded along the construction of protein. In the recent century, despite improvements in biology science, determining the steps of protein folding is still an ambiguous problem. It is one of NP-hard problems in biology. In other words, the biologists have not found any complete solution for it yet. The researchers agree on the benefits of the folding problem solution. In this paper, we have presented a new smart efficient algorithm for the moving path exploitation of amino acids in the process of the protein formation. By this new method, the folding process and formation from 2nd structure to 3rd structure (stable structure) has been examined. In this method, the graph theory is used for the folding roots determining. Finally we can find the shortest and the best path for folding. The protein that is presented in this paper is Barnase which is one of the important enzymes. The advantages of our algorithm are less time consuming, acceptable out put, ability to find the sequences of folding and the contact order. The output of our algorithm for Barnase is more acceptable in comparison with time consuming algorithms.

Keywords:

third structure , graph , path planning , protein engineering