4.5 Article

An Ultrafast Tool for Minimum Reticulate Networks

Journal

JOURNAL OF COMPUTATIONAL BIOLOGY
Volume 20, Issue 1, Pages 38-41

Publisher

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

Keywords

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

Funding

  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

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available