蛋白质折叠的格点HP模型是Dill等人八十年代末提出的.该文根据链的结点数确定折叠后结构,给出了一种求解蛋白质结构问题的三维HP模型优化算法,该算法在确定最紧密排列原则下,通过一系列简化,方便快捷地求出了蛋白质链长小于27的所有肽链的折叠情况.“,”The chains of protein folding HP lattice model in 3D are studied by simplification of chain. We present an optimization algorithm to solve this problem in short cases based on the lowest energy exhaustive method. This algorithm consists three steps: predetermine compact structures, find paths through all points and fill H or P in all paths in order to find the minimum energy and the corresponding structure. By simulation tests, this optimization algorithm on chain and structure can achieve a superior performance for solving protein folding HP model.