期刊文献+

基于DNA序列的系统进化树构建 被引量:10

Construction of phylogenetic tree based on DNA sequences
下载PDF
导出
摘要 【目的】利用生物DNA序列构建系统进化树,以分析生物的进化过程。【方法】利用最大似然估计原理,给出了构建系统发生树的模型和算法。分别建立了确定父节点的ML模型、确定进化时间的ML模型以及保守概率与相似度关系模型;并通过递推,逐步恢复生物进化的原过程。【结果】给定一系列生物的DNA序列,通过本算法可以建立这些生物的系统进化树,以及生物各自父辈的DNA序列和进化时间。【结论】由本研究构建算法得到的生物进化关系合理、算法复杂度低,可以用于大规模生物群体的系统进化树构建。 【Objective】 The study constructed phylogenetic tree based on DNA sequence to analyze the evolutionary process of organism.【Method】 A model and an algorithm were provided for constructing phylogenetic tree based on the principle of maximum likelihood estimate.Firstly,the ML model was given to determine father node,evolutionary time and the relationship between conserved probability and similarity.Then the process of organism evolution was recovered.【Result】 Given a set of DNA sequences,phylogenetic tree can be constructed by our algorithm.Also,the father sequences and the evolutionary time are obtained from the evolutionary tree.【Conclusion】 Phylogenetic trees obtained from our algorithm are rational.Furthermore,the algorithm is simple,and can be used to construct phylogenetic tree in large scale DNA sequences.
出处 《西北农林科技大学学报(自然科学版)》 CSCD 北大核心 2008年第10期221-226,共6页 Journal of Northwest A&F University(Natural Science Edition)
基金 国家自然科学基金项目(60574039和30670486) 陕西省自然科学计划项目(SJ08-ZT15) 长安大学科技发展基金项目(07J04)
关键词 DNA序列 系统进化树 最大似然估计 进化时间 DNA sequence phylogenetic tree maximum likelihood estimate evolutionary time
  • 相关文献

参考文献17

  • 1Chor B, Tulle T. Maximum likelihood of evolutionary trees: hardness and approximation [J]. Bioinformaties, 2005,1 ( 21 ) : i97-i106.
  • 2常青,周开亚.分子进化研究中系统发生树的重建[J].生物多样性,1998,6(1):55-62. 被引量:54
  • 3Dave Thomas. Example calculation of phylogenies: the UPGMA method [EB/OL]. [2008-02-13]. http://www. II1TLSr. org/upgma/htm.
  • 4Saitou N,Nei M. The neighbor-joining method: a new method for reconsmacting phylogenetic trees [J]. Molecular Biology and Evolution, 1987,4(4) :406-425.
  • 5Chris. Fitch-Margoliash algorithm for calculating the branch lengths [EB/OL]. [2008-02-13]. http://www. bioinfo. rpi. edu/-bystrc/Courses/blo14540/lecture12/sld002/htm.
  • 6Studier J A,Keppler K J. A note on the neighbor-joining method of Saitou and Nei [J]. Mot Biol Evol, 1988,5: 729-731.
  • 7Pearson W R, Robins G, Zhang T. Generalized neighbor-joining: more reliable phylogenefic tree reconstruction [J]. Molecular Biology and Evolution, 1999,16(6):806-816.
  • 8William J B,Nicholas D S,Aaron L H. Weighted neighbor-joining: a likelihood based aptnvaeh to distance based phylogeny reconstruction [J]. Molecular Biology and Evolution, 2000, 17(1) : 189-197.
  • 9Ranwez V,Gascuel O. Improvement of distancebased phylogenetic methods by a local maximum likelihood approach using triplets [J]. Molecular Biology and Evolution,2002,19(11):1952-1963.
  • 10李斌,何红波,李义兵.基于DNA序列LZ复杂性距离的系统进化树重构[J].高技术通讯,2006,16(5):506-510. 被引量:4

二级参考文献15

  • 1吕宝忠 钟扬 高莉萍.分子进化与系统发育[M].北京:高等教育出版社,2002..
  • 2Mount D W.Bioinformatics:sequence and genome analysis.Cold Spring Harbor,NY:Cold Spring Harbor Laboratory Press,2001.337-342
  • 3Vinga S,Almeidal J.Alignment-free sequence comparison:a review.Bioinformatics,2003,19(4):513-523
  • 4Hao B L,Qi J,Wang B.Prokaryotic phylogeny based on complete genomes without sequence alignment.Modern Physics Letters B,2003,17(2):91-94
  • 5Hao B L,Qi J.Prokaryote phylogeny without sequence alignment:from avoidance signature to composition distance.Journal of Bioinformatics and Computational Biology,2004,2(1):1-19
  • 6Li M,Vitanyi P.An Introduction to Kolmogorov Complexity and Its Applications(2nd edition).Berlin Heidelberg:Springer Verlag,1997.3-8
  • 7Li M,Badger J H,Chen X,et al.An information based sequence distance and its application to whole mitochondrial genome phylogeny.Bioinformatics,2001,17(2):149-154
  • 8Chen X,Kwong S,Li M.A compression algorithm for DNA sequences and its applications in genome comparison.Genome Inform Ser Workshop Genome Information,1999,10:51-61
  • 9Hisahiko S,Takashi Y.DNA data compression in the post genome era.Genome Informatics,2001,12:512-514
  • 10Lempel A,Ziv J.On the complexity of finite sequences.IEEE Transactions on Information Theory,1976,IT-22(1):75-81

共引文献56

同被引文献92

引证文献10

二级引证文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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