一种基于二叉树的快速穷举化搜索算法

本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法，该算法通过使用序列分解、排列分类方法，将复杂度为2^m种的CN^m次搜索变成复杂度为m种的CN^m次搜索，大大提高了利用格子模型搜索蛋白质能量最低构象的速度。同时，由于二叉树良好的方向性，有效地避免了搜索的盲目性。

Fast Exhaustive Search Algorithm Based on Binary Trees

This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree. The algorithm speeds up the search by using sequence partition and permutation classification that make the 2~m kinds of C~m_N searching to m kinds of C~m_N searching. Moreover, the search can avoid the blindness for the good guidance quality of the binary tree.