EvolutionTrees-国立中山大学资讯工程学系平行处理实验室.pptVIP

  • 6
  • 0
  • 约5.97千字
  • 约 37页
  • 2018-11-27 发布于广东
  • 举报

EvolutionTrees-国立中山大学资讯工程学系平行处理实验室.ppt

EvolutionTrees-国立中山大学资讯工程学系平行处理实验室

5 Chapter 5 An Evolution Tree Tree Topology Rooted trees Unrooted trees Properties of an Evolution Tree Leaf nodes represent species. In a rooted tree, the degree of each internal node is 3, except the root. In an unrooted tree, the degree of each internal node is 3. In a rooted tree, the distances from the root to all leaf nodes are the same. Distance Matrix and Rooted Tree Distance d(si, sj): the distance between species si and sj in the distance matrix dt(si, sj): the distance between species si and sj in an evolution tree d(si, sj) ? dt(si, sj) s1 = agctccc

文档评论(0)

1亿VIP精品文档

相关文档