期刊文献+

一种针对多序列比对问题的混合遗传算法求解

Aligning multiple sequences by hybrid genetic algorithm
下载PDF
导出
摘要 针对生物信息学多序列比对问题,提出一个基于混合遗传算法的求解算法:在混合算法中,模拟退火算法用于局部寻优,提高算法的收敛速度,同时防止早熟收敛;禁忌搜索算法通过记忆能力避免进化过程出现循环,提高全局寻优能力;用遗传算法进行全局搜索.对基准序列比对库BA liBASE进行测试,结果表明该算法是有效的. A hybrid genetic algorithm for solving the multiple sequence alignment was proposed. In the hybrid algorithm,SA is used to local-optimize, accelerating the optimization process and avoiding the premature convergence ;TS is used to improve the global-optimize, preventing the repeat between the new individual and the old individual through its memory function; GA is used to global search. Experimental results of benchmarks from the BAliBASE showed that the proposed algorithm was feasible.
作者 程灏
出处 《郑州轻工业学院学报(自然科学版)》 CAS 2009年第6期33-36,共4页 Journal of Zhengzhou University of Light Industry:Natural Science
关键词 生物信息学 多序列比对 混合遗传算法 bioinformatics multiple sequence alignment hybrid genetic algorithm
  • 相关文献

参考文献7

  • 1AttwoodTK Parry-SmithDJ著 罗静初等译.生物信息学概论[M].北京:北京大学出版社,2002..
  • 2Carrillo H, Lipman D J. The multiple sequence alignment problem in biology [ J ]. SIAM Appl Math, 1988, 48 : 1073.
  • 3Hogeweg P, Hesper B. The alignment of sets of sequences and the construction of phylogenetic trees:An integrated method[ J]. Mol Evol, 1984,20 : 175.
  • 4Feng D F and Doolittle R F. Progressive sequence alignment as a prerequisite to correct phylogenetic trees [ J ]. Mol Evol, 1987,25:351.
  • 5Taylor W R. A flexible method to align large numbers of biological sequences[ J ]. Mol Evol, 1988,28 : 161.
  • 6Julie D Thompson, Desmond G Higgins, Toby J Gibson. ClustalW : improving the sensitivity of progressive multiple sequence algnment through sequence weighting, position specific gap penalties and weight matrix choice [ J ]. Nucleic Acids Res, 1994,22(22):4673.
  • 7Cedric Notredame, Desmond G Higgins. SAGA : sequence alignment by genetic algorithm [ J ]. Nucleic Acids Res, 1996,24(8) : 1515.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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