%0 Journal Article
%T Fast Tree Search for Triangular Lattice Model and Designability Analysis<br>三角网格模型的快速树搜索算法及可设计性分析
%A LI Xiao-Mei
%A WANG Neng-Chao
%A <br>李小妹
%A 王能超
%J 计算机科学
%D 2005
%I 
%X Using a triangular lattice model to research designability of protein folding,we overcame parity problem of previous cubic lattice model.This paper enumerated all the sequences and compact conformations on a two-dimension triangular lattice simple model of size 4 5 6 5 4.The energy of a sequence folded into a structure is minus the number of hydrophobic amino acids in the"core"of the structures.We used two types of amino acids-hydrophohic (H) and polar (P)-to make up the sequence,so there are 2~(24) 2~(12) different sequences excluding the reverse symmetry se- quences.The total simple solvation string number of distinct structures was 219093 excluding reflection symmetry in the self-avoiding path of length 24 triangular lattice model.Based on triangular lattice model,a fast search algorithm is presented in order to search the protein conformation space by constructing a fast search tree.The algorithm decreased the computation by computing the objective energy of tree nodes.The parallel experiments proved that the fast tree search algorithm yielded an exponential speed-up in models of size 4 5 6 5 4.To understand the search result we perform statistical analysis in designability.
%K Triangular lattice model
%K Protein folding
%K Fast search tree
%K Designability<br>三角网格模型
%K 蛋白质折叠
%K 聚类树
%K 可设计性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=23764C4339AEA80D&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=59906B3B2830C2C5&sid=F260CE035846B3B8&eid=ED01F5AE50BE09C0&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=12