|
|||||
|
|
| 一种新的蛋白质结构字母序列优化算法 | |
| 引用本文： | 高静宇,马文丽,孙汉顺,孙立哲,郑文岭. 一种新的蛋白质结构字母序列优化算法[J]. 生物信息学, 2010, 8(3): 202-205 |
| 作者姓名： | 高静宇 马文丽 孙汉顺 孙立哲 郑文岭 |
| 作者单位： | 1. 上海大学电子生物中心,上海,200072;华南基因组研究中心,广州,510800 2. 上海大学电子生物中心,上海,200072;南方医科大学基因工程研究所,广州,510515 3. 上海大学电子生物中心,上海,200072 |
| 摘 要： | 基于蛋白质结构字母的预测和分析方法,一个必然的步聚,是将目标蛋白质离散成结构字母序列。本文在对蛋白质结构字母序列空间,及其最小根均方偏差变化,穷举分析的基础上,提出了一种新的蛋白质结构字母序列优化算法,全局贪婪算法。全局贪婪算法避免了基本贪婪算法过度依赖候选集大小,计算量过大、以及过早收缩于局部最小等缺点。经实验分析,全局贪婪算法在性能上优于基本贪婪算法和局部最优方法。。 |
| 关 键 词： | 结构字母 基本贪婪算法 全局贪婪算法 |
A new approach to optimizing the structure alphabet sequences of proteins |
|
| GAO Jing-yu,MA Wen-li,SUN Han-shun,SUN Li-zhe,ZHENG Wen-ling. A new approach to optimizing the structure alphabet sequences of proteins[J]. Chinese Journal of Bioinformatics, 2010, 8(3): 202-205 | |
| Authors: | GAO Jing-yu MA Wen-li SUN Han-shun SUN Li-zhe ZHENG Wen-ling |
| Affiliation: | 1.Bioelectronics Research Center,Shanghai University,Shanghai 200072,China;2.Institute of Genetic Engineering,Southern Medical University,Guangzhou 510515,China;3.South Genomics Research Center,Guangzhou 510800,China) |
| Abstract: | For Any Fragment-based protein structure prediction and analysis,it is essential to discrete each protein structure into a series of protein structure alphabet.The paper proposed a new method to optimizing the structure alphabet sequences of proteins with the base of exhaustive analysis all protein structure sequence and the variation of least root mean square deviation（LRMSD）,global greed algorithm.The method avoids the weaknesses of basic greed algorithm which highly depends on candidate set size,demands more computer power,degrade rapidly.Experimental result show,the performance of global greed algorithm is superior to basic greed algorithm and local optimal methods. |
| Keywords: | protein structure alphabet basic greed algorithm global greed algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |