Quasi-physical Algorithm for Protein Folding in an Off-Lattice Model

<正> We study a three-dimensional off-lattlce protein folding model,which involves two species of residuesinteracting through Lennard-Jones potentials.By incorporating an extra energy contribution into the original potentialfunction,we replace the original constrained problem with an unconstrained minimization of a mixed potential function.As such an efficient quasi-physical algorithm for solving the protein folding problem is presented.We apply the proposedalgorithm to sequences with up to 55 residues and compare the computational results with the putative lowest energyfound by several of the most famous algorithms,showing the advantages of our method.The dynamic behavior of thequasi-physical algorithm is also discussed.

We study a three-dimensional off-lattice protein folding model, which involves two species of residues interacting through Lennard-Jones potentials. By incorporating an extra energy contribution into the original potential function, we replace the original constrained problem with an unconstrained minimization of a mixed potential function. As such an efficient quasi-physical algorithm for solving the protein folding problem is presented. We apply the proposed algorithm to sequences with up to 55 residues and compare the computational results with the putative lowest energy found by several of the most famous algorithms, showing the advantages of our method. The dynamic behavior of the quasi-physlcal algorithm is also discussed.