期刊文献+

训练隐马尔可夫模型的BW-GA方法

New HMMs training method based on BW-GA
下载PDF
导出
摘要 Baum-Welch算法是训练HMMs的传统方法,该方法虽然收敛速度快,但容易陷入局部最优,影响了序列比对的质量。针对该算法存在的问题,结合生物遗传与进化的规律,设计了一种将传统方法与遗传算法相结合训练HMMs的BW-GA方法。根据序列比对的需要和HMMs的结构,定义了3种遗传操作和编码方式。用19条原核5sRNA序列对模型进行了训练,用BW-GA训练模型产生序列的对数似然概率比单独用传统方法训练的要高,产生序列比对的质量较好。 Traditional method for training HMMs is Baum-Welch algorithm which is noted for the rapid convergence.However,this method can only lead to local optimization and effects quantity of sequence alignment.In response to these problems for training HMMs using Baum-Welch algorithm and integration of laws in biological genetics and evolution,a new HMMs training method based on BW-GA that combines traditional method and genetic algorithm is proposed.According to the need of genetic alignment and structure of HMMs,three genetic operations and coding methods are designed.HMMs is trained with 19 nuclear 5sRNA sequences by applying BW-GA,which makes the sequences generated have a higher log-likelihood of probability than just applying traditional methods,and a better multi-sequence alignment is generated.
出处 《计算机工程与应用》 CSCD 北大核心 2010年第17期236-238,共3页 Computer Engineering and Applications
基金 华中农业大学学科研究交叉基金(No.2008XKJC008)
关键词 多序列比对 隐马尔可夫模型 遗传算法 对数似然概率 multi-sequence alignment hidden markov models genetic algorithm log likelihood probability
  • 相关文献

参考文献8

二级参考文献17

  • 1潘正君 等.进化计算[M].北京:清华大学出版社,广西科技出版社,1998.1-20.
  • 2JIANG Tao, Kearney P, Li Ming. Some Open Proble ms in Computational Molecular Biology[J]. J of Algorithms, 2000, 34: 194-201 .
  • 3WANG L, JIANG T. On the Complexity of Multiple Sequence Al ignment[J]. J Comput Biol, 1994, 1: 337-348.
  • 4WANG L, Gusfield D. Improved Approximation Algorithms for T ree Alignment[J]. J of Algorithms, 1997, 25: 255-273.
  • 5Gusfield D. Efficient Methods for Multiple Alignment with Guar anteed Error Bounds[J]. Bull Math Biol, 1993, 55: 141-154.
  • 6Carrillo H, Lipman D. The Multiple Sequence Alignment Problem in Biology[J]. SIAM J Appl Math, 1988, 48: 1073-1082.
  • 7Altschul S F, Lipman D J. Trees, Stars and Multiple Biological Sequence Alignment[J]. SIAM J Appl Math, 1989, 49: 197-209[ ZK)
  • 8Chan S C, Wong A K C, Chen D K Y. A Survey of Multiple Sequenc e Comparison Methods[J]. Bulletin of Mathematics Biology, 1992, 54: 563-598.
  • 9Lipman D J, Altschul S F, Kececioglu J D. A Tool for Multip le Sequence Alignment[J]. Proc natn Acad Sci, 1989, 86: 4412- 4415.
  • 10Kirkpatrick S, Gelatt Jr C D, Vecchi M P. Optimization by Simu lated Annealing[J]. Science, 1983, 220: 671-680.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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