4.5 Article

An Ultrafast Tool for Minimum Reticulate Networks

期刊

JOURNAL OF COMPUTATIONAL BIOLOGY
卷 20, 期 1, 页码 38-41

出版社

MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2012.0240

关键词

(acyclic) agreement forest; hybridization number; phylogenetic tree; reticulate network; rSPR distance

资金

  1. Research Grants Council of the Hong Kong Special Administrative Region, China [CityU 121608]
  2. Grants-in-Aid for Scientific Research [24500023] Funding Source: KAKEN

向作者/读者索取更多资源

Due to hybridization events in evolution, studying different genes of a set of species may yield two or more related but different phylogenetic trees for the set of species. In this case, we want to combine the trees into a reticulate network with the fewest hybridization events. In this article, we develop a software tool (named UltraNet) for several fundamental problems related to the construction of minimum reticulate networks from two or more phylogenetic trees. Our experimental results show that UltraNet is much faster than all previous tools for these problems.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据