全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于归一化编辑距离的系统进化树重构

Keywords: 归一化编辑距离,系统进化树,多序列比对,计算复杂性

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了克服传统距离法在构建进化树时需要进行多序列比对所带来的计算复杂度问题,提出了利用两两序列之间的归一化编辑距离矩阵来构造进化树的方法.通过对11种脊椎动物和20种哺乳动物的Nd5、Nd4和cytb的基因序列以及线粒体全基因组序列数据,分别计算归一化编辑距离矩阵,并使用Neighbor-Joining法,重建了一些已被多种方法验证过的进化树。

References

[1]  郝柏林.张淑誉.生物信息学手册[M].上海:上海科学技术出版社,2002:203-205.
[2]  根井正利,库马.分子进化与系统发育[M].吕宝忠,译.北京:高等教育出版社,2002:98-99.
[3]  LI Ming,BADGER J H,CHEN Xin,et al.An information-Based sequence distance and its application to whole mitochondrial genome phylogeny[J].Bioinformatics,2001,17:149-154.
[4]  HASAN H,SAYOOD K.A new sequence distance measure for phylogenetic tree construction[J].Bioinformatics,2003,19 (16):2122-2130.
[5]  蔡旭,方伟武,张文.基于线粒体全基因组的非比对方法比较[J].计算机与应用化学,2005,22(10):837-844.CAI Xu,FANG Wei-wu,ZHANG Wen.Comparison of alignment-free methods based on mitochondrion complete genome [J].Computers and Applied Chemistry,2005,22(10):837-844.(in Chinese)
[6]  LI Yu-jian,LIU Bo.A normalized Levenshtein distance metric[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2007,29(6):1091-1095.
[7]  LEVENSHTIEN A.Binary codes capable of correcting deletions,insertions and reversals[J].Soviet Physics Doklady,1966, 10(8):707-710.
[8]  SANKOFF D,KRUSKAL J B,TIME W.String edits and macromolecules:The theory and practice of sequence comparison [J].Addison Welsey,1983,3:253-263.
[9]  RUSSO C,TAKEZAKI A N,NEI M.Efficiencies of different genes and different tree building methods in recovering a known wertebrate phylogeny[J].Molecular Biology And Evolution,1996,13:525-536.
[10]  SAITOU N,YAMAMOTO F.A new method for reconstructing phylogenetic trees[J].Molecular Biology and Evolution, 1987,4:406-411.
[11]  CAO Y,JANKE A,WADDELL P J,et al.Conflict among individual mitochondrial proteins in resolving the phylogeny of Eutherian orders[J].J Mol Evol,1998,47:307-322.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133