期刊文献+

多序列渐进式比对算法研究与比较 被引量:1

Study and comparison of multiple sequence progressive alignment algorithms
下载PDF
导出
摘要 多序列比对是一种重要的生物信息学工具,在生物的进化分析以及蛋白质的结构预测方面有着重要的应用。以ClustalW为代表的渐进式多序列比对算法在这个领域取得了很大的成功,成为应用最为广泛的多序列比对程序。但其固有的缺陷阻碍了比对精度的进一步提高,近年来出现了许多渐进式比对算法的改进算法,并取得良好的效果。本文选取了其中比较有代表性的几种算法对其基本比对思想予以描述,并且利用多序列比对程序平台BAliBASE和仿真程序ROSE对它们的精度和速度分别进行了比较和评价。 Multiple sequence alignment is one of the essential tools of studying bioinformatics and it plays an important role in the evolution analysis and protein structure prediction. Multiple sequence progressive alignment algorithms, represented by Custal W has achieved great success in this research field, making it most widely applied. However, the inherent disadvantage of the program has encumbered further improvement of alignment efficiency. In recent years many improved progressive methods were then developed and received good results. In this article, some of the representatives of the methods are selected and their basic ideas are sketched. The efficiency and speed of these methods are also compared and evaluated through using BAliBASE and simulation program ROSE.
出处 《生物信息学》 2005年第2期73-76,共4页 Chinese Journal of Bioinformatics
基金 国家重点基础研究发展规划项目(No.2004CB518901) 国家自然科学基金(No.10272030)
  • 相关文献

参考文献8

  • 1[1]Osamu Gotoh. Multiple sequence alignment: algorithms and applications[ J]. Adv. Biophys, ( 1999)36,159 - 206. 被引量:1
  • 2[3]Julie D.Thompson, et al. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting ,positon- specific gap penalties and weight matrix choice[ J]. Nucleic.Acids. Research, ( 1994)22, 4673 - 4680. 被引量:1
  • 3[4]Osamu Gotoh. Significant Improvement in Accuracy of Multiple Protein Sequence Alignments by Iterative Refinement as Assessed by Reference to Structural Alignments[J]J. Mol. Biol,(1996)264, 823-838. 被引量:1
  • 4[5]Kazutaka Katoh, et al. MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform[J]. Nucleic. Acids.Research, (2002) 30, 3059 - 3066. 被引量:1
  • 5[6]Robert C. Edgar. MUSCLE: multiple sequence alignment with high accuracy and high throughput[J] .Nucleic. Acids. Research, (2004)32,1792- 1797. 被引量:1
  • 6[7]Cedric Notredame. T-COFFEE: A Novel Method for Fast and Accurate Multiple Sequence Alignment[J].J. Mol. Biol,(2000)302,205-217. 被引量:1
  • 7[8]Anne Bahr, Julie D.Thompson, et al. BaliBASE(Benchmark Alignment database): enhancements for repeats , transmembrance sequence and circular permutations[ J]. Nucleic. Acids. Research, (2001)29,323 - 326. 被引量:1
  • 8[9]Jene Stoye, et al. Rose: generating sequence families [ J ]. Bioinformatics, (1998) 14, 157 - 163. 被引量:1

同被引文献13

  • 1YANG Jing,LI Cheng-yun,WANG Yun-yue,ZHU You-yong,LI Jin-bin,HE Xia-hong,ZHOU Xiao-gang,LIU Lin,YE Yan-fen.Computational Analysis of Signal Peptide-Dependent Secreted Proteins in Saccharomyces cerevisiae[J].Agricultural Sciences in China,2006,5(3):221-227. 被引量:3
  • 2LASSMANN T, SONNHAMMER E L L. Quality assess- ment of multiple alignment programs [ J ]. FEBS, 2002, 529 : 126 - 130. 被引量:1
  • 3OSAMU G. Multiple sequence alignment: algorithm and applications[ J]. Adv Biophys, 1999,36 : 159 - 206. 被引量:1
  • 4THOMPSON J D, PLEWNIAK F, POCH O. A compre- hensive comparison of multiple sequence alignment pro- grams [ J]. Nucleic Acids Res, 1999,27 : 2682 - 2690. 被引量:1
  • 5KARPLUS K, HU B. Evaluation of protein multiple a- lignments by SAM-T99 using the BALIBASE muhiple a- lignment test set [J]. Bioinformaties, 2001,17:713 - 720. 被引量:1
  • 6MORGENSTERN B. DIALIGN: multiple DNA and pro- tein sequence alignment at BiBiServ [ J ]. Nucl Acids Res, 2004,32:33-36. 被引量:1
  • 7CEDRIC N, DESMOND G H, JAAP H. T-Coffee: a novel method for fast and accurate multiple sequence align- ment[J]. J Mol Biol, 2000, 302:205 -217. 被引量:1
  • 8尚骅.代数运算与自然数[EB/OL].(2002-05-23)[2010- 04 - 12 ]. http://media, open. edu. cn/media_ file/rm/ip2/2002_5_23/gdds/gdds2/htm/gdds05. htm. 被引量:1
  • 9MARC S, KENNETH S. Permutation distance measures for memetic algorithms with population management [ C ]. The Sixth Metaheuristics International Conference. Vienna, Austria, 2005. 被引量:1
  • 10HIRSCHBERG D S. A linear space algorithm for computing maximal common subsequences [ J]. Communications of the ACM, 1975,18 : 341 - 343. 被引量:1

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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