A Triangulated HP Model Of Protein Folding Structure Prediction And Algorithm

The Protein folding structure prediction is one of the theoretically fundamental problems in the Bioinformatics. Solving this problem has great practical meaning in related disciplines such as illness treatment and pharmacy. Applying today's apparatus and method to detect the real structures of great many protein chains is unavailable. So give out a simplified model for protein folding and structure predication and apply modern computer science and technology in this field is a great advance in this subject and one of the simplified model HP model has been proved has high reliability in predict the structure ofα?protein helix.HP model is a densely studied model for predication of the structure of protein chain. We present an improved method and therefore intro duce a triangulated HP model to revise the lattice HP model which has a defect thus greatly infects it's accuracy in calculating the energy of a give n protein chain. The forming process of triangulated HP model is presented in this paper. A fast and highly efficient proximately accurate searching method for NP- Hard problem solution is introduced. It's strategy and policy and detailed procedures and some improvements made by us are fully discussed, such as it's key functions, and dynamically performance to coving the solution space in searching. An improved PERM is employed to calculate the standard calculating cases for 2-D based triangulated model. Densely packed configurations and lower minimum energies are obtained compare to the lattice HP model which proves the effect of improvements to lattice HP model. The difficulties for 2-D triangulated HP model to transported to 3-D space and the searching efficiency of PERM .using different implementations like depth-first-method and broad-first-method is also discussed for future research.