Abstract
Protein Folding Problem (PFP) is one of the most challenging problems of combinatorial optimization with applications in bioinformatics and molecular biology. The aim of PFP is to find the three-dimensional structure of a protein, this structure is known as Native Structure (NS), which is characterized by the minimal energy of Gibbs and it is commonly the best functional structure. To find an NS knowing only the amino acids sequence (primary structure) of a protein is known as ab initio problem. A protein can take a huge number of different conformational structures from its primary structure to the NS. For solving PFP, several computational strategies are applied in order to search structures of protein on a huge space of possible solutions. In this work, the most popular methods and strategies are compared, and advantages and disadvantages of them are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
