• 综合
  • 标题
  • 关键词
  • 摘要
  • 学者
  • 期刊-刊名
  • 期刊-ISSN
  • 会议名称
搜索

作者:

Li, Yu-Jian (Li, Yu-Jian.) | Wang, Fang-Yuan (Wang, Fang-Yuan.)

收录:

EI Scopus PKU CSCD

摘要:

In order to conquer the computational complexity problem caused by multiple sequence alignment in traditional distance methods, this paper presents a new tree-construction method, which uses a normalized edit distance matrix between pairs of sequences and the Neighbor-Joining algorithm to construct phylogenetic trees. Using sequences of Nd5, Nd4, Cytb and mtDNA respectively from 11 vertebrate species and 20 mammalian species, the method can successfully generate consistent phylogenetic trees with those which have been examined by several other approaches.

关键词:

Bioinformatics Computational complexity Mammals Trees (mathematics)

作者机构:

  • [ 1 ] [Li, Yu-Jian]College of Computer Science, Beijing University of Technology, Beijing 100022, China
  • [ 2 ] [Wang, Fang-Yuan]College of Computer Science, Beijing University of Technology, Beijing 100022, China

通讯作者信息:

电子邮件地址:

查看成果更多字段

相关关键词:

相关文章:

来源 :

Journal of Beijing University of Technology

ISSN: 0254-0037

年份: 2008

期: 11

卷: 34

页码: 1211-1215

被引次数:

WoS核心集被引频次: 0

SCOPUS被引频次:

ESI高被引论文在榜: 0 展开所有

万方被引频次:

中文被引频次:

近30日浏览量: 2

在线人数/总访问数:1296/2956808
地址:北京工业大学图书馆(北京市朝阳区平乐园100号 邮编:100124) 联系我们:010-67392185
版权所有:北京工业大学图书馆 站点建设与维护:北京爱琴海乐之技术有限公司