期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Fast Tree Search for A Triangular Lattice Model of Protein Folding
1
作者 xiaomeili nengchaowang 《Genomics, Proteomics & Bioinformatics》 SCIE CAS CSCD 2004年第4期245-252,共8页
Using a triangular lattice model to study the designability of proteinfolding, we overcame the parity problem of previous cubic lattice model and enumerated all thesequences and compact structures on a simple two-dime... Using a triangular lattice model to study the designability of proteinfolding, we overcame the parity problem of previous cubic lattice model and enumerated all thesequences and compact structures on a simple two-dimensional triangular lattice model of size4+5+6+5+4. We used two types of amino acids, hydrophobic and polar, to make up the sequences, andachieved 2^(23)+2^(12) different sequences excluding the reverse symmetry sequences. The totalstring number of distinct compact structures was 219,093, excluding reflection symmetry in theself-avoiding path of length 24 triangular lattice model. Based on this model, we applied a fastsearch algorithm by constructing a cluster tree. The algorithm decreased the computation bycomputing the objective energy of non-leaf nodes. The parallel experiments proved that the fast treesearch algorithm yielded an exponential speed-up in the model of size 4+5+6+5+4. Designabilityanalysis was performed to understand the search result. 展开更多
关键词 triangular lattice model protein folding fast search tree DESIGNABILITY
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部