期刊文献+

生物DNA序列比对算法研究 被引量:1

Study on the Algorithm of DNA Sequence Alignment in Bioinformatics
下载PDF
导出
摘要  基于典型CLUSTALW序列比对算法,研究一种局部优化的多序列比对算法,用减少序列比对过程中总评分的方法来达到优化算法的目的,并对基因库中的序列进行了测试. According to the typical sequence alignment CLUSTALW algorithms, we study a local optimizing algorithm which optimizes the algorithm by lower the alignment scores through alignment. And some sequences in the gene base are tested.
作者 段敏 许龙飞
出处 《佳木斯大学学报(自然科学版)》 CAS 2005年第2期153-158,共6页 Journal of Jiamusi University:Natural Science Edition
基金 国家自然科学基金资助项目(60374070) 广东省自然科学基金资助项目(031903)
关键词 生物信息学 DNA序列 序列比对算法 数据挖掘 bioinformatics DNA sequence sequence alignment algorithm data mining
  • 相关文献

参考文献7

  • 1MountD.W.钟扬 王莉 张亮等译.生物信息学[M].北京:高等教育出版社,2003..
  • 2SetubalJ. Meidanis J.朱浩等译.计算分子生物学导论[M].北京:科学出版社,2003..
  • 3Chan S C., Wong A K C, Chiu D K Y. A survey of multiple sequence comparison ethods[J]. Bull MathBiol, 1992,54:563 - 598.
  • 4Carrillo H. ,Lipman D. The multiple sequence alignment problem in biology[J] .SIAM J Appl Math, 1988,48:1073 - 1082.
  • 5Takahiro Lkeda, Hiroshi Lmai. Enhanced A * algorithms for multiple alignments :optimal alignments for several sequences and k - opl approximate alignments for large cases[J]. Theoretical Computer Science, 1999,210:341 -374.
  • 6Hanada K, Yokoyama T,Shimizu T. Multiple sequence alignment by genetic algorithm[J]. Genome Informationcs, 2000,11:317- 318.
  • 7李红涛,袁激光,金人超.一种多序列比对的局部优化算法[J].计算机工程与应用,2003,39(15):99-101. 被引量:3

二级参考文献5

  • 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.

共引文献2

同被引文献7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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