期刊文献+

一种多搜索策略的多生物序列比对自适应遗传算法 被引量:2

Multiple-Searching Adaptive Genetic Algorithm for Multiple Sequence Alignment
下载PDF
导出
摘要 多生物序列比对是用来计算生物序列间相似性的重要工具,本文在引入熵来度量种群多样性的基础上,提出了一种多搜索策略的自适应遗传算法,其交叉和变异概率随着熵的变化进行自动调整,并且综合考虑了利用动态规划算法来设计遗传操作算子.实验结果表明,这个算法具有较强的全局搜索能力和局部搜索能力,并且能有效的克服未成熟收敛问题. The multiple sequence alignment can reveal sequence similarity; with the introduction of entropy of evaluating the diversity of population in genetic algorithm, this paper proposed a adaptive genetic algorithm for multiple sequence alignment, and probabilities of crossover and mutation were adjusted based on the entropy, furthermore, with the consideration of classical dynamic programming algorithms, this paper presented some new genetic operators. The experiment results showed that the algorithm presented can overcome permutation convergence and find global optima efficiently.
出处 《小型微型计算机系统》 CSCD 北大核心 2006年第5期854-857,共4页 Journal of Chinese Computer Systems
基金 国家"八六三"高技术研究发展计划项目(2002AA104560 2001AA111041)资助
关键词 序列比对 遗传算法 sequence alignment genetic algorithm entropy
  • 相关文献

参考文献2

二级参考文献9

  • 1H Carrillo,D Lipman.The multiple sequence alignment problem in biology[J].SIAM J Appl Math, 1988;48 : 1073-1082.
  • 2Gupta S K,Kececioglu J D,Schaffer A A.lmproving the Practical Space and Time Efficiency of the Shortest-paths Approach to Sum-of-pairs Multiple Sequence Alignment[J].J Computational Biology,1995 ; 2 (3) : 459-472.
  • 3S C Chan,A K C Wong,D K Y Chiu.A survey of multiple sequence comparison methods[J].Bull Math Bio1,1992;54:563-598.
  • 4Naruya Saitou,Masatoshi Nei.The Neighbor-joining Method:A New Method for Reeontrueting Phylogenetie Trees[J].Mol Bid Evol, 1987;4 (4) :406-425.
  • 5Takahiro Ikeda,Hiroshi Imai.Enhaneed A^* algorithms for mulliple alignments :optimal alignments for several sequences and k-opt approximate alignments for large cases[J].Theoretical Computer Science; 1999;210:341-374.
  • 6Altschul S F, Madden T L, Schaffer A A,et al. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs[J]. Nucleic Acids Research,1997,25(17):3389~3402
  • 7Klaus Bucka-Lassen, Caprani O, Hein J,et al. Combining many multiple alignments in one improved alignment[J]. Bioinformatics, 1999,15(2):122~130
  • 8Karlin S, Altschul S F. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes[J]. Proc Natl Acad Sci USA,1990,87(3):2264~2268
  • 9Miller W. Comparison of genomic DNA sequence: solved and unsolved problems[J]. Bioinformatics,2001,17(5):391~397

共引文献5

同被引文献17

  • 1刘习春,喻寿益.局部快速微调遗传算法[J].计算机学报,2006,29(1):100-105. 被引量:37
  • 2王本年,高阳,陈兆乾,谢俊元,陈世福.RLGA:一种基于强化学习机制的遗传算法[J].电子学报,2006,34(5):856-860. 被引量:9
  • 3何宏,钱锋.基于寿命的变种群模糊遗传算法[J].小型微型计算机系统,2006,27(6):992-995. 被引量:5
  • 4Mecorkle D S,Bryden K M,Carmichael C G.A new methodology for evolutionary optimization of energy systems[J].Comput Methods Appl Mech Engrg,2003,192:5021-5036.
  • 5Codrea C M,Aittokallio T,Keranen M,et al.Feature learning with a genetic algorithm for fluorescence fingerprinting of plant species[J]. Pattern Recognition Letters, 2003,24( 15 ) : 2663-2673.
  • 6Leung Y,Gao Y,Xu Z B.Degree of population diversity-a perspective on premature convergence in genetic algorithms and its markov chain analysis[J].IEEE Trans on Neural Networks, 1997,8:1165-1176.
  • 7MURTHY C S R, REDDY T B, KARTHIGEYAN I,et al. Quality of service provisioning in Ad hoc wireless networks: a survey of issues and solutions[ J]. Ad HOe Network,2006,4( 1 ) :83-124.
  • 8BADARNEH O, KADOCH M, ELHAKEEM A. QoS multilayered muhicast routing protocol for video transmission in heterogeneous wire- less Ad hoc networks [ J ]. WSEAS Trans on Computers,2008,7 (6) :680-693.
  • 9INAGAKI J, HASEYAMA M, KITAJIMA H. A genetic algorithm for determining multiple routes and its applications[ C ]//Proc of IEEE International Symposium on Circuits and Systems. Washington DC: IEEE Computer Society, 1999 : 137-140.
  • 10OH S, AHN C W, RAMAKRISHNA R S. A genetic-inspired multi- cast routing optimization algorithm with bandwidth and end-to-end de- lay constraints [ C ]//Proc of the 13th International Conference on Neural Information Process. Berlin : Springer-Verlag, 2006 : 807- 816.

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部