An ultrafast tool for minimum reticulate networks
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 38-41 |
| Journal / Publication | Journal of Computational Biology |
| Volume | 20 |
| Issue number | 1 |
| Publication status | Published - 1 Jan 2013 |
Link(s)
Abstract
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. © 2013 Mary Ann Liebert, Inc.
Research Area(s)
- (acyclic) agreement forest, hybridization number, phylogenetic tree, reticulate network, rSPR distance
Citation Format(s)
An ultrafast tool for minimum reticulate networks. / Chen, Zhi-Zhong; Wang, Lusheng.
In: Journal of Computational Biology, Vol. 20, No. 1, 01.01.2013, p. 38-41.
In: Journal of Computational Biology, Vol. 20, No. 1, 01.01.2013, p. 38-41.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
